Emergence of coexisting percolating clusters in networks.

It is commonly assumed in percolation theories that at most one percolating cluster can exist in a network. We show that several coexisting percolating clusters (CPCs) can emerge in networks due to limited mixing, i.e., a finite and sufficiently small number of interlinks between network modules. We develop an approach called modular message passing (MMP) to describe and verify these observations. We demonstrate that the appearance of CPCs is an important source of inaccuracy in previously introduced percolation theories, such as the message passing (MP) approach, which is a state-of-the-art theory based on the belief propagation method. Moreover, we show that the MMP theory improves significantly over the predictions of MP for percolation on synthetic networks with limited mixing and also on several real-world networks. These findings have important implications for understanding the robustness of networks and in quantifying epidemic outbreaks in the susceptible-infected-recovered (SIR) model of disease spread.

[1]  F. Rao,et al.  The protein folding network. , 2004, Journal of molecular biology.

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

[3]  Jure Leskovec,et al.  Learning to Discover Social Circles in Ego Networks , 2012, NIPS.

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

[5]  P. Ronhovde,et al.  Multiresolution community detection for megascale networks by information-based replica correlations. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[6]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[7]  Paul Hines,et al.  A “Random Chemistry” Algorithm for Identifying Collections of Multiple Contingencies That Initiate Cascading Failure , 2012, IEEE Transactions on Power Systems.

[8]  D S Callaway,et al.  Network robustness and fragility: percolation on random graphs. , 2000, Physical review letters.

[9]  R D Zimmerman,et al.  MATPOWER: Steady-State Operations, Planning, and Analysis Tools for Power Systems Research and Education , 2011, IEEE Transactions on Power Systems.

[10]  Mason A. Porter,et al.  Dynamics on Modular Networks with Heterogeneous Correlations , 2012, Chaos.

[11]  James P. Gleeson,et al.  Network cloning unfolds the effect of clustering on dynamical processes , 2015, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  M. A. Muñoz,et al.  Griffiths phases on complex networks. , 2010, Physical review letters.

[13]  Brian Karrer,et al.  Message passing approach for general epidemic models. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  Martin Rosvall,et al.  Maps of random walks on complex networks reveal community structure , 2007, Proceedings of the National Academy of Sciences.

[15]  Ali Faqeeh,et al.  Community detection based on "clumpiness" matrix in complex networks , 2011, ArXiv.

[16]  S. Redner,et al.  Introduction To Percolation Theory , 2018 .

[17]  F. Radicchi,et al.  Benchmark graphs for testing community detection algorithms. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  P. Mucha,et al.  The unreasonable effectiveness of tree-based theory for networks with clustering. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[20]  M. Newman.  Spread of epidemic disease on networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[21]  Filippo Radicchi,et al.  Breaking of the site-bond percolation universality in networks , 2015, Nature Communications.

[22]  Pol Colomer-de-Simon,et al.  Double percolation phase transition in clustered complex networks , 2014, ArXiv.

[23]  Sergey Melnik,et al.  Accuracy of mean-field theory for dynamics on real-world networks. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[24]  B. Kahng,et al.  Recent advances and open challenges in percolation , 2014, 1404.5325.

[25]  Lenka Zdeborová,et al.  Percolation on sparse networks , 2014, Physical review letters.

[26]  P. Alstrøm,et al.  COMPLEXITY AND CRITICALITY , 2004 .

[27]  Marko Bajec,et al.  Robust network community detection using balanced propagation , 2011, ArXiv.

[28]  Pol Colomer-de-Simon,et al.  Deciphering the global organization of clustering in real complex networks , 2013, Scientific Reports.

[29]  Y. Moreno,et al.  Resilience to damage of graphs with degree correlations. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[30]  Edward Ott,et al.  Dynamical instability in Boolean networks as a percolation problem. , 2012, Physical review letters.

[31]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[32]  Abbas Ali Saberi,et al.  Recent advances in percolation theory and its applications , 2015, 1504.02898.

[33]  S. Shen-Orr,et al.  Superfamilies of Evolved and Designed Networks , 2004, Science.

[34]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.