Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

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 access
Shao, Shuai, Huang, Xuqing, Stanley, H Eugene, Havlin, Shlomo · 2015 · New Journal of Physics

Abstract

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1088/1367-2630/17/2/023049

Cites

36 of 36 references verified0 citation errors · 0 not checkable

Statistics

Figures

Image 1
CC-BY · From the PDF
Figure 2 Percolation transitions for (a) an ER network and (b) an RR network under localized attack (LA) and random attack (RA), with network size = N 10 6 , average degree 〈 〉 = k 4 in ER network, and = k 4 0 in RR network. Theoretical results (solid lines) and simulations (symbols) agree well with each other. Note that the effect of localized attack and random attack on an ER network (see (a)) are identical (here, = 〈 〉 = p k 1 0.25 c ), while an RR network (see (b)) is more robust against localized attack compared to random attack. The value of p c fi ts very well the prediction of equation (4).
Figure 2 Percolation transitions for (a) an ER network and (b) an RR network under localized attack (LA) and random attack (RA), with network size = N 10 6 , average degree 〈 〉 = k 4 in ER network, and = k 4 0 in RR network. Theoretical results (solid lines) and simulations (symbols) agree well with each other. Note that the effect of localized attack and random attack on an ER network (see (a)) are identical (here, = 〈 〉 = p k 1 0.25 c ), while an RR network (see (b)) is more robust against localized attack compared to random attack. The value of p c fi ts very well the prediction of equation (4).CC-BY · From the PDF
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.
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.CC-BY · From the PDF

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.

A few free checks a day · papers already verified open instantly · results are public

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?

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

Show all 36 references

Research works printed but not linked: 2

  1. 10.1038/35019019 · DOI · Paper page
  2. 10.1109/infocom.2009.5062074 · doi:10.1109/infocom.2009.5062074

Cited by

See all 186

Metadata

Authors
Shao, S., Huang, X., Stanley, H. E., & Havlin, S.
Affiliations
Boston University (US)
Corresponding author
Shao, Shuai
Venue
New Journal of Physics
Published
2015-02-18
Volume
17
Issue
2
Pages
023049
ISSN
1367-2630 (ISSN-L)
OpenAlex
W1979169856
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
Licence
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.