A Simple Person’s Approach to Understanding the Contagion Condition for Spreading Processes on Generalized Random Networks

  title={A Simple Person’s Approach to Understanding the Contagion Condition for Spreading Processes on Generalized Random Networks},
  author={Peter Sheridan Dodds},
  journal={arXiv: Physics and Society},
  • P. Dodds
  • Published 5 May 2017
  • Mathematics
  • arXiv: Physics and Society
We present derivations of the contagion condition for a range of spreading mechanisms on families of generalized random networks and bipartite random networks. We show how the contagion condition can be broken into three elements, two structural in nature, and the third a meshing of the contagion process and the network. The contagion conditions we obtain reflect the spreading dynamics in a clear, interpretable way. For threshold contagion, we discuss results for all-to-all and random network… 
Financial fire sales as continuous-state complex contagion
Trading activities in financial systems create various channels through which systemic risk can propagate. An important contagion channel is financial fire sales, where a bank failure causes asset


Direct, physically motivated derivation of the contagion condition for spreading processes on generalized random networks.
This work derives a unifying analytic expression for the possibility of global spreading events in a straightforward, physically intuitive fashion and lays bare a direct mechanical understanding of an archetypal spreading phenomena that is not evident in circuitous extant mathematical approaches.
Cascades on correlated and modular random networks.
  • J. Gleeson
  • Physics
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2008
An analytical approach to determining the mean avalanche size in a broad class of dynamical models on random networks is introduced. Previous results on percolation transitions and epidemic sizes are
A simple model of global cascades on random networks
  • D. Watts
  • Computer Science
    Proceedings of the National Academy of Sciences of the United States of America
  • 2002
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 anincreasingly heterogeneous degree distribution makes it less vulnerable.
The Structure and Function of Complex Networks
Developments in this field are reviewed, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.
Seed size strongly affects cascades on random networks.
It is demonstrated that the low- z transition may in fact be discontinuous in certain parameter regimes, and connections between these results and the zero-temperature random-field Ising model on random graphs are discussed.
Generalized percolation in random directed networks.
  • M. Boguñá, M. Serrano
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2005
We develop a general theory for percolation in directed random networks with arbitrary two-point correlations and bidirectional edges--that is, edges pointing in both directions simultaneously. These
Influentials, Networks, and Public Opinion Formation
A central idea in marketing and diffusion research is that influentials—a minority of individuals who influence an exceptional number of their peers—are important to the formation of public opinion.
Emergence of scaling in random networks
A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
Generalized friendship paradox in complex networks: The case of scientific collaboration
By analyzing two coauthorship networks of Physical Review journals and Google Scholar profiles, it is found that the generalized friendship paradox (GFP) holds at the individual and network levels for various characteristics, including the number of coauthors, theNumber of citations, and the number-of- publications.
Collective dynamics of ‘small-world’ networks
Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.