Algorithm to determine the percolation largest component in interconnected networks.

Interconnected networks have been shown to be much more vulnerable to random and targeted failures than isolated ones, raising several interesting questions regarding the identification and mitigation of their risk. The paradigm to address these questions is the percolation model, where the resilience of the system is quantified by the dependence of the size of the largest cluster on the number of failures. Numerically, the major challenge is the identification of this cluster and the calculation of its size. Here, we propose an efficient algorithm to tackle this problem. We show that the algorithm scales as O(NlogN), where N is the number of nodes in the network, a significant improvement compared to O(N(2)) for a greedy algorithm, which permits studying much larger networks. Our new strategy can be applied to any network topology and distribution of interdependencies, as well as any sequence of failures.

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

[2]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[3]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[4]  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.

[5]  M. Newman,et al.  Efficient Monte Carlo algorithm and high-precision results for percolation. , 2000, Physical review letters.

[6]  R. Rosenfeld.  Nature , 2009, Otolaryngology--head and neck surgery : official journal of American Academy of Otolaryngology-Head and Neck Surgery.

[7]  Sergey N. Dorogovtsev,et al.  Evolution of Networks: From Biological Nets to the Internet and WWW (Physics) , 2003 .

[8]  Marc Barthelemy,et al.  Spatial Networks , 2010, Encyclopedia of Social Network Analysis and Mining.

[9]  Albert-László Barabási,et al.  Evolution of Networks: From Biological Nets to the Internet and WWW , 2004 .

[10]  P. Gács,et al.  Algorithms , 1992 .

[11]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[12]  Jie Wu,et al.  Small Worlds: The Dynamics of Networks between Order and Randomness , 2003 .

[13]  Harry Eugene Stanley,et al.  Robustness of a Network of Networks , 2010, Physical review letters.

[14]  Hans J. Herrmann,et al.  Inverse targeting —An effective immunization strategy , 2011, ArXiv.

[15]  E A Leicht,et al.  Suppressing cascades of load in interdependent networks , 2011, Proceedings of the National Academy of Sciences.

[16]  Guido Caldarelli,et al.  Scale-Free Networks , 2007 .

[17]  Shlomo Havlin,et al.  Suppressing epidemics with a limited amount of immunization units. , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  S. Havlin,et al.  Scale-free networks are ultrasmall. , 2002, Physical review letters.

[19]  Alessandro Vespignani,et al.  Complex networks: The fragility of interdependency , 2010, Nature.

[20]  Hans J. Herrmann,et al.  Mitigation of malicious attacks on networks , 2011, Proceedings of the National Academy of Sciences.

[21]  H. Stanley,et al.  Networks formed from interdependent networks , 2011, Nature Physics.

[22]  Beom Jun Kim,et al.  Attack vulnerability of complex networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[23]  D. Watts,et al.  Small Worlds: The Dynamics of Networks between Order and Randomness , 2001 .

[24]  Wei Li,et al.  Cascading Failures in Interdependent Lattice Networks: The Critical Role of the Length of Dependency Links , 2012, Physical review letters.

[25]  Peter Grassberger,et al.  Percolation transitions are not always sharpened by making networks interdependent. , 2011, Physical review letters.

[26]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

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

[28]  Bruce A. Reed,et al.  A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.

[29]  Da-Ren He,et al.  Interconnecting bilayer networks , 2011, ArXiv.

[30]  Alessandro Vespignani,et al.  Dynamical Processes on Complex Networks , 2008 .

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

[32]  M. Newman,et al.  Fast Monte Carlo algorithm for site or bond percolation. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.