Simple rules govern finite-size effects in scale-free networks
Departamento de Economía Cuantitativa, Facultad de CC. Económicas y Empresariales, Universidad Autónoma de Madrid - C. Fco. Tomás y Valiente 5, E-28049 Madrid, Spain, EU
2 Grupo Interdisciplinar de Sistemas Complejos (GISC)
Accepted: 14 June 2011
We give an intuitive though general explanation of the finite-size effect in scale-free networks in terms of the degree distribution of the starting network. This result clarifies the relevance of the starting network in the final degree distribution. We use two different approaches: the deterministic mean-field approximation used by Barabási and Albert (but taking into account the nodes of the starting network), and the probability distribution of the degree of each node, which considers the stochastic process. Numerical simulations show that the accuracy of the predictions of the mean-field approximation depend on the contribution of the dispersion in the final distribution. The results in terms of the probability distribution of the degree of each node are very accurate when compared to numerical simulations. The analysis of the standard deviation of the degree distribution allows us to assess the influence of the starting core when fitting the model to real data.
PACS: 89.75.Da – Systems obeying scaling laws / 87.23.Ge – Dynamics of social systems / 02.50.Cw – Probability theory
© EPLA, 2011