Catastrophic cascade of failures in interdependent networks
Open accessThe DOI matches its Crossref record; 51 of the 51 references it cites were found in a registry or an index.
Abstract
Complex networks have been studied intensively for a decade, but research still focuses on the limited case of a single, non-interacting network. Modern systems are coupled together and therefore should be modelled as interdependent networks. A fundamental property of interdependent networks is that failure of nodes in one network may lead to failure of dependent nodes in other networks. This may happen recursively and can lead to a cascade of failures. In fact, a failure of a very small fraction of nodes in one network may lead to the complete fragmentation of a system of several interdependent networks. A dramatic real-world example of a cascade of failures (‘concurrent malfunction’) is the electrical blackout that affected much of Italy on 28 September 2003: the shutdown of power stations directly led to the failure of nodes in the Internet communication network, which in turn caused further breakdown of power stations. Here we develop a framework for understanding the robustness of interacting networks subject to such cascading failures. We present exact analytical solutions for the critical fraction of nodes that, on removal, will lead to a failure cascade and to a complete fragmentation of two interdependent networks. Surprisingly, a broader degree distribution increases the vulnerability of interdependent networks to random failure, which is opposite to how a single network behaves. Our findings highlight the need to consider interdependent network properties in designing robust networks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“errors that may be acceptable in isolation could compound in complex, dynamic networks of agents (Buldyrev et al., 2010; Kirilenko et al., 2017; Lee & Tiwari, 2024; Maas, 2018; Sanders et al., 2018);”
From Multi-Agent Risks from Advanced AI (2025) · cites this paper as Buldyrev et al., 2010
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“In the presence of interdependences, a new type of percolation phase transition can be defined [70] in which the order parameter is the size of the mutually connected giant component, i.e. an appropriate generalization of the giant component defined on single networks.”
From Interdisciplinary and physics challenges of network theory (2015) · cites this paper as [70]
The cited source says what the claim attributes to it.
In the citing paper
“When nodes of an interdependent multilayer networks are damaged with an increasing probability, the mutually connected component has a hybrid phase transition [70,76], in which the size of the mutually connected giant component has a discontinuity and the system undergoes an avalanche of failures.”
From Interdisciplinary and physics challenges of network theory (2015) · cites this paper as [70]
The cited source says what the claim attributes to it.
In the citing paper
“Interdependent networks represent classes of infrastructure systems where critical resources are supplied by one network to the other and vice versa.”
From Mitigation of cascading failures in complex networks (2020) · cites this paper as [4]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Emergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135 · cited 2×
“f the entire graph. While in the BA network, the preferential attachment rule develops correlations in the network and a scale-free degree distribution is obtained, which in a general way is given by [24], P(k) = ˆ ck−γ m ≤k < K 0 otherwise (2) , where γ is the degree exponent and K an upper limit due to the system…”
BackgroundStatistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Complex networks: structure and dynamics
BOCCALETTI, S., LATORA, V, MORENO, Y., CHAVEZ, M., & HWANG, D. (2006) · Physics Reports · doi:10.1016/j.physrep.2005.10.009 · Cited by 11,010
Introduction to Percolation Theory
Stauffer, D., Aharony, A., & Redner, S. (1993) · Physics Today · doi:10.1063/1.2808877 · Cited by 6,666
Newman, M. (2010) · doi:10.1093/acprof:oso/9780199206650.001.0001 · Cited by 6,595
Power-law distributions in empirical data
Clauset, A. J., Shalizi, C. R., & Newman, M. E. J. (2018) · Figshare · doi:10.1184/r1/6586835.v1 · Cited by 6,504
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (2000) · RePEc: Research Papers in Economics · Cited by 6,469
Bollobás, B. (1985) · Cited by 6,196
The Evolution of Random Graphs
(1986) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/062/06 · Cited by 5,543
Erdős, P., & Rényi, A. (2022) · Publicationes Mathematicae Debrecen · doi:10.5486/pmd.1959.6.3-4.12 · Cited by 5,337
Random graphs with arbitrary degree distributions and their applications
Newman, M. E. J., Strogatz, S. H., & Watts, D. J. (2001) · Physical Review E · doi:10.1103/physreve.64.026118 · Cited by 3,648
Spread of epidemic disease on networks
Newman, M. E. J. (2002) · Physical Review E · doi:10.1103/physreve.66.016128 · Cited by 3,218
Dorogovtsev, S. N., & Mendes, J. F. F. (2002) · Advances in Physics · doi:10.1080/00018730110112519 · Cited by 3,171
Identifying, understanding, and analyzing critical infrastructure interdependencies
(2001) · IEEE Control Systems · doi:10.1109/37.969131 · Cited by 2,851
Dynamical Processes on Complex Networks
Barrat, A., Barthélemy, M., & Vespignani, A. (2008) · doi:10.1017/cbo9780511791383 · Cited by 2,704
Network Robustness and Fragility: Percolation on Random Graphs
Callaway, D. S., Newman, M. E. J., Strogatz, S. H., & Watts, D. J. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.5468 · Cited by 2,480
Resilience of the Internet to Random Breakdowns
Cohen, R., Erez, K., ben-Avraham, D., & Havlin, S. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.4626 · Cited by 2,391
Self-citationThe Structure and Dynamics of Networks
Newman, M., Barabási, A.-L., & Watts, D. J. (2011) · Princeton University Press eBooks · doi:10.1515/9781400841356 · Cited by 2,268
Critical phenomena in complex networks
Dorogovtsev, S. N., Goltsev, A. V., & Mendes, J. F. F. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.1275 · Cited by 2,220
Cascade-based attacks on complex networks
Motter, A. E., & Lai, Y.-C. (2002) · Physical Review E · doi:10.1103/physreve.66.065102 · Cited by 1,929
Attack vulnerability of complex networks
Holme, P., Kim, B. J., Yoon, C. N., & Han, S. K. (2002) · Physical Review E · doi:10.1103/physreve.65.056109 · Cited by 1,891
On the evolution of random graphs
Erdös, P., & Rényi, A. (2011) · The Structure and Dynamics of Networks · doi:10.1515/9781400841356.38 · Cited by 1,757
Dorogovtsev, S. N., & Mendes, J. F. F. (2003) · doi:10.1093/acprof:oso/9780198515906.001.0001 · Cited by 1,563
Self-similarity of complex networks
Song, C., Havlin, S., & Makse, H. A. (2005) · Nature · doi:10.1038/nature03248 · Cited by 1,495
Self-citationThe Structure and Dynamics of Networks
Boguñá, M. (2007) · Journal of Statistical Physics · doi:10.1007/s10955-006-9267-8 · Cited by 1,485
Breakdown of the Internet under Intentional Attack
Cohen, R., Erez, K., ben-Avraham, D., & Havlin, S. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.3682 · Cited by 1,455
Self-citationStructural vulnerability of the North American power grid
Albert, R., Albert, I., & Nakarado, G. L. (2004) · Physical Review E · doi:10.1103/physreve.69.025103 · Cited by 1,415
Evolution and Structure of the Internet: A Statistical Physics Approach
Pastor-Satorras, R., & Vespignani, A. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511610905 · Cited by 1,310
Universal Behavior of Load Distribution in Scale-Free Networks
Goh, K.-I., Kahng, B., & Kim, D. (2001) · Physical Review Letters · doi:10.1103/physrevlett.87.278701 · Cited by 1,246
Mitigation of malicious attacks on networks
Schneider, C. M., Moreira, A. A., Andrade, J. S., Havlin, S., & Herrmann, H. J. (2011) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1009440108 · Cited by 1,023
Self-citationHandbook of Graphs and Networks: From the Genome to the Internet
(2002) · Wiley eBooks · doi:10.1002/3527602755 · Cited by 949
Parshani, R., Buldyrev, S. V., & Havlin, S. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.048701 · Cited by 788
Self-citationComplex Networks: Structure, Robustness and Function
(2010) · Cited by 729
Explosive Percolation in Random Networks
Achlioptas, D., D'Souza, R. M., & Spencer, J. (2009) · Science · doi:10.1126/science.1167782 · Cited by 673
Modelling interdependent infrastructures using interacting dynamical models
Rosato, V., Issacharoff, L., Tiriticco, F., Meloni, S., Porcellinis, S. D., & Setola, R. (2008) · International Journal of Critical Infrastructures · doi:10.1504/ijcis.2008.016092 · Cited by 490
Evolution and Structure of the Internet: A Statistical Physics Approach
(2005) · Journal of Documentation · doi:10.1108/00220410510598571 · Cited by 423
Kurant, M., & Thiran, P. (2006) · Physical Review Letters · doi:10.1103/physrevlett.96.138701 · Cited by 421
Masaki, T. (2002) · Ecological Studies · doi:10.1007/978-4-431-67879-3_6 · Cited by 353
Percolation critical exponents in scale-free networks
Cohen, R., ben-Avraham, D., & Havlin, S. (2002) · Physical Review E · doi:10.1103/physreve.66.036113 · Cited by 312
Self-citationExplosive Percolation Transition is Actually Continuous
da Costa, R. A., Dorogovtsev, S. N., Goltsev, A. V., & Mendes, J. F. F. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.255701 · Cited by 287
Explosive Growth in Biased Dynamic Percolation on Two-Dimensional Regular Lattice Networks
Ziff, R. M. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.045701 · Cited by 183
Explosive Percolation in Scale-Free Networks
Radicchi, F., & Fortunato, S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.168701 · Cited by 178
Explosive Percolation via Control of the Largest Cluster
Araújo, N. A. M., & Herrmann, H. J. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.035701 · Cited by 177
Explosive percolation: A numerical analysis
Radicchi, F., & Fortunato, S. (2010) · Physical Review E · doi:10.1103/physreve.81.036110 · Cited by 150
Modelling Interdependencies Between the Electricity and Information Infrastructures
Laprie, J.-C., Kanoun, K., & Kaâniche, M. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-75101-4_5 · Cited by 141
Structure of shells in complex networks
Shao, J., Buldyrev, S. V., Braunstein, L. A., Havlin, S., & Stanley, E. (2009) · Physical Review E · doi:10.1103/physreve.80.036105 · Cited by 132
Self-citationFailures propagation in critical interdependent infrastructures
Panzieri, S., & Setola, R. (2008) · International Journal of Modelling, Identification and Control · doi:10.1504/ijmic.2008.018186 · Cited by 85
Fractal boundaries of complex networks
Shao, J., Buldyrev, S. V., Cohen, R., Kitsak, M., Havlin, S., & Stanley, H. E. (2008) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/84/48004 · Cited by 58
Self-citationChiaradonna, S., Lollini, P., & Giandomenico, F. D. (2007) · Cited by 2
Research works printed but not linked: 1
- Peerenboom, J., Fischer, R. & Whitfield, R. Recovering from disruptions of interdependent critical infrastructures, in Proc . CRIS/DRM/IIIT/NSF Workshop Mitigat. Vulnerab. Crit. Infrastruct. Catastr. Failures (2001)
Cited by
Kivela, M., Arenas, A., Barthelemy, M., Gleeson, J. P., Moreno, Y., & Porter, M. A. (2014) · Journal of Complex Networks · doi:10.1093/comnet/cnu016 · Cited by 3,235
The structure and dynamics of multilayer networks
Boccaletti, S., Bianconi, G., Criado, R., del Genio, C. I., Gómez-Gardeñes, J., Romance, M., Sendiña-Nadal, I., Wang, Z., & Zanin, M. (2014) · Physics Reports · doi:10.1016/j.physrep.2014.07.001 · Cited by 3,125
“Interdependent (or layered) networks [25,34,35].”
BackgroundInfluentialBarthélemy, M. (2011) · Physics Reports · doi:10.1016/j.physrep.2010.11.002 · Cited by 2,469
The connectomics of brain disorders
Fornito, A., Zalesky, A., & Breakspear, M. (2015) · Nature Reviews Neuroscience · doi:10.1038/nrn3901 · Cited by 1,734
Networks beyond pairwise interactions: Structure and dynamics
Battiston, F., Cencetti, G., Iacopini, I., Latora, V., Lucas, M., Patania, A., Young, J.-G., & Petri, G. (2020) · Physics Reports · doi:10.1016/j.physrep.2020.05.004 · Cited by 1,602
Metadata
- Authors
- Buldyrev, S. V., Parshani, R., Paul, G., Stanley, H. E., & Havlin, S.
- Affiliations
- Boston University (US)
- Bar-Ilan University (IL)
- Corresponding author
- Buldyrev, Sergey V.
- Venue
- Nature
- Published
- 2010-04
- Volume
- 464
- Issue
- 7291
- Pages
- 1025-1028
- ISSN
- 0028-0836 (ISSN-L)
- 1476-4687
- OpenAlex
- W1968164782
- Semantic Scholar
- 84e27641ed70c5f62d215c6f7e474a238bdca0ee
- Cited by
- 4,513
- References
- 51
- Citations by year
- 2026: 365 · 2025: 272 · 2024: 240 · 2023: 226 · 2022: 301 · 2021: 324 · 2020: 311 · 2019: 350 · 2018: 378 · 2017: 328 · 2016: 342 · 2015: 313 · 2014: 300 · 2013: 221 · 2012: 136
- FWCI
- 102.80
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Nature (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Complex Network Analysis Techniques
- Physical Sciences › Engineering › Civil and Structural Engineering › Infrastructure Resilience and Vulnerability Analysis
- Social Sciences › Economics, Econometrics and Finance › Economics and Econometrics › Complex Systems and Time Series Analysis
- Keywords
- cascading failures, interdependent networks, network robustness, random node failures, degree distribution, network fragmentation, network vulnerability
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.