The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
A simple model of global cascades on random networks
Open accessAbstract
The origin of large but rare cascades that are triggered by small initial shocks is a phenomenon that manifests itself as diversely as cultural fads, collective action, the diffusion of norms and innovations, and cascading failures in infrastructure and organizational networks. This paper presents a possible explanation of this phenomenon in terms of a sparse, random network of interacting agents whose decisions are determined by the actions of their neighbors according to a simple threshold rule. Two regimes are identified in which the network is susceptible to very large cascades—herein called global cascades—that occur very rarely. When cascade propagation is limited by the connectivity of the network, a power law distribution of cascade sizes is observed, analogous to the cluster size distribution in standard percolation theory and avalanches in self-organized criticality. But when the network is highly connected, cascade propagation is limited instead by the local stability of the nodes themselves, and the size distribution of cascades is bimodal, implying a more extreme kind of instability that is correspondingly harder to anticipate. In the first regime, where the distribution of network neighbors is highly skewed, it is found that the most connected nodes are far more likely than average nodes to trigger cascades, but not in the second regime. Finally, it is shown that heterogeneity plays an ambiguous role in determining a system's stability: increasingly heterogeneous thresholds make the system more vulnerable to global cascades; but an increasingly heterogeneous degree distribution makes it less vulnerable.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“Another approach, called fractional threshold, is more relevant to settings such as opinion formation, infrastructures and financial and economic settings, measures the fraction of non-failed (or activated in the context of opinion spreading) neighbors of a node’s initial degree. The decision regarding whether or not the node will fail depends on the fractional threshold11,29–31.”
From Mitigation of cascading failures in complex networks (2020) · cites this paper as [29]
In the citing paper
“By using state-of-the-art machine learning techniques to analyze the online behavior of users (see Methods for details), we have discovered an extraordinary activity of automated agents, referred to as social bots 14,15,35,39 .”
From Assessing the risks of ‘infodemics’ in response to COVID-19 epidemics (2020) · cites this paper as [35]
In the citing paper
“Specifically, we estimate that 40.4% of online messages during this period were due to such automated agents, doubling the activity with respect to estimates of only four years ago 35 .”
From Assessing the risks of ‘infodemics’ in response to COVID-19 epidemics (2020) · cites this paper as [35]
In the citing paper
“As expected for complex networks with highly heterogeneous connectivity [27], the distribution of observed cascade sizes is heavy-tailed and compatible with a power law characterized by a scaling exponent γ = −2.33±0.04, similarly to size distribution in percolation theory or avalanches in self-organized criticality [32].”
From Influence of augmented humans in online interactions during voting events (2019) · cites this paper as [27]
Citations
Cites
Phase Transitions and Critical Phenomena
(2016) · Statistical and Thermal Physics · doi:10.1201/9781439850541-13 · Cited by 11,176
Strogatz, S. H. (2001) · Nature · doi:10.1038/35065725 · Cited by 8,302
Self-organized criticality: An explanation of the 1/f noise
Bak, P., Tang, C., & Wiesenfeld, K. (1987) · Physical Review Letters · doi:10.1103/physrevlett.59.381 · Cited by 7,591
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
Competing Technologies, Increasing Returns, and Lock-In by Historical Events
Arthur, W. B. (1989) · The Economic Journal · doi:10.2307/2234208 · Cited by 7,489
Introduction to Percolation Theory
Stauffer, D., Aharony, A., & Redner, S. (1993) · Physics Today · doi:10.1063/1.2808877 · Cited by 6,666
A Simple Model of Herd Behavior
Banerjee, A. V. (1992) · The Quarterly Journal of Economics · doi:10.2307/2118364 · Cited by 6,556
Error and attack tolerance of complex networksPreprint
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (2000) · Cited by 6,467
Bollobás, B. (1985) · Cited by 6,196
Threshold models of collective behavior
Granovetter, M. (1978) · American Journal of Sociology · doi:10.1086/226707 · Cited by 6,072
Research works printed but not linked: 2
- R J Shiller Am Econ Rev 85, 181–185 (1995).
- 10.1086/261849 · DOI · Paper page
Cited by
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Statistical physics of social dynamics
Castellano, C., Fortunato, S., & Loreto, V. (2009) · Reviews of Modern Physics · doi:10.1103/revmodphys.81.591 · Cited by 4,119
Epidemic processes in complex networks
Pastor-Satorras, R., Castellano, C., Van Mieghem, P., & Vespignani, A. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.925 · Cited by 3,697
Kivela, M., Arenas, A., Barthelemy, M., Gleeson, J. P., Moreno, Y., & Porter, M. A. (2014) · Journal of Complex Networks · doi:10.1093/comnet/cnu016 · Cited by 3,235
The structure and dynamics of multilayer networks
Boccaletti, S., Bianconi, G., Criado, R., del Genio, C. I., Gómez-Gardeñes, J., Romance, M., Sendiña-Nadal, I., Wang, Z., & Zanin, M. (2014) · Physics Reports · doi:10.1016/j.physrep.2014.07.001 · Cited by 3,125
Metadata
- Authors
- Watts, D. J.
- Affiliations
- Columbia University (US)
- Corresponding author
- Watts, Duncan J.
- ORCID
- Watts, Duncan J.
- Venue
- Proceedings of the National Academy of Sciences
- Publisher
- National Academy of Sciences
- Published
- 2002-04-30
- Volume
- 99
- Issue
- 9
- Pages
- 5766-5771
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- PMC
- PMC122850
- OpenAlex
- W2114696370
- Semantic Scholar
- 90468dc37b06638b1358e2764084bd6822565f6d
- Cited by
- 2,673
- References
- 39
- Citations by year
- 2026: 153 · 2025: 102 · 2024: 95 · 2023: 95 · 2022: 130 · 2021: 129 · 2020: 152 · 2019: 147 · 2018: 229 · 2017: 160 · 2016: 165 · 2015: 173 · 2014: 140 · 2013: 169 · 2012: 142
- FWCI
- 13.36
- Type
- journal article
- Language
- en
- Open access
- green
- www.ncbi.nlm.nih.gov
- Locations
- Proceedings of the National Academy of Sciences (publishedVersion)
- Europe PMC (PubMed Central) (publishedVersion)
- PubMed Central (publishedVersion)
- PubMed (publishedVersion)
- Funders
- Massachusetts Institute of Technology
- Topics
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Opinion Dynamics and Social Influence
- Social Sciences › Economics, Econometrics and Finance › Economics and Econometrics › Complex Systems and Time Series Analysis
- Keywords
- global cascades, random networks, threshold dynamics, power-law distribution, bimodal distribution, network connectivity, node stability, degree heterogeneity, percolation, self-organized criticality, avalanches, cascading failures, diffusion of innovations, collective action
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: A simple model of global cascades on random networks. https://app.cochat.ai/papers/10.1073/pnas.082090499
- The paper
- Watts, D. J. (2002). A simple model of global cascades on random networks. Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.082090499
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.