Please wait a minute...
Chin. Phys. B, 2008, Vol. 17(7): 2327-2332    DOI: 10.1088/1674-1056/17/7/001
GENERAL   Next  

An estimation formula for the average path length of scale-free networks

Li Ying(李旲)a)b), Cao Hong-Duo(曹宏铎)a),Shan Xiu-Ming(山秀明)b), and Ren Yong(任勇)b)
a Department of Management Sciences, School of Business, SUN YAT-SEN University, Guangzhou 510275, China; b Department of Electronic Engineering, Tsinghua University, Beijing 100084, China
Abstract  A universal estimation formula for the average path length of scale free networks is given in this paper. Different from other estimation formulas, most of which use the size of network, N, as the only parameter, two parameters including N and a second parameter α are included in our formula. The parameter α is the power-law exponent, which represents the local connectivity property of a network. Because of this, the formula captures an important property that the local connectivity property at a microscopic level can determine the global connectivity of the whole network. The use of this new parameter distinguishes this approach from the other estimation formulas, and makes it a universal estimation formula, which can be applied to all types of scale-free networks. The conclusion is made that the small world feature is a derivative feature of a scale free network. If a network follows the power-law degree distribution, it must be a small world network. The power-law degree distribution property, while making the network economical, preserves the efficiency through this small world property when the network is scaled up. In other words, a real scale-free network is scaled at a relatively small cost and a relatively high efficiency, and that is the desirable result of self-organization optimization.
Keywords:  scale free network      power law      small world      power law exponent  
Received:  12 September 2007      Revised:  26 December 2007      Accepted manuscript online: 
PACS:  89.75.Hc (Networks and genealogical trees)  
  89.20.Hh (World Wide Web, Internet)  
Fund: Project supported by the National Natural Science Foundation of China (Grant Nos 60672142, 60772053 and 90304005).

Cite this article: 

Li Ying(李旲), Cao Hong-Duo(曹宏铎), Shan Xiu-Ming(山秀明), and Ren Yong(任勇) An estimation formula for the average path length of scale-free networks 2008 Chin. Phys. B 17 2327

[1] Immunizations on small worlds of tree-based wireless sensor networks
Li Qiao(李峤), Zhang Bai-Hai(张百海), Cui Ling-Guo(崔灵果), Fan Zhun(范衠), and Athanasios V. Vasilakos . Chin. Phys. B, 2012, 21(5): 050205.
[2] Competition between two kinds of information among random-walking individuals
Liu Zhen-Zhen(刘真真), Wang Xing-Yuan(王兴元), and Wang Mao-Ji(王茂基) . Chin. Phys. B, 2012, 21(4): 048902.
[3] Modeling online social networks based on preferential linking
Hu Hai-Bo (胡海波), Guo Jin-Li (郭进利), Chen Jun (陈骏 ). Chin. Phys. B, 2012, 21(11): 118902.
[4] Betweenness-based algorithm for a partition scale-free graph
Zhang Bai-Da(张百达), Wu Jun-Jie(吴俊杰), Tang Yu-Hua(唐玉华), and Zhou Jing(周静) . Chin. Phys. B, 2011, 20(11): 118903.
[5] Topological probability and connection strength induced activity in complex neural networks
Wei Du-Qu(韦笃取), Zhang Bo(张波), Qiu Dong-Yuan(丘东元), and Luo Xiao-Shu(罗晓曙). Chin. Phys. B, 2010, 19(10): 100513.
[6] The principle of the Internet evolving and the conjecture of the optimal structure of Internet
Li Ying(李旲), Cao Hong-Duo(曹宏铎), Shan Xiu-Ming(山秀明), Ren Yong(任勇), and Yuan Jian(袁坚). Chin. Phys. B, 2009, 18(5): 1721-1724.
[7] A preliminary investigation on the topology of Chinese and climate networks
Wang Ge-Li(王革丽) and Anastasios A Tsonis. Chin. Phys. B, 2009, 18(11): 5091-5096.
[8] Order parameters and synchronization of FitzHugh—Nagumo small-world networks
Li Yan-Long(李延龙), Ma Jun(马军),, Zhang Wei(张巍),, and Liu Yan-Jun(刘延君). Chin. Phys. B, 2009, 18(10): 4598-4602.
No Suggested Reading articles found!