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 (21)

• Statistical mechanics of complex networks
• Error and attack tolerance of complex networks
• Catastrophic cascade of failures in interdependent networks
• Random graphs with arbitrary degree distributions and their applications
• The spread of epidemic disease on networks
• Network robustness and fragility: Percolation on random graphs
• Resilience of the Internet to random breakdowns
• Breakdown of the Internet under intentional attack
• Interdependent networks: Reducing the coupling strength leads to a change from a first to second order percolation transition
• Network Physiology reveals relations between network topology and physiological function
• Robustness of a Network of Networks
• Clique percolation in random networks
• Suppressing cascades of load in interdependent networks
• Robustness of interdependent networks under targeted attack
• Avalanche Collapse of Interdependent Network
• Stability and topology of scale-free networks under attack and defense strategies
• Percolation in networks composed of connectivity and dependency links
• Percolation of a general network of networks
• Structure of shells in complex networks
• Evolution of robust network topologies: Emergence of central backbones
• On the Tomography of Networks and Multicast Trees

Cited by in corpus (32)

• Percolation on complex networks: Theory and application
• Spatially localized attacks on interdependent networks: the existence of a finite critical attack size
• The influence of the broadness of the degree distribution on network's robustness: comparing localized attack and random attack
• $k$-core percolation on complex networks: Comparing random, localized and targeted attacks
• The interdependent network of gene regulation and metabolism is robust where it needs to be
• Resilience of Networks Formed of Interdependent Modular Networks
• Spreading of localized attacks in spatial multiplex networks
• Distance distribution in configuration model networks
• Cascading failures in coupled networks with both inner-dependency and inter-dependency links
• Optimization of the post-crisis recovery plans in scale-free networks
• The distribution of shortest path lengths in subcritical Erdős-Rényi networks
• GraphChallenge.org: Raising the Bar on Graph Analytic Performance
• The distribution of path lengths of self avoiding walks on Erdős-Rényi networks
• Abrupt transition due to non-local cascade propagation in multiplex systems
• Percolation of Hierarchical Networks and Networks of Networks
• Spreading of localized attacks on spatial multiplex networks with a community structure
• Optimal cost for strengthening or destroying a given network
• The structure of networks that evolve under a combination of growth, via node addition and random attachment, and contraction, via random node deletion
• REACT: REActive resilience for critical infrastructures using graph-Coloring Techniques
• Design, Generation, and Validation of Extreme Scale Power-Law Graphs
• The epidemiology of lateral movement: exposures and countermeasures with network contagion models
• GraphChallenge.org Triangle Counting Performance
• Joint Cyber Risk Assessment of Network Systems with Heterogeneous Components
• Phase transition in evolving networks that combine preferential attachment and random node deletion
• Characterizing spatial point processes by percolation transitions
• On the complexity of color-avoiding site and bond percolation
• Color-avoiding percolation in edge-colored Erdős-Rényi graphs
• A machine learning procedure to detect network attacks
• Cascading failures in anisotropic interdependent networks of spatial modular structures
• 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
• The healing strategy by prioritizing minimum degree against localized attacks on interdependent spatially embedded networks