Student or educator? Sign up with your school email and get 6 months of Pro free.

The DOI matches its Crossref record; 50 of the 50 references it cites were found in a registry or an index.

Catastrophic cascade of failures in interdependent networks

Open access
Buldyrev, Sergey V., Parshani, Roni, Paul, Gerald, Stanley, H. Eugene, Havlin, Shlomo·2010·Nature

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.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1038/nature08932

Cites

50 of 50 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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?

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

Show all 50 references

Research works printed but not linked: 2

  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)
  2. Erdős, P. & Rényi, A. On random graphs I. Publ. Math. 6, 290–297 (1959)

Cited by

See all 4,513

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
Cited by
4,513
References
50
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
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Catastrophic cascade of failures in interdependent networks. https://app.cochat.ai/papers/10.1038/nature08932
The paper
Buldyrev, S. V., Parshani, R., Paul, G., Stanley, H. E., & Havlin, S. (2010). Catastrophic cascade of failures in interdependent networks. Nature. https://doi.org/10.1038/nature08932

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.