$k$-core percolation on complex networks: Comparing random, localized and targeted attacks

Abstract

The type of malicious attack inflicting on networks greatly influences their stability under ordinary percolation in which a node fails when it becomes disconnected from the giant component. Here we study its generalization, $k$-core percolation, in which a node fails when it loses connection to a threshold $k$ number of neighbors. We study and compare analytically and by numerical simulations of $k$-core percolation the stability of networks under random attacks (RA), localized attacks (LA) and targeted attacks (TA), respectively. By mapping a network under LA or TA into an equivalent network under RA, we find that in both single and interdependent networks, TA exerts the greatest damage to the core structure of a network. We also find that for Erdős-Rényi (ER) networks, LA and RA exert equal damage to the core structure whereas for scale-free (SF) networks, LA exerts much more damage than RA does to the core structure.

arXiv comment10 pages, 11 figures

References in corpus (39)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• The structure and function of complex networks
• Error and attack tolerance of complex networks
• Catastrophic cascade of failures in interdependent networks
• Synchronization in complex networks
• The spread of epidemic disease on networks
• The structure and dynamics of multilayer networks
• Network robustness and fragility: Percolation on random graphs
• Resilience of the Internet to random breakdowns
• Self-similarity of complex networks
• Breakdown of the Internet under intentional attack
• Influence maximization in complex networks through optimal percolation
• Mitigation of Malicious Attacks on Networks
• Scale-Free Networks are Ultrasmall
• 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
• k-core organization of complex networks
• Robustness of interdependent networks under targeted attack
• Avalanche Collapse of Interdependent Network
• Abrupt transition in the structural formation of interconnected networks
• Stability and topology of scale-free networks under attack and defense strategies
• The extreme vulnerability of interdependent spatially embedded networks
• The critical effect of dependency groups on the function of networks
• Percolation in real interdependent networks
• Spatially localized attacks on interdependent networks: the existence of a finite critical attack size
• Improved El Niño-Forecasting by Cooperativity Detection
• k-core (bootstrap) percolation on complex networks: Critical phenomena and nonlocal effects
• Percolation of localized attack on complex networks
• Designing optimal transport networks
• Percolation of a general network of networks
• Percolation of partially interdependent networks under targeted attack
• Structure of shells in complex networks
• k-Core percolation on multiplex networks
• Heterogeneous-k-core versus Bootstrap Percolation on Complex Networks
• Evolution of robust network topologies: Emergence of central backbones
• The influence of the broadness of the degree distribution on network's robustness: comparing localized attack and random attack
• Critical dynamics of the k-core pruning process
• Efficient learning strategy of Chinese characters based on network approach

Cited by in corpus (17)

• Percolation on complex networks: Theory and application
• Cascading Failures in Interdependent Networks with Multiple Supply-Demand Links and Functionality Thresholds
• Spreading of localized attacks in spatial multiplex networks
• Critical behavior of $k$-core percolation: Numerical studies
• Percolation of Hierarchical Networks and Networks of Networks
• The structure of networks that evolve under a combination of growth, via node addition and random attachment, and contraction, via random node deletion
• Convexity in complex networks
• Cycle-tree guided attack of random K-core: Spin glass model and efficient message-passing algorithm
• Statistical analysis of edges and bredges in configuration model networks
• Two golden times in two-step contagion models
• Vulnerability and Resilience of Social Engagement: Equilibrium Theory
• Phase transition in evolving networks that combine preferential attachment and random node deletion
• K-core attack, equilibrium K-core, and kinetically constrained spin system
• Random growth lattice filling model of percolation: a crossover from continuous to discontinuous transition
• On the complexity of color-avoiding site and bond percolation
• Color-avoiding percolation in edge-colored Erdős-Rényi graphs
• The healing strategy by prioritizing minimum degree against localized attacks on interdependent spatially embedded networks