Percolation of localized attack on complex networks

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.

References in corpus (4)

• Network Physiology reveals relations between network topology and physiological function
• Clique percolation in random networks
• Robustness of interdependent networks under targeted attack
• Evolution of robust network topologies: Emergence of central backbones

Cited by in corpus (7)

• Percolation on complex networks: Theory and application
• Abrupt transition due to non-local cascade propagation in multiplex systems
• Optimal cost for strengthening or destroying a given network
• Joint Cyber Risk Assessment of Network Systems with Heterogeneous Components
• Phase transition in evolving networks that combine preferential attachment and random node deletion
• A Vulnerability Study on Academic Collaboration Networks Based on Network Dynamics
• Networks with degree-degree correlations is a special case of edge-coloured random graphs