Emergent Network Modularity
arXiv:1706.01514 · doi:10.1088/1742-5468/aa7a3f
Abstract
We introduce a network growth model based on complete redirection: a new node randomly selects an existing target node, but attaches to a random neighbor of this target. For undirected networks, this simple growth rule generates unusual, highly modular networks. Individual network realizations typically contain multiple macrohubs---nodes whose degree scales linearly with the number of nodes . The size of the network "nucleus"---the set of nodes of degree greater than one---grows sublinearly with and thus constitutes a vanishingly small fraction of the network. The network therefore consists almost entirely of leaves (nodes of degree one) as .
21 pages, 10 figures, 2 appendices. Minor corrections in version2. For publication in JSTAT
References in corpus (20)
- Catastrophic cascade of failures in interdependent networks
- Multilayer Networks
- The structure and dynamics of multilayer networks
- Organization of Growing Random Networks
- Growing networks with local rules: preferential attachment, clustering hierarchy and degree correlations
- Triadic closure as a basic generating mechanism of communities in complex networks
- Origins of power-law degree distribution in the heterogeneity of human activity in social networks
- Log-Networks
- Network geometry with flavor: from complexity to quantum geometry
- Exponential Random Simplicial Complexes
- Extremal Properties of Random Systems
- Spatially distributed social complex networks
- Scale Invariance and Lack of Self-Averaging in Fragmentation
- Scale-free networks as preasymptotic regimes of superlinear preferential attachment
- Stable Distributions in Stochastic Fragmentation
- Designer Nets from Local Strategies
- Sublinear but Never Superlinear Preferential Attachment by Local Network Growth
- Highly Dispersed Networks Generated by Enhanced Redirection
- Highly Dispersed Networks
- Random Ancestor Trees