Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality

被引:9
作者
Newman, MEJ [1 ]
机构
[1] Santa Fe Inst, 1399 Hyde Pk Rd, Santa Fe, NM 87501 USA
[2] Cornell Univ, Ctr Appl Math, Ithaca, NY 14853 USA
基金
美国国家科学基金会;
关键词
Bibliographic databases - Social networks - Stanford public information retrieval system;
D O I
10.1103/PhysRevE.64.016132
中图分类号
O35 [流体力学]; O53 [等离子体物理学];
学科分类号
070204 ; 080103 ; 080704 ;
摘要
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.
引用
收藏
页码:7 / 016132
页数:7
相关论文
共 17 条
[11]   The size of the giant component of a random graph with a given degree sequence [J].
Molloy, M ;
Reed, B .
COMBINATORICS PROBABILITY & COMPUTING, 1998, 7 (03) :295-305
[12]   Scaling and percolation in the small-world network model [J].
Newman, MEJ ;
Watts, DJ .
PHYSICAL REVIEW E, 1999, 60 (06) :7332-7342
[13]  
Newman MEJ, 2001, PHYS REV E, V64, DOI [10.1103/PhysRevE.64.016132, 10.1103/PhysRevE.64.016131]
[14]  
NEWMAN MEJ, CONDMAT0007235
[15]  
SEDGEWICK R, 1988, ALGORITHMS
[16]  
STROGATZ SH, COMMUNICATION
[17]  
Wasserman S., 1994, SOCIAL NETWORK ANAL, DOI [10.1017/CBO9780511815478, DOI 10.1017/CBO9780511815478]