Universal fractal scaling of self-organized networks

被引:40
作者
Laurienti, Paul J. [1 ]
Joyce, Karen E. [2 ]
Telesford, Qawi K. [2 ]
Burdette, Jonathan H. [1 ]
Hayasaka, Satoru [1 ,3 ]
机构
[1] Wake Forest Univ Hlth Sci, Dept Radiol, Winston Salem, NC 27157 USA
[2] Wake Forest Univ Hlth Sci, Dept Biomed Engn, Winston Salem, NC 27157 USA
[3] Wake Forest Univ Hlth Sci, Dept Biostat Sci, Winston Salem, NC 27157 USA
关键词
Fractal scaling; Self-organized networks; Power-law; Network science; SMALL-WORLD;
D O I
10.1016/j.physa.2011.05.011
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
There is an abundance of literature on complex networks describing a variety of relationships among units in social, biological, and technological systems. Such networks, consisting of interconnected nodes, are often self-organized, naturally emerging without any overarching designs on topological structure yet enabling efficient interactions among nodes. Here we show that the number of nodes and the density of connections in such self-organized networks exhibit a power law relationship. We examined the size and connection density of 47 self-organizing networks of various biological, social, and technological origins, and found that the size-density relationship follows a fractal relationship spanning over 6 orders of magnitude. This finding indicates that there is an optimal connection density in self-organized networks following fractal scaling regardless of their sizes. (c) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码:3608 / 3613
页数:6
相关论文
共 54 条
[1]   A resilient, low-frequency, small-world human brain functional network with highly connected association cortical hubs [J].
Achard, S ;
Salvador, R ;
Whitcher, B ;
Suckling, J ;
Bullmore, ET .
JOURNAL OF NEUROSCIENCE, 2006, 26 (01) :63-72
[2]   Search in power-law networks [J].
Adamic, L.A. ;
Lukose, R.M. ;
Puniyani, A.R. ;
Huberman, B.A. .
Physical Review E - Statistical, Nonlinear, and Soft Matter Physics, 2001, 64 (4 II) :461351-461358
[3]   Internet -: Diameter of the World-Wide Web [J].
Albert, R ;
Jeong, H ;
Barabási, AL .
NATURE, 1999, 401 (6749) :130-131
[4]   Error and attack tolerance of complex networks [J].
Albert, R ;
Jeong, H ;
Barabási, AL .
NATURE, 2000, 406 (6794) :378-382
[5]   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
[6]  
[Anonymous], ARXIVCONDMAT20030307
[7]  
[Anonymous], 1993, The Stanford graph base: A platform for combinatorial computing
[8]  
[Anonymous], NETWORK DATA UNPUB
[9]   SELF-ORGANIZED CRITICALITY - AN EXPLANATION OF 1/F NOISE [J].
BAK, P ;
TANG, C ;
WIESENFELD, K .
PHYSICAL REVIEW LETTERS, 1987, 59 (04) :381-384
[10]   Mean-field theory for scale-free random networks [J].
Barabási, AL ;
Albert, R ;
Jeong, H .
PHYSICA A, 1999, 272 (1-2) :173-187