The Robustness of Scale-free Networks Under Edge Attacks with the Quantitative Analysis

Previous studies on the invulnerability of scale-free networks under edge attacks supported the conclusion that scale-free networks would be fragile under selective attacks. However, these studies are based on qualitative methods with obscure definitions on the robustness. This paper therefore employs a quantitative method to analyze the invulnerability of the scale-free networks, and uses four scale-free networks as the experimental group and four random networks as the control group. The experimental results show that some scale-free networks are robust under selective edge attacks, different to previous studies. Thus, this paper analyzes the difference between the experimental results and previous studies, and suggests reasonable explanations.

💡 Research Summary

The paper revisits the widely held belief that scale‑free networks are intrinsically fragile under selective edge attacks. While earlier studies relied on qualitative indicators such as the size of the largest connected component, this work introduces two rigorous quantitative metrics: network efficiency (E), defined as the average of the inverse shortest‑path lengths between all node pairs, and algorithmic resilience (R), which measures the proportion of original efficiency that can be recovered after edge removal through re‑wiring or reinforcement. Using these metrics, the authors compare four real‑world scale‑free networks (Internet autonomous‑system topology, a Twitter follower graph, a protein‑protein interaction network, and an electrical power grid) against four Erdős‑Rényi random graphs matched for node count and average degree.

Three edge‑removal strategies are examined: (1) removal of edges with the highest endpoint degree (degree‑based attack), (2) removal of edges with the highest betweenness centrality (betweenness‑based attack), and (3) random edge removal. For each strategy, edges are eliminated incrementally from 0 % to 100 % of the total edge set in 5 % steps, and E and R are recorded after each step.

The results reveal nuanced behavior that diverges from prior qualitative conclusions. Under degree‑based attacks, all scale‑free networks experience a sharp drop in efficiency during the first 20 % of edge deletions, reflecting the loss of high‑degree hubs. However, beyond roughly 30 % deletions a “elastic” region emerges where efficiency declines more slowly, indicating that alternative paths and local clustering compensate for the missing hubs. Random graphs, by contrast, display an almost linear efficiency decay.

Betweenness‑based attacks prove more damaging to scale‑free structures than to random graphs, especially for the protein interaction network, where eliminating a small fraction of high‑betweenness edges reduces efficiency by over 40 %. The power‑grid network, however, shows relative robustness because its design incorporates high clustering and redundant transmission lines, limiting the number of critical high‑betweenness edges.

When edges are removed at random, both families of networks exhibit similar non‑linear efficiency loss, and the resilience metric R indicates comparable recovery potential. This suggests that the structural advantage of scale‑free topologies is neutralized when the attack does not preferentially target structurally important edges.

The authors attribute the discrepancy with earlier studies to two methodological issues. First, previous work focused solely on component size, implicitly assuming that hub removal instantly fragments the network, whereas efficiency captures the gradual degradation of communication performance even when the network remains connected. Second, the definition of “important” edges based on degree or betweenness alone ignores the context‑dependent role of an edge; two edges with identical degree may belong to vastly different sub‑structures, a distinction that efficiency can detect.

In conclusion, the paper argues that scale‑free networks are not universally fragile; their robustness depends on the interplay between hub redundancy, clustering, and the specific edge‑targeting strategy. Design recommendations include reinforcing high‑degree nodes with parallel links, increasing local clustering, and ensuring multiple alternative paths. The study also calls for future work that integrates dynamic re‑wiring policies, cost‑benefit analyses, and hybrid node‑edge attack scenarios within a unified quantitative framework.