The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Stability and Topology of Scale-Free Networks under Attack and Defense Strategies
Open accessAbstract
We study tolerance and topology of random scale-free networks under attack and defense strategies that depend on the degree k of the nodes. This situation occurs, for example, when the robustness of a node depends on its degree or in an intentional attack with insufficient knowledge of the network. We determine, for all strategies, the critical fraction p(c) of nodes that must be removed for disintegrating the network. We find that, for an intentional attack, little knowledge of the well-connected sites is sufficient to strongly reduce p(c). At criticality, the topology of the network depends on the removal strategy, implying that different strategies may lead to different kinds of percolation transitions.
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
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
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
Dorogovtsev, S. N., & Mendes, J. F. F. (2003) · doi:10.1093/acprof:oso/9780198515906.001.0001 · Cited by 1,563
Cited by
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
Percolation of localized attack on complex networks
Shao, S., Huang, X., Stanley, H. E., & Havlin, S. (2015) · New Journal of Physics · doi:10.1088/1367-2630/17/2/023049 · Cited by 182
Self-citationDisrupting networks of hate: characterising hateful networks and removing critical nodes
Alorainy, W., Burnap, P., Liu, H., Williams, M., & Giommoni, L. (2022) · Social Network Analysis and Mining · doi:10.1007/s13278-021-00818-z · Cited by 15
Metadata
- Authors
- Gallos, L. K., Cohen, R., Argyrakis, P., Bunde, A., & Havlin, S.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2005-05-10
- Volume
- 94
- Issue
- 18
- Pages
- 188701-188701
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2136251178
- Cited by
- 310
- References
- 4
- FWCI
- 10.59
- 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: Stability and Topology of Scale-Free Networks under Attack and Defense Strategies. https://app.cochat.ai/papers/10.1103/physrevlett.94.188701
- The paper
- Gallos, L. K., Cohen, R., Argyrakis, P., Bunde, A., & Havlin, S. (2005). Stability and Topology of Scale-Free Networks under Attack and Defense Strategies. Physical Review Letters. https://doi.org/10.1103/physrevlett.94.188701
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.
