Search

Article

x

留言板

尊敬的读者、作者、审稿人, 关于本刊的投稿、审稿、编辑和出版的任何问题, 您可以本页添加留言。我们将尽快给您答复。谢谢您的支持!

姓名
邮箱
手机号码
标题
留言内容
验证码

Average path length of Internet with power law degree distribution

Li Ying Shan Xiu-Ming Ren Yong

Citation:

Average path length of Internet with power law degree distribution

Li Ying, Shan Xiu-Ming, Ren Yong
PDF
Get Citation

(PLEASE TRANSLATE TO ENGLISH

BY GOOGLE TRANSLATE IF NEEDED.)

  • The average path length of Internet with power law degree distribution is stud ied in this paper. The main work is to give a formula to compute the average pat h length . The essential of Internet or many other complex networks is to realize the least cost (the smallest total number of edges) and the best benefi t (the short average path length), which can be expressed as two optimization fa ctors to minimize the average degree and the average path length . By analyzing the main factor affecting , we find the main property of p ath length distribution P(l), and then give a formula of P(l) only inclu ding one parameter α. This work shows that P(l) and a direct relation with P(k),and α represent the effective link between nodes and the tota l number of networks on . This formula makes it possible that if we get the α of P(k)~k-α, we can calculate easily. The simulati on shows the formula is quite exact. Our method is successful. In the end, we di scuss that the parameter αis very important for Internet design.
Metrics
  • Abstract views:  6768
  • PDF Downloads:  1413
  • Cited By: 0
Publishing process
  • Received Date:  20 May 2004
  • Accepted Date:  25 June 2004
  • Published Online:  16 November 2004

/

返回文章
返回