Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality
Top Cited Papers
- 28 June 2001
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 64 (1) , 016132
- https://doi.org/10.1103/physreve.64.016132
Abstract
Using 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. Here we study a variety of nonlocal statistics for these networks, such as typical distances between scientists through the network, and measures of centrality such as closeness and betweenness. We further argue that simple networks such as these cannot capture variation in the strength of collaborative ties and propose a measure of collaboration strength based on the number of papers coauthored by pairs of scientists, and the number of other scientists with whom they coauthored those papers.Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Scientific collaboration networks. I. Network construction and fundamental resultsPhysical Review E, 2001
- Harmony in the small-worldPhysica A: Statistical Mechanics and its Applications, 2000
- Scaling and percolation in the small-world network modelPhysical Review E, 1999
- Small-World Networks: Evidence for a Crossover PicturePhysical Review Letters, 1999
- The Size of the Giant Component of a Random Graph with a Given Degree SequenceCombinatorics, Probability and Computing, 1998
- Referral WebCommunications of the ACM, 1997
- A critical point for random graphs with a given degree sequenceRandom Structures & Algorithms, 1995
- Social Network AnalysisPublished by Cambridge University Press (CUP) ,1994
- A Set of Measures of Centrality Based on BetweennessSociometry, 1977