期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
RANDOM EVOLVING NETWORKS UNDER THE DIAMETER AND AVERAGE CONNECTIVITY CONSTRAINT 被引量:2
1
作者 jianguo liu zhongtuo wang yanzhong dang 《Journal of Systems Science and Systems Engineering》 SCIE EI CSCD 2007年第1期107-112,共6页
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 ... 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 kc is N-dependent cutoff function kc(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 kc(N)〈 N and power-law degree distribution. 展开更多
关键词 Scale-free networks DIAMETER average connectivity
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部