• Corpus ID: 220042168

A critique of the Mean Field Approximation in preferential attachment networks

  title={A critique of the Mean Field Approximation in preferential attachment networks},
  author={Matthijs Ruijgrok},
The Mean Field Approximation (MFA), or continuum method, is often used in courses on Networks to derive the degree distribution of preferential attachment networks. This method is simple and the outcome is close to the correct answer. However, this paper shows that the method is flawed in several aspects, leading to unresolvable contradictions. More importantly, the MFA is not explicitly derived from a mathematical model. An analysis of the implied model shows that it makes an approximation… 

Figures from this paper



A general theory of bibliometric and other cumulative advantage processes

  • D. Price
  • Mathematics
    J. Am. Soc. Inf. Sci.
  • 1976
It is shown that such a stochastic law is governed by the Beta Function, containing only one free parameter, and this is approximated by a skew or hyperbolic distribution of the type that is widespread in bibliometrics and diverse social science phenomena.

Structure of growing networks with preferential linking.

The model of growing networks with the preferential attachment of new links is generalized to include initial attractiveness of sites and it is shown that the relation beta(gamma-1) = 1 between the exponents is universal.

Mean-field theory for scale-free random networks

Scale-Free Networks - Complex Webs in Nature and Technology

This book presents the experimental evidence of these 'scale-free networks' and provides students and researchers with a corpus of theoretical results and algorithms to analyse and understand these features.

Network Science

This pioneering textbook introduces network science to an interdisciplinary audience and explores how viruses like Ebola and H1N1 spread, and why it is that their friends have more friends than the authors do.

Emergence of scaling in random networks

A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.

Connectivity of growing random networks.

A solution for the time- and age-dependent connectivity distribution of a growing random network is presented and the power law N(k) approximately k(-nu) is found, where the exponent nu can be tuned to any value in the range 2.

The degree sequence of a scale‐free random graph process

Here the authors obtain P(d) asymptotically for all d≤n1/15, where n is the number of vertices, proving as a consequence that γ=3.9±0.1 is obtained.

Dynamical Processes on Complex Networks

A new and recent account presents a comprehensive explanation of the effect of complex connectivity patterns on dynamical phenomena in a vast number of everyday systems that can be represented as large complex networks.

What is network science?

The first few pages of the first issue of Network Science, the new journal created because network science is exploding, share their own vision of the emerging science of networks.