A simple model of global cascades on random networks

@article{Watts2002ASM,
  title={A simple model of global cascades on random networks},
  author={Duncan J. Watts},
  journal={Proceedings of the National Academy of Sciences of the United States of America},
  year={2002},
  volume={99},
  pages={5766 - 5771}
}
  • D. Watts
  • Published 30 April 2002
  • Computer Science
  • Proceedings of the National Academy of Sciences of the United States of America
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… 

Figures from this paper

Trend-driven information cascades on random networks
  • Teruyoshi Kobayashi
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2015
TLDR
The model shows that global nodes play a role as accelerating cascades once a trend emerges while reducing the probability of a trend emerging, suggesting that a moderate share of trend followers may maximize the average size of cascades.
Threshold Models of Cascades in Large-Scale Networks
TLDR
It is proved that, on all but a fraction of networks with given degree and threshold statistics that is vanishing as the network size grows large, the actual fraction of adopters of a given action is arbitrarily close to the output of the aforementioned recursion.
A Simple Model of Cascades in Networks ∗
We consider a linear threshold model of cascades in networks. An agent switches (e.g. adopts an innovation) if the proportion of his neighbors who have already switched exceeds his threshold. Agents’
A New Model Of Cascades On Random Networks With A Threshold Rule Fundamentals
TLDR
A dynamic Markov model formulation that assumes a finite network with arbitrary average nodal degree and predicts the well known properties of cascades, for instance that a single node seed can start a global cascade in the appropriate regime.
Degree-targeted cascades in modular, degree-heterogeneous networks
TLDR
It is established that activating the highest-degree nodes rather than random selection is more effective at growing a cascade locally, while the ability of a cascade to fully activate other modules is determined by the extent of large-scale interconnection between modules and is independent of how seed nodes are selected.
Dynamic theory of cascades on finite clustered random networks with a threshold rule.
  • D. Whitney
  • Physics
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2010
TLDR
The Watts model of threshold dynamics on random Erdos-Rényi networks is analyzed to determine the dynamic time evolution of cascades and it is shown that this region extends to larger values of z than predicted by infinite network analyses.
Kinetics of Social Contagion
TLDR
Analysis of analytically and by simulations a general model that incorporates threshold mechanism capturing sensitivity to peer pressure, the effect of "immune" nodes who never adopt, and a perpetual flow of external information finds that there is a transition from fast to slow spreading governed by entirely different mechanisms.
Diffusion in large networks
Collective influence maximization in threshold models of information cascading with first-order transitions
TLDR
Analysis of the collective influence in general threshold models of opinion cascading reveals that the importance of spreaders is fixed by the subcritical paths along which cascades propagate: the number of sub critical paths attached to each spreader determines its contribution to global cascades.
Coordination problems on networks revisited: statics and dynamics
  • L. Dall’Asta
  • Economics
    Journal of Statistical Mechanics: Theory and Experiment
  • 2021
TLDR
It is shown that well beyond the instability region, full coordination is still globally stochastically stable, however equilibrium selection processes with low stochasticity or strong memory effects can be prevented from achieving full coordination by being trapped into a large set of locally stable Nash equilibria at low/medium coordination.
...
...

References

SHOWING 1-10 OF 62 REFERENCES
Small worlds: the dynamics of networks between order and randomness
  • Jie Wu
  • Computer Science
    SGMD
  • 2002
Everyone knows the small-world phenomenon: soon after meeting a stranger, we are surprised to discover that we have a mutual friend, or we are connected through a short chain of acquaintances. In his
Network robustness and fragility: percolation on random graphs.
TLDR
This paper studies percolation on graphs with completely general degree distribution, giving exact solutions for a variety of cases, including site percolators, bond percolations, and models in which occupation probabilities depend on vertex degree.
Scaling and percolation in the small-world network model.
  • M. NewmanD. Watts
  • Mathematics
    Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics
  • 1999
TLDR
There is one nontrivial length-scale in the small-world network model of Watts and Strogatz, analogous to the correlation length in other systems, which is well-defined in the limit of infinite system size and which diverges continuously as the randomness in the network tends to zero, giving a normal critical point in this limit.
Error and attack tolerance of complex networks
TLDR
It is found that scale-free networks, which include the World-Wide Web, the Internet, social networks and cells, display an unexpected degree of robustness, the ability of their nodes to communicate being unaffected even by unrealistically high failure rates.
Random graphs with arbitrary degree distributions and their applications.
TLDR
It is demonstrated that in some cases random graphs with appropriate distributions of vertex degree predict with surprising accuracy the behavior of the real world, while in others there is a measurable discrepancy between theory and reality, perhaps indicating the presence of additional social structure in the network that is not captured by the random graph.
Threshold Models of Collective Behavior
Models of collective behavior are developed for situations where actors have two alternatives and the costs and/or benefits of each depend on how many other actors choose which alternative. The key
Introduction To Percolation Theory
Preface to the Second Edition Preface to the First Edition Introduction: Forest Fires, Fractal Oil Fields, and Diffusion What is percolation? Forest fires Oil fields and fractals Diffusion in
The outbreak of cooperation
We study the ongoing collective action problem among intentional agents whose choices depend not only on the past but also on their expectations as to how their actions will affect those of others.
Exploring complex networks
TLDR
This work aims to understand how an enormous network of interacting dynamical systems — be they neurons, power stations or lasers — will behave collectively, given their individual dynamics and coupling architecture.
...
...