Simple rules govern finite-size effects in scale-free networks

Details Simple rules govern finite-size effects in scale-free networks Simple rules govern finite-size effects in scale-free networks

2011-06-15

arxiv.org/abs/1106.3094v2

EPL 95 (2011) 38002

Physics

Physics and Society

Published in Europhysics Letters

Scientific paper

10.1209/0295-5075/95/38002

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\'asi 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.

Affiliated with

Also associated with

No associations

Rating

Simple rules govern finite-size effects in scale-free networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Simple rules govern finite-size effects in scale-free networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simple rules govern finite-size effects in scale-free networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-188908