A simple model of global cascades on random networks

2002 Proceedings of the National Academy of Sciences 2,536 citations

Abstract

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.

Keywords

CascadeStatistical physicsPreferential attachmentStability (learning theory)Percolation (cognitive psychology)Simple (philosophy)Interdependent networksComputer scienceDegree distributionComplex networkCascading failureCluster (spacecraft)Distribution (mathematics)Self-organized criticalityRandom graphPhysicsCriticalityPower (physics)Theoretical computer scienceMathematicsElectric power system

Affiliated Institutions

Related Publications

Publication Info

Year
2002
Type
article
Volume
99
Issue
9
Pages
5766-5771
Citations
2536
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

2536
OpenAlex

Cite This

Duncan J. Watts (2002). A simple model of global cascades on random networks. Proceedings of the National Academy of Sciences , 99 (9) , 5766-5771. https://doi.org/10.1073/pnas.082090499

Identifiers

DOI
10.1073/pnas.082090499