Targeted Damage to Interdependent Networks

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 $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.

[1]  Guilhem Semerjian,et al.  Network dismantling , 2016, Proceedings of the National Academy of Sciences.

[2]  Peter Grassberger,et al.  Percolation theory on interdependent networks based on epidemic spreading , 2011, 1109.4447.

[3]  Hernán A. Makse,et al.  Collective Influence Algorithm to find influencers via optimal percolation in massively large social media , 2016, Scientific Reports.

[4]  Filippo Radicchi,et al.  Optimal percolation on multiplex networks , 2017, Nature Communications.

[5]  Michael Szell,et al.  Multirelational organization of large-scale social networks in an online world , 2010, Proceedings of the National Academy of Sciences.

[6]  Hernán A. Makse,et al.  Influence maximization in complex networks through optimal percolation , 2015, Nature.

[7]  Riccardo Zecchina,et al.  Optimizing spread dynamics on graphs by message passing , 2012, 1203.1426.

[8]  Alexandre Arenas,et al.  Functional Multiplex PageRank , 2016, ArXiv.

[9]  Sergey V. Buldyrev,et al.  Critical effect of dependency groups on the function of networks , 2010, Proceedings of the National Academy of Sciences.

[10]  W. Marsden.  I and J , 2012 .

[11]  Albert Solé-Ribalta,et al.  Navigability of interconnected networks under random failures , 2013, Proceedings of the National Academy of Sciences.

[12]  Sergio Gómez,et al.  Random walk centrality in interconnected multilayer networks , 2015, ArXiv.

[13]  S N Dorogovtsev,et al.  Heterogeneous k-core versus bootstrap percolation on complex networks. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  James P. Peerenboom,et al.  Identifying, understanding, and analyzing critical infrastructure interdependencies , 2001 .

[15]  J. F. F. Mendes,et al.  Critical Dynamics of thek-Core Pruning Process , 2015, 1505.05484.

[16]  S. Havlin,et al.  Interdependent networks: reducing the coupling strength leads to a change from a first to second order percolation transition. , 2010, Physical review letters.

[17]  Harry Eugene Stanley,et al.  Robustness of interdependent networks under targeted attack , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  Harry Eugene Stanley,et al.  Catastrophic cascade of failures in interdependent networks , 2009, Nature.

[19]  S. N. Dorogovtsev,et al.  Avalanche collapse of interdependent networks. , 2012, Physical review letters.

[20]  József Balogh,et al.  Bootstrap percolation on the random regular graph , 2007, Random Struct. Algorithms.

[21]  L. Tian,et al.  Percolation of partially interdependent networks under targeted attack. , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[22]  Michael J. O. Pocock,et al.  The Robustness and Restoration of a Network of Ecological Networks , 2012, Science.

[23]  Joel H. Spencer,et al.  Sudden Emergence of a Giantk-Core in a Random Graph , 1996, J. Comb. Theory, Ser. B.

[24]  Lenka Zdeborová,et al.  Fast and simple decycling and dismantling of networks , 2016, Scientific Reports.