1 Who is the best connected scientist ? A study of scientific coauthorship networks

Using data from computer databases of scientific papers in physics, biomedical research, and computer science, we have constructed networks of collaboration between scientists in each of these disciplines. In these networks two scientists are considered connected if they have coauthored one or more papers together. We have studied many statistical properties of our networks, including numbers of papers written by authors, numbers of authors per paper, numbers of collaborators that scientists have, typical distance through the network from one scientist to another, and a variety of measures of connectedness within a network, such as closeness and betweenness. We further argue that simple networks such as these cannot capture the variation in the strength of collaborative ties and propose a measure of this strength based on the number of papers coauthored by pairs of scientists, and the number of other scientists with whom they worked on those papers. Using a selection of our results, we suggest a variety of possible ways to answer the question "Who is the best connected scientist?".

[1]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

[2]  Alfred J. Lotka,et al.  The frequency distribution of scientific productivity , 1926 .

[3]  P. Erdös,et al.  The Gaussian Law of Errors in the Theory of Additive Number Theoretic Functions , 1940 .

[4]  A RAPOPORT,et al.  A study of a large sociogram. , 2007 .

[5]  Thomas J. Fararo,et al.  A study of a biased friendship net , 1964 .

[6]  D J PRICE,et al.  NETWORKS OF SCIENTIFIC PAPERS. , 1965, Science.

[7]  R. Keith,et al.  A Handbook , 2006 .

[8]  Sharon L. Milgram,et al.  The Small World Problem , 1967 .

[9]  Henry Voos.  Lotka and information science , 1974, J. Am. Soc. Inf. Sci..

[10]  Mark Kac,et al.  The ideal Bose-Einstein gas, revisited , 1977 .

[11]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[12]  M. Kochen,et al.  Contacts and influence , 1978 .

[13]  J. Galaskiewicz,et al.  Interorganizational resource networks: Formal patterns of overlap , 1978 .

[14]  Béla Bollobás,et al.  A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..

[15]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[16]  Miranda Lee Pao.  An empirical examination of Lotka's Law , 1986, J. Am. Soc. Inf. Sci..

[17]  P. Killworth,et al.  Studying social relations cross-culturally , 1988 .

[18]  John Scott.  Social Network Analysis , 1988 .

[19]  이기수,et al.  II. , 1992 .

[20]  Per O. Seglen,et al.  The Skewness of Science , 1992, J. Am. Soc. Inf. Sci..

[21]  P. Gács,et al.  Algorithms , 1992 .

[22]  Jean Tague-Sutcliffe,et al.  An Introduction to Informetrics , 1992, Inf. Process. Manag..

[23]  John F. Padgett,et al.  Robust Action and the Rise of the Medici, 1400-1434 , 1993, American Journal of Sociology.

[24]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[25]  Bruce A. Reed,et al.  A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.

[26]  Jerrold W. Grossman,et al.  A portion of the well-known collaboration graph , 1995 .

[27]  Henry Kautz,et al.  Combining social networks and collaborative ?ltering , 1997 .

[28]  G. Davis,et al.  Corporate Elite Networks and Governance Changes in the 1980s , 1997, American Journal of Sociology.

[29]  Gobinda G. Chowdhury,et al.  A bibliometric analysis of collaboration in the field of Information Retrieval , 1998 .

[30]  Bruce A. Reed,et al.  The Size of the Giant Component of a Random Graph with a Given Degree Sequence , 1998, Combinatorics, Probability and Computing.

[31]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[32]  S. Redner.  How popular is your paper? An empirical study of the citation distribution , 1998, cond-mat/9804163.

[33]  M. Newman,et al.  Renormalization Group Analysis of the Small-World Network Model , 1999, cond-mat/9903357.

[34]  C. Moukarzel.  Spreading and shortest paths in systems with sparse long-range connections. , 1999, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[35]  L. Amaral,et al.  Small-World Networks: Evidence for a Crossover Picture , 1999, cond-mat/9903108.

[36]  Reka Albert,et al.  Mean-field theory for scale-free random networks , 1999 .

[37]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[38]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.

[39]  H E Stanley,et al.  Classes of small-world networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[40]  D S Callaway,et al.  Network robustness and fragility: percolation on random graphs. , 2000, Physical review letters.

