Scale-free networks are rare

被引:618
作者
Broido, Anna D. [1 ]
Clauset, Aaron [2 ,3 ,4 ]
机构
[1] Univ Colorado, Dept Appl Math, 526 UCB, Boulder, CO 80309 USA
[2] Univ Colorado, Dept Comp Sci, 430 UCB, Boulder, CO 80309 USA
[3] Univ Colorado, BioFrontiers Inst, 596 UCB, Boulder, CO 80309 USA
[4] Santa Fe Inst, 1399 Hyde Pk Rd, Santa Fe, NM 87501 USA
基金
美国国家科学基金会;
关键词
POWER LAWS; DISTRIBUTIONS; SYNCHRONIZATION; TOLERANCE; EMERGENCE; MODEL;
D O I
10.1038/s41467-019-08746-5
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
Real-world networks are often claimed to be scale free, meaning that the fraction of nodes with degree k follows a power law k(-alpha), a pattern with broad implications for the structure and dynamics of complex systems. However, the universality of scale-free networks remains controversial. Here, we organize different definitions of scale-free networks and construct a severe test of their empirical prevalence using state-of-the-art statistical tools applied to nearly 1000 social, biological, technological, transportation, and information networks. Across these networks, we find robust evidence that strongly scale-free structure is empirically rare, while for most networks, log-normal distributions fit the data as well or better than power laws. Furthermore, social networks are at best weakly scale free, while a handful of technological and biological networks appear strongly scale free. These findings highlight the structural diversity of real-world networks and the need for new theoretical explanations of these non-scale-free patterns.
引用
收藏
页数:10
相关论文
共 79 条
[1]   Power-Law distribution of the World Wide Web [J].
Adamic, LA ;
Huberman, BA ;
Barabási, AL ;
Albert, R ;
Jeong, H ;
Bianconi, G .
SCIENCE, 2000, 287 (5461)
[2]   Microbial Hub Taxa Link Host and Abiotic Factors to Plant Microbiome Variation [J].
Agler, Matthew T. ;
Ruhe, Jonas ;
Kroll, Samuel ;
Morhenn, Constanze ;
Kim, Sang-Tae ;
Weigel, Detlef ;
Kemen, Eric M. .
PLOS BIOLOGY, 2016, 14 (01)
[3]  
Aiello W., 2000, Proceedings of the Thirty Second Annual ACM Symposium on Theory of Computing, P171, DOI 10.1145/335305.335326
[4]   A random graph model for power law graphs [J].
Aiello, W ;
Chung, F ;
Lu, LY .
EXPERIMENTAL MATHEMATICS, 2001, 10 (01) :53-66
[5]   Internet -: Diameter of the World-Wide Web [J].
Albert, R ;
Jeong, H ;
Barabási, AL .
NATURE, 1999, 401 (6749) :130-131
[6]   Error and attack tolerance of complex networks [J].
Albert, R ;
Jeong, H ;
Barabási, AL .
NATURE, 2000, 406 (6794) :378-382
[7]   Diversity of graphs with highly variable connectivity [J].
Alderson, David L. ;
Li, Lun .
PHYSICAL REVIEW E, 2007, 75 (04)
[8]   Classes of small-world networks [J].
Amaral, LAN ;
Scala, A ;
Barthélémy, M ;
Stanley, HE .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2000, 97 (21) :11149-11152
[9]  
[Anonymous], PHYS REV E
[10]  
[Anonymous], GENERIC SCALE SCALE