Highly Dispersed Networks
classification
❄️ cond-mat.stat-mech
physics.soc-ph
keywords
degreenetworksnodesancestornumberprobabilitytargetanomalous
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.