English

Highly Dispersed Networks

Statistical Mechanics 2013-11-14 v1 Physics and Society

Abstract

We introduce a new class of networks that grow by enhanced redirection. Nodes are introduced sequentially, and each either attaches to a randomly chosen target node with probability 1-r or to the ancestor of the target with probability r, where r an increasing function of the degree of the ancestor. This mechanism leads to highly-dispersed networks with unusual properties: (i) existence of multiple macrohubs---nodes whose degree is a finite fraction of the total number of network nodes N, (ii) lack of self averaging, and (iii) anomalous scaling, in which N_k, the number of nodes of degree k scales as N_k N^{nu-1}/k^{nu}, with 1<nu<2.

Keywords

Cite

@article{arxiv.1307.3768,
  title  = {Highly Dispersed Networks},
  author = {Alan Gabel and P. L. Krapivsky and S. Redner},
  journal= {arXiv preprint arXiv:1307.3768},
  year   = {2013}
}

Comments

4 pages, 6 figures, 2-column revtex4 format

R2 v1 2026-06-22T00:51:11.342Z