Targeted Damage to Interdependent Networks
arXiv:1802.03992 · doi:10.1103/PhysRevE.98.032307
Abstract
The giant mutually connected component (GMCC) of an interdependent or multiplex network collapses with a discontinuous hybrid transition under random damage to the network. If the nodes to be damaged are selected in a targeted way, the collapse of the GMCC may occur significantly sooner. Finding the minimal damage set which destroys the largest mutually connected component of a given interdependent network is a computationally prohibitive simultaneous optimization problem. We introduce a simple heuristic strategy -- Effective Multiplex Degree -- for targeted attack on interdependent networks that leverages the indirect damage inherent in multiplex networks to achieve a damage set smaller than that found by any other non computationally intensive algorithm. We show that the intuition from single layer networks that decycling (damage of the -core) is the most effective way to destroy the giant component, does not carry over to interdependent networks, and in fact such approaches are worse than simply removing the highest degree nodes.
arXiv comment9 pages, 9 figures
References in corpus (18)
- Catastrophic cascade of failures in interdependent networks
- Influence maximization in complex networks through optimal percolation
- Multirelational Organization of Large-scale Social Networks in an Online World
- Interdependent networks: Reducing the coupling strength leads to a change from a first to second order percolation transition
- Random Walks on Multiplex Networks
- Robustness of interdependent networks under targeted attack
- Avalanche Collapse of Interdependent Network
- The critical effect of dependency groups on the function of networks
- Network dismantling
- Percolation Theory on Interdependent Networks Based on Epidemic Spreading
- Fast and simple decycling and dismantling of networks
- Percolation of partially interdependent networks under targeted attack
- Random walk centrality in interconnected multilayer networks
- Optimal percolation on multiplex networks
- Heterogeneous-k-core versus Bootstrap Percolation on Complex Networks
- Functional Multiplex PageRank
- Optimizing spread dynamics on graphs by message passing
- Critical dynamics of the k-core pruning process
Cited by in corpus (8)
- Cascading Failures in Complex Networks
- Controlling the uncertain response of real multiplex networks to random damage
- Multiplex networks quantify robustness of the mental lexicon to catastrophic concept failures, aphasic degradation and ageing
- Asymmetry in interdependence makes a multilayer system more robust against cascading failures
- Optimal percolation in correlated multilayer networks with overlap
- k-core structure of real multiplex networks
- Deep-learning-aided dismantling of interdependent networks
- Deep Learning Super-Diffusion in Multiplex Networks