Düben, Christian writes
I weighted the edges between co-authors by their number of joint papers.
As far a I understand we need a binary network. Otherwise can can easily be an a situation where we say that the shortest path between A and C is through B, even though A and C have written a paper together.
First, I calculated the distance matrix. Distances are measured as the length of Dijkstra's shortest cost paths. Calculating and writing those 2,227,084,864 cell values to disk took 4.77 minutes in a process parallelized across 8 cores. Computing each author's closeness value and writing it to disk took 4.27 minutes in an 8 core process. Betweenness is quite slow in comparison.
It would be many many times faster than what I do now.
See you tomorrow.
Yes, 19:30 my time. -- Cheers, Thomas Krichel http://openlib.org/home/krichel skype:thomaskrichel