更多
论文成果
Random evolving networks under the diameter and average connectivity constraint
点击次数:
发布时间: 2019-03-10
发布时间:2019-03-10
论文类型:期刊论文
发表时间:2007-03-01
发表刊物:JOURNAL OF SYSTEMS SCIENCE AND SYSTEMS ENGINEERING
收录刊物:EI、SCIE
卷号:16
期号:1
页面范围:107-112
ISSN号:1004-3756
关键字:scale-free networks; diameter; average connectivity
摘要:in this paper, under the constraint that the average distance and the average degree (k) remain approximately constant, we studied a random scale-free network model. We found that, if the network maintains the form of its degree distribution and the maximal degree k(c) is N-dependent cutoff function k(c)(N) < N, the degree distribution would be approximately power-law with an exponent between 2 and 3. The distribution exponent has little relationship with the average degree, denoted by < k >. The diameter constraint can be interpreted as an environmental selection pressure, which could explain the scale-free nature of networks. The numerical results indicate that, under the diameter constraint, the preferential attachment can produce the cutoff function k(c) (N) < N and power-law degree distribution.

王众托

教授   博士生导师   硕士生导师

性别: 男

毕业院校:清华大学

所在单位:经济管理学院

学科:管理科学与工程. 系统工程. 系统分析与集成

电子邮箱:

辽ICP备05001357号 地址:中国·辽宁省大连市甘井子区凌工路2号 邮编:116024
版权所有:大连理工大学
访问量: 手机版 English 大连理工大学 登录

开通时间:..

最后更新时间:..