Which Networks are Least Susceptible to Cascading Failures?

DOI10.1109/FOCS.2011.38MaRDI QIDQ5494979zbMATH OpenFDO

Authors Éva Tardos, Lawrence E. Blume, David A. Easley, Jon M. Kleinberg, Robert D. Kleinberg

Publication date 30 July 2014

Published in 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10)

Cited in

(9)

• A Theory of Network Security: Principles of Natural Selection and Combinatorics
• Diffusion and cascading behavior in random networks
• Sharing market access in buyer-seller networks
• Inhomogeneous financial networks and contagious links
• On replica placement in high-availability storage under correlated failure
• On the computational complexity of measuring global stability of banking networks
• Algorithms for optimal replica placement under correlated failure in hierarchical failure domains
• On the inapproximability of minimizing cascading failures under the deterministic threshold model
• A network-based dynamic analysis in an equity stock market

This page was built for publication: Which Networks are Least Susceptible to Cascading Failures?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5494979)