Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

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 access
Broido, Anna D., Clauset, Aaron · 2019 · Nature Communications

Abstract

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1038/s41467-019-08746-5

Cites

69 of 69 references verified0 citation errors · 0 not checkable

Statistics

Figures

Fig. 1 Mean degree ⟨k⟩ as a function of the number of nodes n. The 928 network data sets in the corpus studied here vary broadly size and density. For data sets with more than one degree sequence (see text), we plot the median of the corresponding set of mean degrees
Fig. 1 Mean degree ⟨k⟩ as a function of the number of nodes n. The 928 network data sets in the corpus studied here vary broadly size and density. For data sets with more than one degree sequence (see text), we plot the median of the corresponding set of mean degreesCC BY · PubMed Central
Fig. 2 Taxonomy of scale-free network definitions. Super-Weak meaning that a power law is not necessarily a statistically plausible model of a network’s degree distribution but it is less implausible than alternatives; Weakest, meaning a degree distribution that is plausibly power-law distributed; Weak, adds a requirement that the distribution’s scale-free portion cover at least 50 nodes; Strong, adds a requirement that 2<α^<3 and the Super-Weak constraints; and, Strongest, meaning that almost every associated simple graph can meet the Strong constraints. The Super-Weak overlaps with the Weak definitions and contains the Strong definitions as special cases. Networks that fail to meet any of these criteria are deemed Not Scale Free
Fig. 2 Taxonomy of scale-free network definitions. Super-Weak meaning that a power law is not necessarily a statistically plausible model of a network’s degree distribution but it is less implausible than alternatives; Weakest, meaning a degree distribution that is plausibly power-law distributed; Weak, adds a requirement that the distribution’s scale-free portion cover at least 50 nodes; Strong, adds a requirement that 2<α^<3 and the Super-Weak constraints; and, Strongest, meaning that almost every associated simple graph can meet the Strong constraints. The Super-Weak overlaps with the Weak definitions and contains the Strong definitions as special cases. Networks that fail to meet any of these criteria are deemed Not Scale FreeCC BY · PubMed Central
Fig. 3 Distribution of α^ by scale-free evidence category. For networks with more than one degree sequence, the median estimate is used, and for visual clarity the 8% of networks with a median α^≥7 are omitted
Fig. 3 Distribution of α^ by scale-free evidence category. For networks with more than one degree sequence, the median estimate is used, and for visual clarity the 8% of networks with a median α^≥7 are omittedCC BY · PubMed Central
Fig. 4 Proportion of networks by scale-free evidence category. Bars separate the Super-Weak category from the nested definitions, and from the Not Scale Free category, defined as networks that are neither Weakest or Super-Weak
Fig. 4 Proportion of networks by scale-free evidence category. Bars separate the Super-Weak category from the nested definitions, and from the Not Scale Free category, defined as networks that are neither Weakest or Super-WeakCC BY · PubMed Central
Fig. 5 Proportion of networks by scale-free evidence category and by domain. a Biological networks, b social networks, and c technological networks. Tickers show change in percent from the pattern in all of the data sets
Fig. 5 Proportion of networks by scale-free evidence category and by domain. a Biological networks, b social networks, and c technological networks. Tickers show change in percent from the pattern in all of the data setsCC BY · PubMed Central
Fig. 6 Proportions of networks in each scale-free evidence category with removed degree percentage requirements
Fig. 6 Proportions of networks in each scale-free evidence category with removed degree percentage requirementsCC BY · PubMed Central
Fig. 7 Moment ratio scaling. For 3662 degree sequences, the empirical ratio of the second to first moments ⟨k²⟩∕⟨(k⟩)² as a function of network size n, showing substantial variation across networks and domains, little evidence of the divergence pattern expected for scale-free distributions, and perhaps a roughly sublinear scaling relationship (smoothed mean via exponential kernel, with smoothed standard deviations)
Fig. 7 Moment ratio scaling. For 3662 degree sequences, the empirical ratio of the second to first moments ⟨k²⟩∕⟨(k⟩)² as a function of network size n, showing substantial variation across networks and domains, little evidence of the divergence pattern expected for scale-free distributions, and perhaps a roughly sublinear scaling relationship (smoothed mean via exponential kernel, with smoothed standard deviations)CC BY · PubMed Central

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.

A few free checks a day · papers already verified open instantly · results are public

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?

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

Show all 65 references

Research works printed but not linked: 9

  1. 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).
  2. Newman, M. Networks: An Introduction (Oxford Univerity Press, Oxford, 2010).
  3. 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
  4. A. Barabasi, Network Science (Cambridge University Press, Cambridge, UK, 2016).
  5. Eikmeier, N. & Gleich, D. F. Proc. 23rd ACM SIGKDD Internat. Conference on Knowledge Discovery and Data Mining (KDD). 817–826 (Halifax, NS, Canada, 2017).
  6. Mayo, D. G. Error and the Growth of Experimental Knowledge (Science and Its Conceptual Foundations series) (University of Chicago Press, Chicago, IL,1996).
  7. 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).
  8. Pastor-Satorras, R. & Vespignani, A. Epidemic dynamics in finite size scale-free networks. Phys. Rev. E 65, 1–4 (2002).
  9. 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

See all 875

Metadata

Authors
Broido, A. D., & Clauset, A.
Affiliations
  • University of Colorado Boulder (US)
  • Santa Fe Institute (US)
Corresponding author
  • Broido, Anna D.
  • Clauset, Aaron
Venue
Nature Communications
Published
2019-03-04
Volume
10
Issue
1
Pages
1017-1017
ISSN
2041-1723 (ISSN-L)
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
Licence
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.