The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
The extreme vulnerability of interdependent spatially embedded networks
Open accessAbstract
Recent studies show that in interdependent networks a very small failure in one network may lead to catastrophic consequences. Above a critical fraction of interdependent nodes, even a single node failure can invoke cascading failures that may abruptly fragment the system, whereas below this critical dependency a failure of a few nodes leads only to a small amount of damage to the system. So far, research has focused on interdependent random networks without space limitations. However, many real systems, such as power grids and the Internet, are not random but are spatially embedded. Here we analytically and numerically study the stability of interdependent spatially embedded networks modelled as lattice networks. Surprisingly, we find that in lattice systems, in contrast to non-embedded systems, there is no critical dependency and any small fraction of interdependent nodes leads to an abrupt collapse. We show that this extreme vulnerability of very weakly coupled lattices is a consequence of the critical exponent describing the percolation transition of a single lattice. Networks of networks are vulnerable: a failure in one sub-network can bring the rest crashing down. Previous simulations have suggested that randomly positioned networks might offer some limited robustness under certain circumstances. Analysis now shows, however, that real-world interdependent networks, where nodes are positioned according to geographical constraints, might not be so resilient.
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.
Integrity signals
Registry
Cites
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.
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
Network motifs: simple building blocks of complex networks.
Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., & Alon, U. (2002) · Science · doi:10.1126/science.298.5594.824 · Cited by 7,368
Introduction to Percolation Theory
Stauffer, D., Aharony, A., & Redner, S. (1993) · Physics Today · doi:10.1063/1.2808877 · Cited by 6,666
Catastrophic cascade of failures in interdependent networks
Buldyrev, S. V., Parshani, R., Paul, G., Stanley, H. E., & Havlin, S. (2010) · Nature · doi:10.1038/nature08932 · Cited by 4,513
Self-citationIntroduction to Percolation Theory
Blanc, R. (1986) · Contribution of Clusters Physics to Materials Science and Technology · doi:10.1007/978-94-009-4374-2_13 · Cited by 2,897
Identifying, understanding, and analyzing critical infrastructure interdependencies
(2001) · IEEE Control Systems · doi:10.1109/37.969131 · Cited by 2,851
Barthélemy, M. (2011) · Physics Reports · doi:10.1016/j.physrep.2010.11.002 · Cited by 2,469
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-citationDorogovtsev, S. N., & Mendes, J. F. F. (2003) · doi:10.1093/acprof:oso/9780198515906.001.0001 · Cited by 1,563
Networks formed from interdependent networks
Gao, J., Buldyrev, S. V., Stanley, H. E., & Havlin, S. (2012) · Nature Physics · doi:10.1038/nphys2180 · Cited by 1,216
Self-citationFractals and Disordered Systems
(1991) · Springer eBooks · doi:10.1007/978-3-642-51435-7 · Cited by 1,155
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
Robustness and resilience of complex networks
Artime, O., Grassia, M., De Domenico, M., Gleeson, J. P., Makse, H. A., Mangioni, G., Perc, M., & Radicchi, F. (2024) · Nature Reviews Physics · doi:10.1038/s42254-023-00676-y · Cited by 672
Percolation on complex networks: Theory and application
Li, M., Liu, R.-R., Lü, L., Hu, M.-B., Xu, S., & Zhang, Y.-C. (2021) · Physics Reports · doi:10.1016/j.physrep.2020.12.003 · Cited by 365
Signal propagation in complex networks
Ji, P., Ye, J., Mu, Y., Lin, W., Tian, Y., Hens, C., Perc, M., Tang, Y., Sun, J., & Kurths, J. (2023) · Physics Reports · doi:10.1016/j.physrep.2023.03.005 · Cited by 360
Data based identification and prediction of nonlinear and complex dynamical systems
Wang, W.-X., Lai, Y.-C., & Grebogi, C. (2016) · Physics Reports · doi:10.1016/j.physrep.2016.06.004 · Cited by 299
A Critical Review of Robustness in Power Grids Using Complex Networks Concepts
Cuadra, L., Salcedo-Sanz, S., Del Ser, J., Jiménez-Fernández, S., & Geem, Z. (2015) · Energies · doi:10.3390/en8099211 · Cited by 277
Synchronous failure: the emerging causal architecture of global crisis
Homer-Dixon, T., Walker, B., Biggs, R., Crépin, A.-S., Folke, C., Lambin, E. F., Peterson, G. D., Rockström, J., Scheffer, M., Steffen, W., et al. (2015) · Ecology and Society · doi:10.5751/es-07681-200306 · Cited by 244
Simultaneous first- and second-order percolation transitions in interdependent networks
Zhou, D., Bashan, A., Cohen, R., Berezin, Y., Shnerb, N., & Havlin, S. (2014) · Physical Review E · doi:10.1103/physreve.90.012803 · Cited by 136
Self-citation
Metadata
- Authors
- Bashan, A., Berezin, Y., Buldyrev, S. V., & Havlin, S.
- Venue
- Nature Physics
- Published
- 2013-08-25
- Volume
- 9
- Issue
- 10
- Pages
- 667-672
- ISSN
- 1745-2473 (ISSN-L)
- 1745-2481
- OpenAlex
- W2106569518
- Cited by
- 308
- References
- 37
- FWCI
- 22.48
- Type
- journal article
- Language
- en
- Open access
- green
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.