• Corpus ID: 53665118

Efficient message passing for cascade size distributions on finite trees

@article{Burkholz2018EfficientMP,
  title={Efficient message passing for cascade size distributions on finite trees},
  author={Rebekka Burkholz},
  journal={arXiv: Physics and Society},
  year={2018}
}
  • R. Burkholz
  • Published 14 November 2018
  • Computer Science
  • arXiv: Physics and Society
How big is the risk that a few initial failures of networked nodes amplify to large cascades that endanger the functioning of the system? Common answers refer to the average final cascade size. Two analytic approaches allow its computation: a) (heterogeneous) mean field approximation and b) belief propagation. The former applies to (infinitely) large locally tree-like networks, while the latter is exact on finite trees. Yet, cascade sizes can have broad and multi-modal distributions that are… 

Figures from this paper

References

SHOWING 1-10 OF 28 REFERENCES

Explicit size distributions of failure cascades redefine systemic risk on finite networks

This work derives explicit closed-form solutions for the full probability distribution of the final cascade size in finite networks, and focuses on two topological limit cases, the complete network representing a dense network with a very narrow degree distribution, and the starnetwork representing a sparse network with an inhomogeneous degree distribution.

A framework for cascade size calculations on random networks

This work presents a framework to calculate the cascade size evolution for a large class of cascade models on random network ensembles in the limit of infinite network size by shifting the perspective from the known branching process approximations to the iterative update of suitable probability distributions.

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.

Reconstructing Parameters of Spreading Models from Partial Observations

An efficient dynamic message-passing algorithm is introduced, able to reconstruct parameters of the spreading model given only partial information on the activation times of nodes in the network, which is generalizable to a large class of dynamic models, as well to the case of temporal graphs.

Correlations between thresholds and degrees: An analytic approach to model attacks and failure cascades

This work shows how node variables determine the evolution of cascades in random networks become tractable in the thermodynamic limit of infinite network size, and enables the analytic description of node attacks that are characterized by threshold allocations based on node degree.

Survey propagation: An algorithm for satisfiability

A new type of message passing algorithm is introduced which allows to find efficiently a satisfying assignment of the variables in this difficult region of randomly generated formulas.

Rare events and discontinuous percolation transitions.

A large deviation theory of percolation characterizing the response of a sparse network to rare events is built and reveals also discontinuous transitions corresponding to rare configurations of the initial damage for which the size of the giant component is suppressed.

Binary-state dynamics on complex networks: pair approximation and beyond

A wide class of binary-state dynamics on networks---including, for example, the voter model, the Bass diffusion model, and threshold models---can be described in terms of transition rates (spin-flip

Random graphs with arbitrary degree distributions and their applications.

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.

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.