The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Error and attack tolerance of complex networks
Abstract
Many complex systems display a surprising degree of tolerance against errors.For example, relatively simple organisms grow, persist and reproduce despite drastic pharmaceutical or environmental interventions, an error tolerance attributed to the robustness of the underlying metabolic network [1].Complex communication networks [2] display a surprising degree of robustness: while key components regularly malfunction, local failures rarely lead to the loss of the global information-carrying ability of the network.The stability of these and other complex systems is often attributed to the redundant wiring of the functional web defined by the systems' components.In this paper we demonstrate that error tolerance is not shared by all redundant systems, but it is displayed only by a class of inhomogeneously wired networks, called scale-free networks.We find that scale-free networks, describing a number of systems, such as the World Wide Web (www) [3][4][5], Internet [6], social networks [7] or a cell [8], display an unexpected degree of robustness, the ability of their nodes to communicate being unaffected by even unrealistically high failure rates.However, error tolerance comes at a high price: these networks are extremely vulnerable to attacks, i.e. to the selection and removal of a few nodes that play the most important role in assuring the network's connectivity.Such error tolerance and attack vulnerability are generic properties of communication networks, such as the Internet or the www, with complex implications on assuring information readiness.
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
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
Self-citationFrom molecular to modular cell biology.
Hartwell, L. H., Hopfield, J. J., Leibler, S., & Murray, A. W. (1999) · Nature · doi:10.1038/35011540 · Cited by 3,632
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
Dorogovtsev, S. N., & Mendes, J. F. F. (2002) · Advances in Physics · doi:10.1080/00018730110112519 · Cited by 3,171
Adamic, L. A., Lukose, R. M., Puniyani, A. R., & Huberman, B. A. (2001) · Physical Review E · doi:10.1103/physreve.64.046135 · Cited by 1,203
Handbook of Graphs and Networks: From the Genome to the Internet
(2002) · Wiley eBooks · doi:10.1002/3527602755 · Cited by 949
Modeling the Internet's large-scale topology
Yook, S.-H., Jeong, H., & Barabási, A.-L. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.172501399 · Cited by 665
Self-citation
Metadata
- Authors
- Albert, R., Jeong, H., & Barabási, A.-L.
- Venue
- The Structure and Dynamics of Networks
- Publisher
- Princeton University Press
- Published
- 2011-12-31
- Pages
- 503-506
- OpenAlex
- W4234809691
- Cited by
- 345
- References
- 2
- FWCI
- 45.76
- Type
- book chapter
- Language
- en
- Open access
- closed
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: Error and attack tolerance of complex networks. https://app.cochat.ai/papers/10.1515/9781400841356.503
- The paper
- Albert, R., Jeong, H., & Barabási, A.-L. (2011). Error and attack tolerance of complex networks. The Structure and Dynamics of Networks. https://doi.org/10.1515/9781400841356.503
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.