- Random evolving networks under the diameter and average connectivity constraint
- 点击次数：
- 论文类型： 期刊论文
- 发表时间： 2007-03-01
- 发表刊物： JOURNAL OF SYSTEMS SCIENCE AND SYSTEMS ENGINEERING
- 收录刊物： SCIE、EI
- 卷号： 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.
