Abstract
Complex systems consisting of interdependent subsystems may be represented by multilayer networks with interdependency links between layers. The giant mutually connected component (GMCC) of such 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. Understanding the limits of the resilience of such systems to targeted attacks is therefore an essential problem. 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 existing noncomputationally intensive algorithm. We show that the intuition from single-layer networks that decycling (damage of the 2-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.
2 More- Received 14 February 2018
DOI:https://doi.org/10.1103/PhysRevE.98.032307
©2018 American Physical Society