English

Generic scale of the "scale-free" growing networks

Statistical Mechanics 2009-10-31 v1

Abstract

We show that the connectivity distributions P(k,t)P(k,t) of scale-free growing networks (tt is the network size) have the generic scale -- the cut-off at kcuttβk_{cut} \sim t^\beta. The scaling exponent β\beta is related to the exponent γ\gamma of the connectivity distribution, β=1/(γ1)\beta=1/(\gamma-1). We propose the simplest model of scale-free growing networks and obtain the exact form of its connectivity distribution for any size of the network. We demonstrate that the trace of the initial conditions -- a hump at khkcuttβk_h \sim k_{cut} \sim t^\beta -- may be found for any network size. We also show that there exists a natural boundary for the observation of the scale-free networks and explain why so few scale-free networks are observed in Nature.

Keywords

Cite

@article{arxiv.cond-mat/0011115,
  title  = {Generic scale of the "scale-free" growing networks},
  author = {S. N. Dorogovtsev and J. F. F. Mendes and A. N. Samukhin},
  journal= {arXiv preprint arXiv:cond-mat/0011115},
  year   = {2009}
}

Comments

4 pages revtex, 3 figures