中国物理B ›› 2008, Vol. 17 ›› Issue (7): 2327-2332.doi: 10.1088/1674-1056/17/7/001
• • 下一篇
曹宏铎1, 山秀明1, 任勇1, 李旲2
Li Ying(李旲)a)b), Cao Hong-Duo(曹宏铎)a),Shan Xiu-Ming(山秀明)b), and Ren Yong(任勇)b)
摘要: 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 $\alpha $ are included in our formula. The parameter $\alpha $ 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.
中图分类号: (Networks and genealogical trees)