Random evolving networks under the diameter and average connectivity constraint

Liu, Jianguo, Wang, Zhong-Tuo and Dang, Yan-Zhong (2007) Random evolving networks under the diameter and average connectivity constraint. Journal of Systems Science and Systems Engineering, 16 (1). pp. 107-112.

Abstract

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.

Item Type: Article
Keywords: Scale-free networks; Diameter; Average connectivity
Subject(s): Complexity
Centre: CABDyN Complexity Centre
Date Deposited: 11 Feb 2012 21:55
Last Modified: 23 Oct 2015 14:07
URI: http://eureka.sbs.ox.ac.uk/id/eprint/2755

Actions (login required)

Edit View Edit View