arXiv · 1307.3768
Highly Dispersed Networks
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.
Explore related subjects
Keep this discovery
Alan Gabel, P. L. Krapivsky, S. Redner. 2013-07-14. Highly Dispersed Networks. https://doi.org/10.1103/physreve.88.050802
Cite the original work for its findings. Save a collection to share your selection of sources.