Published June 14, 2024
| Version v1
Journal article
Open
Emergent scale-free networks
- 1. Yale University
- 2. Princeton University
- 3. University of Chicago
Description
Many complex systems—from the Internet to social, biological, and communication networks—are thought to exhibit scale-free structure. However, prevailing explanations require that networks grow over time, an assumption that fails in some real-world settings. Here, we explain how scale-free structure can emerge without growth through network self-organization. Beginning with an arbitrary network, we allow connections to detach from random nodes and then reconnect under a mixture of preferential and random attachment. While the numbers of nodes and edges remain fixed, the degree distribution evolves toward a power-law with an exponent $y = 1 + \frac{1}{p}$ that depends only on the proportion p of preferential (rather than random) attachment. Applying our model to several real networks, we infer p directly from data and predict the relationship between network size and degree heterogeneity. Together, these results establish how scale-free structure can arise in networks of constant size and density, with broad implications for the structure and function of complex systems.
Data availability
The data analyzed in this paper and the code used to perform the analyses are openly available at: github.com/ChrisWLynn/Emergent{_}scale{_}free.Files
pgae236.pdf
Files
(24.9 MB)
| Name | Size | Download all |
|---|---|---|
|
Article md5:17683b70b772e249148e39c1507a3d56 |
2.9 MB | Preview Download |
|
Supplementary material md5:50b9a52c9be9b360aef2f1503fe4b59b |
21.9 MB | Preview Download |
Additional details
Identifiers
- DOI
- 10.1093/pnasnexus/pgae236
- Other
- oai:uchicago.tind.io:13762
Funding
- National Science Foundation
- PHY–1734030
- James S. McDonnell Foundation
- Postdoctoral Fellowship
- National Institutes of Health
- R01EB026943