[41]  M. Newman,et al.  Epidemics and percolation in small-world networks. , 1999, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[42]  S. N. Dorogovtsev,et al.  Structure of growing networks with preferential linking. , 2000, Physical review letters.

[43]  M. D. Menezes,et al.  First-order transition in small-world networks , 1999, cond-mat/9903426.

[44]  S. N. Dorogovtsev,et al.  Exactly solvable small-world network , 1999, cond-mat/9907445.

[45]  Stroud,et al.  Exact results and scaling properties of small-world networks , 1999, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[46]  M. Newman,et al.  Mean-field solution of the small-world network model. , 1999, Physical review letters.

[47]  M. Newman,et al.  Efficient Monte Carlo algorithm and high-precision results for percolation. , 2000, Physical review letters.

[48]  Thomas de Quincey.  [C] , 2000, The Works of Thomas De Quincey, Vol. 1: Writings, 1799–1820.

[49]  Mark Newman,et al.  Models of the Small World , 2000 .

[50]  Albert-László Barabási,et al.  Error and attack tolerance of complex networks , 2000, Nature.

[51]  Vladimir Batagelj,et al.  Some analyses of Erdős collaboration graph , 2000, Soc. Networks.

[52]  Andrei Z. Broder,et al.  Graph structure in the Web , 2000, Comput. Networks.

[53]  U. Brandes.  Faster Evaluation of Shortest-Path Based Centrality Indices , 2000 .

[54]  S. Redner,et al.  Connectivity of growing random networks. , 2000, Physical review letters.

[55]  Cohen,et al.  Resilience of the internet to random breakdowns , 2000, Physical review letters.

[56]  M. Newman,et al.  Random graphs with arbitrary degree distributions and their applications. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[57]  J. Moody.  Race, School Integration, and Friendship Segregation in America1 , 2001, American Journal of Sociology.

[58]  M. Newman.  Clustering and preferential attachment in growing networks. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[59]  Lada A. Adamic,et al.  Search in Power-Law Networks , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[60]  Jeffery R. Westbrook,et al.  A Functional Approach to External Graph Algorithms , 1998, Algorithmica.

[61]  A. Rbnyi.  ON THE EVOLUTION OF RANDOM GRAPHS , 2001 .

[62]  M. Newman,et al.  The structure of scientific collaboration networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[63]  S. Redner,et al.  Organization of growing random networks. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

[64]  S. Strogatz.  Exploring complex networks , 2001, Nature.

[65]  U. Brandes.  A faster algorithm for betweenness centrality , 2001 .

[66]  B. Wellman.  Computer Networks As Social Networks , 2001, Science.

[67]  M E Newman,et al.  Scientific collaboration networks. I. Network construction and fundamental results. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[68]  M. Newman,et al.  Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[69]  K. Goh,et al.  Universal behavior of load distribution in scale-free networks. , 2001, Physical review letters.

[70]  A. Barabasi,et al.  Evolution of the social network of scientific collaborations , 2001, cond-mat/0104162.

[71]  S H Strogatz,et al.  Random graph models of social networks , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[72]  Ian T. Foster,et al.  Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design , 2002, ArXiv.

[73]  Stephanie Forrest,et al.  Email networks and the spread of computer viruses. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[74]  Jerrold W. Grossman,et al.  The evolution of the mathematical research collaboration graph , 2002 .

[75]  Joao Antonio Pereira,et al.  Linked: The new science of networks , 2002 .

[76]  S. Bornholdt,et al.  Scale-free topology of e-mail networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[77]  Walter Willinger,et al.  The origin of power laws in Internet topologies revisited , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[78]  Heath B. O'Connell.  Physicists Thriving with Paperless Publishing , 2002 .

[79]  Duncan J. Watts,et al.  Six Degrees: The Science of a Connected Age , 2003 .

[80]  Arnab Chatterjee,et al.  Small-world properties of the Indian railway network. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[81]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[82]  D. Watts.  The “New” Science of Networks , 2004 .

[83]  Olle Persson,et al.  Locating the network of interacting authors in scientific specialties , 1995, Scientometrics.

[84]  Olle Persson,et al.  Studying research collaboration using co-authorships , 1996, Scientometrics.

[85]  Hildrun Kretschmer,et al.  Coauthorship networks of invisible colleges and institutionalized communities , 1994, Scientometrics.

[86]  Michael P. Giannetto,et al.  The Man Who Loved Only Numbers , 2005 .

[87]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.