The DOI matches its Crossref record; 208 of the 208 references it cites were found in a registry or an index.
Robustness and resilience of complex networks
Open accessAbstract
Complex networks are ubiquitous: a cell, the human brain, a group of people and the Internet are all examples of interconnected many-body systems characterized by macroscopic properties that cannot be trivially deduced from those of their microscopic constituents. Such systems are exposed to both internal, localized, failures and external disturbances or perturbations. Owing to their interconnected structure, complex systems might be severely degraded, to the point of disintegration or systemic dysfunction. Examples include cascading failures, triggered by an initially localized overload in power systems, and the critical slowing downs of ecosystems which can be driven towards extinction. In recent years, this general phenomenon has been investigated by framing localized and systemic failures in terms of perturbations that can alter the function of a system. We capitalize on this mathematical framework to review theoretical and computational approaches to characterize robustness and resilience of complex networks. We discuss recent approaches to mitigate the impact of perturbations in terms of designing robustness, identifying early-warning signals and adapting responses. In terms of applications, we compare the performance of the state-of-the-art dismantling techniques, highlighting their optimal range of applicability for practical problems, and provide a repository with ready-to-use scripts, a much-needed tool set. Complex biological, social and engineering systems operate through intricate connectivity patterns. Understanding their robustness and resilience against disturbances is crucial for applications. This Review addresses systemic breakdown, cascading failures and potential interventions, highlighting the importance of research at the crossroad of statistical physics and machine learning. A variety of biological, social and engineering complex systems can be defined in terms of units that exchange information through interaction networks, exhibiting diverse structural patterns such as heterogeneity, modularity and hierarchy. Owing to their interconnected nature, complex networks can amplify minor disruptions to a system-wide level, making it essential to understand their robustness against both external perturbations and internal failures. The study of complex networks’ robustness and resilience involves investigating phase transitions that usually depend on features such as degree connectivity, spatial embedding, interdependence and coupled dynamics. Network science offers a wide range of theoretical and computational methods for quantifying system robustness against perturbations, as well as grounded approaches to design robustness, identify early-warning signals and devise adaptive responses. These methods find application across a multitude of disciplines, including systems biology, systems neuroscience, engineering, and social and behavioural sciences. A variety of biological, social and engineering complex systems can be defined in terms of units that exchange information through interaction networks, exhibiting diverse structural patterns such as heterogeneity, modularity and hierarchy. Owing to their interconnected nature, complex networks can amplify minor disruptions to a system-wide level, making it essential to understand their robustness against both external perturbations and internal failures. The study of complex networks’ robustness and resilience involves investigating phase transitions that usually depend on features such as degree connectivity, spatial embedding, interdependence and coupled dynamics. Network science offers a wide range of theoretical and computational methods for quantifying system robustness against perturbations, as well as grounded approaches to design robustness, identify early-warning signals and devise adaptive responses. These methods find application across a multitude of disciplines, including systems biology, systems neuroscience, engineering, and social and behavioural sciences.
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
Granovetter, M. S. (1973) · American Journal of Sociology · doi:10.1086/225469 · Cited by 40,491
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
Statistical 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
Resilience and Stability of Ecological Systems
Holling, C. S. (1973) · Annual Review of Ecology and Systematics · doi:10.1146/annurev.es.04.110173.000245 · Cited by 18,995
The Structure and Function of Complex Networks
Newman, M. E. J. (2003) · SIAM Review · doi:10.1137/s003614450342480 · Cited by 18,719
Complex brain networks: graph theoretical analysis of structural and functional systems
Bullmore, E., & Sporns, O. (2009) · Nature Reviews Neuroscience · doi:10.1038/nrn2575 · Cited by 11,820
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
Self-organized criticality: An explanation of the 1/f noise
Bak, P., Tang, C., & Wiesenfeld, K. (1987) · Physical Review Letters · doi:10.1103/physrevlett.59.381 · Cited by 7,591
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534 · cited 5×
“Given the pervasive presence of complex networks in natural and artificial systems, it is important to understand under which conditions they can be fully functional and to what extent they are fragile to exter-nal perturbations and/or internal failures 29 .”
BackgroundInfluentialMaximizing the spread of influence through a social network
Kempe, D., Kleinberg, J., & Tardos, É. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956769 · Cited by 7,326
Cited by
Fundamental constraints to the logic of living systems
Solé, R., Kempes, C. P., Corominas-Murtra, B., De Domenico, M., Kolchinsky, A., Lachmann, M., Libby, E., Saavedra, S., Smith, E., & Wolpert, D. (2024) · Interface Focus · doi:10.1098/rsfs.2024.0010 · Cited by 34
“These network approaches further expand the relevance of constraints at various levels [113,114].”
BackgroundSelf-citation
Metadata
- Authors
- Artime, O., Grassia, M., De Domenico, M., Gleeson, J. P., Makse, H. A., Mangioni, G., Perc, M., & Radicchi, F.
- Venue
- Nature Reviews Physics
- Published
- 2024-01-08
- Volume
- 6
- Issue
- 2
- Pages
- 114-131
- ISSN
- 2522-5820 (ISSN-L)
- OpenAlex
- W4390675566
- Cited by
- 672
- References
- 208
- FWCI
- 10.68
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Robustness and resilience of complex networks. https://app.cochat.ai/papers/10.1038/s42254-023-00676-y
- The paper
- Artime, O., Grassia, M., De Domenico, M., Gleeson, J. P., Makse, H. A., Mangioni, G., Perc, M., & Radicchi, F. (2024). Robustness and resilience of complex networks. Nature Reviews Physics. https://doi.org/10.1038/s42254-023-00676-y
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.