The DOI matches its Crossref record; 69 of the 69 references it cites were found in a registry or an index.
Scale-free networks are rare
Open accessAbstract
Real-world networks are often claimed to be scale free, meaning that the fraction of nodes with degree k follows a power law k − α , a pattern with broad implications for the structure and dynamics of complex systems. However, the universality of scale-free networks remains controversial. Here, we organize different definitions of scale-free networks and construct a severe test of their empirical prevalence using state-of-the-art statistical tools applied to nearly 1000 social, biological, technological, transportation, and information networks. Across these networks, we find robust evidence that strongly scale-free structure is empirically rare, while for most networks, log-normal distributions fit the data as well or better than power laws. Furthermore, social networks are at best weakly scale free, while a handful of technological and biological networks appear strongly scale free. These findings highlight the structural diversity of real-world networks and the need for new theoretical explanations of these non-scale-free patterns.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Figures







Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source says what the claim attributes to it.
In the citing paper
“A power law connectivity degree distribution is the defining feature of a scale-free network46,47”
From Descending networks transform command signals into population motor control (2024) · cites this paper as [47]
In the citing paper
“meanwhile, serious criticisms [47,48] regarding the statistical significance and mechanistic interpretation of purported scaling laws in a variety of contexts not limited to biochemistry have also been raised.”
From Prebiotic Reaction Networks in Water (2020) · cites this paper as [48]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Community structure in social and biological networks
Girvan, M., & Newman, M. E. J. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.122653799 · Cited by 15,502
Power-Law Distributions in Empirical Data
Clauset, A., Shalizi, C. R., & Newman, M. E. J. (2009) · SIAM Review · doi:10.1137/070710111 · Cited by 8,019
Self-citationError and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
Likelihood Ratio Tests for Model Selection and Non-Nested Hypotheses
Vuong, Q. H. (1989) · Econometrica · doi:10.2307/1912557 · Cited by 5,929
Newman (2005) · doi:10.1080/00107510500052444 · Cited by 5,749
Epidemic Spreading in Scale-Free Networks
Pastor-Satorras, R., & Vespignani, A. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.3200 · Cited by 5,731
Lethality and centrality in protein networks
Jeong, H., Mason, S. P., Barabási, A.-L., & Oltvai, Z. N. (2001) · Nature · doi:10.1038/35075138 · Cited by 5,287
Diameter of the World-Wide Web
Albert, R., Jeong, H., & Barabási, A.-L. (1999) · Nature · doi:10.1038/43601 · Cited by 4,260
Research works printed but not linked: 9
- Willinger, W., Alderson, D. & Doyle, J. C. Mathematics and the internet: a source of enormous confusion and great potential. Not. AMS 56, 586–599 (2009).
- Newman, M. Networks: An Introduction (Oxford Univerity Press, Oxford, 2010).
- Gamermann, D., Triana, J. & Jaime, R. A comprehensive statistical study of metabolic and protein-protein interaction network properties. https://arxiv.org/abs/1712.07683 (2017). · arXiv
- A. Barabasi, Network Science (Cambridge University Press, Cambridge, UK, 2016).
- Eikmeier, N. & Gleich, D. F. Proc. 23rd ACM SIGKDD Internat. Conference on Knowledge Discovery and Data Mining (KDD). 817–826 (Halifax, NS, Canada, 2017).
- Mayo, D. G. Error and the Growth of Experimental Knowledge (Science and Its Conceptual Foundations series) (University of Chicago Press, Chicago, IL,1996).
- Lee, S. H., Fricker, M. D. & Porter, M. A. Mesoscale analyses of fungal networks as an approach for quantifying phenotypic traits. J. Complex Netw. 5, 145–159 (2017).
- Pastor-Satorras, R. & Vespignani, A. Epidemic dynamics in finite size scale-free networks. Phys. Rev. E 65, 1–4 (2002).
- Easley, D. & Kleinberg, J. Networks, Crowds, and Markets: Reasoning about a Highly Connected World (Cambridge University Press, Cambridge, UK, 2010). · DOI · Paper page
Cited by
Robustness and resilience of complex networks
Artime, O., Grassia, M., De Domenico, M., Gleeson, J. P., Makse, H. A., Mangioni, G., Perc, M., & Radicchi, F. (2024) · Nature Reviews Physics · doi:10.1038/s42254-023-00676-y · Cited by 672
The fractal dimension of complex networks: A review
Wen, T., & Cheong, K. H. (2021) · Information Fusion · doi:10.1016/j.inffus.2021.02.001 · Cited by 213
More is different in real-world multilayer networks
De Domenico, M. (2023) · Nature Physics · doi:10.1038/s41567-023-02132-1 · Cited by 204
Metrics for graph comparison: A practitioner’s guide
Wills, P., & Meyer, F. G. (2020) · PLOS ONE · doi:10.1371/journal.pone.0228728 · Cited by 196
Voitalov, I., van der Hoorn, P., van der Hofstad, R., & Krioukov, D. (2019) · Physical Review Research · doi:10.1103/physrevresearch.1.033034 · Cited by 162
Metadata
- Authors
- Broido, A. D., & Clauset, A.
- Affiliations
- University of Colorado Boulder (US)
- Santa Fe Institute (US)
- Corresponding author
- Broido, Anna D.
- Clauset, Aaron
- ORCID
- Clauset, Aaron
- Venue
- Nature Communications
- Published
- 2019-03-04
- Volume
- 10
- Issue
- 1
- Pages
- 1017-1017
- ISSN
- 2041-1723 (ISSN-L)
- PMC
- PMC6399239
- OpenAlex
- W2784007581
- Cited by
- 875
- References
- 65
- Citations by year
- 2026: 67 · 2025: 113 · 2024: 109 · 2023: 103 · 2022: 131 · 2021: 190 · 2020: 117 · 2019: 37
- FWCI
- 54.97
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- cc-by
- creativecommons.org/licenses/by/4.0 (tdm)
- creativecommons.org/licenses/by/4.0 (vor)
- Locations
- Nature Communications (publishedVersion, cc-by)
- Europe PMC (PubMed Central) (publishedVersion, cc-by)
- PubMed Central (publishedVersion, cc-by)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- CU Scholar (University of Colorado Boulder) (submittedVersion, cc-by)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion)
- arXiv (Cornell University)
- Funders
- National Science Foundation (1452718)
- National Institutes of Health (1s10od012300-01)
- University of Colorado Boulder
- Topics
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
- Social Sciences › Economics, Econometrics and Finance › Economics and Econometrics › Complex Systems and Time Series Analysis
- Physical Sciences › Physics and Astronomy › Condensed Matter Physics › Theoretical and Computational Physics
- Keywords
- scale-free networks, power-law degree distribution, lognormal distribution, degree distribution, social networks, technological networks, biological networks, transportation networks, information networks, complex networks
- MeSH terms
- Computer Simulation, Humans, Information Services, Models, Biological, Models, Theoretical, Models, Statistical, Social Networking
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Scale-free networks are rare. https://app.cochat.ai/papers/10.1038/s41467-019-08746-5
- The paper
- Broido, A. D., & Clauset, A. (2019). Scale-free networks are rare. Nature Communications. https://doi.org/10.1038/s41467-019-08746-5
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.