2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (2011)

Palm Springs, California USA

Oct. 22, 2011 to Oct. 25, 2011

ISSN: 0272-5428

ISBN: 978-0-7695-4571-4

pp: 393-402

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/FOCS.2011.38

ABSTRACT

The spread of a cascading failure through a network is an issue that comes up in many domains: in the contagious failures that spread among financial institutions during a financial crisis, through nodes of a power grid or communication network during a widespread outage, or through a human population during the outbreak of an epidemic disease. Here we study a natural model of threshold contagion: each node is assigned a numerical threshold drawn independently from an underlying distribution, and it will fail as soon as its number of failed neighbors reaches this threshold. Despite the simplicity of the formulation, it has been very challenging to analyze the failure processes that arise from arbitrary threshold distributions, even qualitative questions concerning which graphs are the most resilient to cascading failures in these models have been difficult to resolve. Here we develop a set of new techniques for analyzing the failure probabilities of nodes in arbitrary graphs under this model, and we compare different graphs according to the maximum failure probability of any node in the graph when thresholds are drawn from a given distribution. We find that the space of threshold distributions has a surprisingly rich structure when we consider the risk that these thresholds induce on different graphs: small shifts in the distribution of the thresholds can favor graphs with a maximally clustered structure (i.e., cliques), those with a maximally branching structure (trees), or even intermediate hybrids.

INDEX TERMS

networks, contagion, percolation, cascading failures, voter models, financial contagion

CITATION

&. Tardos, L. Blume, R. Kleinberg, J. Kleinberg and D. Easley, "Which Networks are Least Susceptible to Cascading Failures?,"

*2011 IEEE 52nd Annual Symposium on Foundations of Computer Science(FOCS)*, Palm Springs, California USA, 2011, pp. 393-402.

doi:10.1109/FOCS.2011.38

CITATIONS

SEARCH