The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Percolation of localized attack on complex networks
Open accessAbstract
The robustness of complex networks against node failure and malicious attack has been of interest for decades, while most of the research has focused on random attack or hub-targeted attack. In many real-world scenarios, however, attacks are neither random nor hub-targeted, but localized, where a group of neighboring nodes in a network are attacked and fail. In this paper we develop a percolation framework to analytically and numerically study the robustness of complex networks against such localized attack. In particular, we investigate this robustness in Erdős–Rényi networks, random-regular networks, and scale-free networks. Our results provide insight into how to better protect networks, enhance cybersecurity, and facilitate the design of more robust infrastructures.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Figures


![Figure 3 Percolation properties for a SF network under localized attack (LA) and random attack (RA). Solid lines are from theory (equation (1)) and symbols represent simulation results with = N 10 6 , m =2,and 〈 〉 = k 3 . (a) Critical threshold p c as a function of degree exponent λ . When λ → ∞ , the SF network converges to an RR network with = 〈 〉 = k k 3 0 , so → -= p k (RA) 1 ( 1) 0.5 c 0 and → -= --p k (LA) ( 1) 0.125 c 0 k k 0 0 2 , as con fi rmed in simulations. Note that for λ < ⩽ 2 3 , → p 0 c in the thermodynamic limit ( → ∞ N ) for random attack [2]. (b) When λ λ < c , the SF network is more vulnerable to localized attack compared to random attack. (c) When λ λ = c , p c for localized attack and for random attack are equal. (d) When λ λ > c , the SF network is more robust against localized attack compared to random attack.](https://figures.cochat.ai/paper-figures/2125a4bde4d04209841cbd2de2ec78bf/percolation-of-localized-attack-on-complex-networks-figure-3.png)
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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?
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“under the fractional threshold failure mechanism scale-free networks are more vulnerable compared to their ER counterparts with the same average degree39.”
From Mitigation of cascading failures in complex networks (2020) · cites this paper as [39]
Experimental — accuracy not yet measured
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
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
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
Introduction to Percolation Theory
Stauffer, D., Aharony, A., & Redner, S. (1993) · Physics Today · doi:10.1063/1.2808877 · Cited by 6,666
Newman, M. (2010) · doi:10.1093/acprof:oso/9780199206650.001.0001 · Cited by 6,595
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (2000) · RePEc: Research Papers in Economics · Cited by 6,469
Bollobás, B. (1985) · Cited by 6,196
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-citationRandom graphs with arbitrary degree distributions and their applications
Newman, M. E. J., Strogatz, S. H., & Watts, D. J. (2001) · Physical Review E · doi:10.1103/physreve.64.026118 · Cited by 3,648
Spread of epidemic disease on networks
Newman, M. E. J. (2002) · Physical Review E · doi:10.1103/physreve.66.016128 · Cited by 3,218
(2011) · Choice Reviews Online · doi:10.5860/choice.48-3328 · Cited by 2,736
Research works printed but not linked: 2
- 10.1038/35019019 · DOI · Paper page
- 10.1109/infocom.2009.5062074 · doi:10.1109/infocom.2009.5062074
Cited by
Challenges in the vulnerability and risk analysis of critical infrastructures
Zio, E. (2016) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2016.02.009 · Cited by 429
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
Local floods induce large-scale abrupt failures of road networks
Wang, W., Yang, S., Stanley, H. E., & Gao, J. (2019) · Nature Communications · doi:10.1038/s41467-019-10063-w · Cited by 199
Localized attacks on spatially embedded networks with dependencies
Berezin, Y., Bashan, A., Danziger, M. M., Li, D., & Havlin, S. (2015) · Scientific Reports · doi:10.1038/srep08934 · Cited by 189
Self-citationDong, S., Esmalian, A., Farahmand, H., & Mostafavi, A. (2020) · Computers, Environment and Urban Systems · doi:10.1016/j.compenvurbsys.2019.101443 · Cited by 198
Metadata
- Authors
- Shao, S., Huang, X., Stanley, H. E., & Havlin, S.
- Affiliations
- Boston University (US)
- Corresponding author
- Shao, Shuai
- Venue
- New Journal of Physics
- Publisher
- IOP Publishing
- Published
- 2015-02-18
- Volume
- 17
- Issue
- 2
- Pages
- 023049
- ISSN
- 1367-2630 (ISSN-L)
- OpenAlex
- W1979169856
- Semantic Scholar
- 8da1b8bb89b94c6b2705067f967adc3aef894ab3
- Cited by
- 182
- References
- 36
- Citations by year
- 2026: 5 · 2025: 12 · 2024: 13 · 2023: 13 · 2022: 15 · 2021: 22 · 2020: 15 · 2019: 27 · 2018: 22 · 2017: 18 · 2016: 14 · 2015: 6
- FWCI
- 12.61
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- cc-by
- iopscience.iop.org/info/page/text-and-data-mining (tdm)
- creativecommons.org/licenses/by/3.0/ (vor)
- Locations
- New Journal of Physics (publishedVersion, cc-by)
- arXiv (Cornell University) (submittedVersion)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion)
- arXiv (Cornell University)
- Funders
- Defense Threat Reduction Agency: (HDTRA-1-09-1-0035, HDTRA-1-10-1-0014)
- Israel Science Foundation
- EUROPEAN MULTIPLEX, CONGAS and LINC projects, DFG, the Next Generation Infrastructure (Bsik)
- European Union: (FOC program)
- Directorate for Biological Sciences: (CMM1 1125290)
- Office of Naval Research: (N00014-09-1-0380, N00014-12-1-0548, N62909-14-1-N019)
- 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
- localized attacks, complex networks, network robustness, percolation, node failure, Erdős-Rényi random graphs, random regular networks, scale-free networks, network protection, cybersecurity
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: Percolation of localized attack on complex networks. https://app.cochat.ai/papers/10.1088/1367-2630/17/2/023049
- The paper
- Shao, S., Huang, X., Stanley, H. E., & Havlin, S. (2015). Percolation of localized attack on complex networks. New Journal of Physics. https://doi.org/10.1088/1367-2630/17/2/023049
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.