Nonbacktracking expansion of finite graphs.

Message passing equations yield a sharp percolation transition in finite graphs, as an artifact of the locally treelike approximation. For an arbitrary finite, connected, undirected graph we construct an infinite tree having the same local structural properties as this finite graph, when observed by a nonbacktracking walker. Formally excluding the boundary, this infinite tree is a generalization of the Bethe lattice. We indicate an infinite, locally treelike, random network whose local structure is exactly given by this infinite tree. Message passing equations for various cooperative models on this construction are the same as for the original finite graph, but here they provide the exact solutions of the corresponding cooperative problems. These solutions are good approximations to observables for the models on the original graph when it is sufficiently large and not strongly correlated. We show how to express these solutions in the critical region in terms of the principal eigenvector components of the nonbacktracking matrix. As representative examples we formulate the problems of the random and optimal destruction of a connected graph in terms of our construction, the nonbacktracking expansion. We analyze the limitations and the accuracy of the message passing algorithms for different classes of networks and compare the complexity of the message passing calculations to that of direct numerical simulations. Notably, in a range of important cases, simulations turn out to be more efficient computationally than the message passing.

[1]  Jure Leskovec,et al.  Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters , 2008, Internet Math..

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

[3]  William T. Freeman,et al.  On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs , 2001, IEEE Trans. Inf. Theory.

[4]  Béla Bollobás,et al.  A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..

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

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

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

[8]  M. .. Moore.  Exactly Solved Models in Statistical Mechanics , 1983 .

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

[10]  S N Dorogovtsev,et al.  Percolation on correlated networks. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[12]  Kathleen E. Hamilton,et al.  Tight lower bound for percolation threshold on an infinite graph. , 2014, Physical review letters.

[13]  Edward A. Bender,et al.  The Asymptotic Number of Labeled Graphs with Given Degree Sequences , 1978, J. Comb. Theory A.

[14]  Filippo Radicchi,et al.  Percolation in real interdependent networks , 2015, Nature Physics.

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

[16]  S. N. Dorogovtsev,et al.  Multiple percolation transitions in a configuration model of a network of networks. , 2014, Physical review. E, Statistical, nonlinear, and soft matter physics.

[17]  Travis A. Jarrell,et al.  The Connectome of a Decision-Making Neural Network , 2012, Science.

[18]  Satu Elisa Schaeffer,et al.  Graph Clustering , 2017, Encyclopedia of Machine Learning and Data Mining.

[19]  Filippo Radicchi,et al.  Beyond the locally treelike approximation for percolation on real networks. , 2016, Physical review. E.

[20]  Sergey N. Dorogovtsev,et al.  Localization and Spreading of Diseases in Complex Networks , 2012, Physical review letters.

[21]  Florent Krzakala,et al.  Spectral Clustering of graphs with the Bethe Hessian , 2014, NIPS.

[22]  Filippo Radicchi,et al.  Redundant Interdependencies Boost the Robustness of Multiplex Networks , 2016, 1610.05378.

[23]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[24]  Z. Wang,et al.  The structure and dynamics of multilayer networks , 2014, Physics Reports.

[25]  Xiao Zhang,et al.  Localization and centrality in networks , 2014, Physical review. E, Statistical, nonlinear, and soft matter physics.

[26]  Ginestra Bianconi,et al.  Correlated edge overlaps in multiplex networks. , 2016, Physical review. E.

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

[28]  K. Hashimoto.  Zeta functions of finite graphs and representations of p-adic groups , 1989 .

[29]  M. Lewin.  On nonnegative matrices , 1971 .

[30]  Mason A. Porter,et al.  Multilayer networks , 2013, J. Complex Networks.

[31]  Sanming Zhou,et al.  Decycling numbers of random regular graphs , 2002, Random Struct. Algorithms.

[32]  Elchanan Mossel,et al.  Spectral redemption in clustering sparse networks , 2013, Proceedings of the National Academy of Sciences.

[33]  Sergey N. Dorogovtsev,et al.  Belief-propagation algorithm and the Ising model on networks with arbitrary distributions of motifs , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[34]  Konstantin Avrachenkov,et al.  Cooperative Game Theory Approaches for Network Partitioning , 2017, COCOON.

[35]  Charu C. Aggarwal,et al.  Graph Clustering , 2010, Encyclopedia of Machine Learning and Data Mining.

[36]  Jure Leskovec,et al.  Defining and Evaluating Network Communities Based on Ground-Truth , 2012, ICDM.

[37]  M. Newman,et al.  Random graphs with arbitrary degree distributions and their applications. , 2000, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[39]  Ian T. Foster,et al.  Mapping the Gnutella Network , 2002, IEEE Internet Comput..

[40]  Sergey Melnik,et al.  Emergence of coexisting percolating clusters in networks. , 2015, Physical review. E.

[41]  S. N. Dorogovtsev,et al.  Metric structure of random networks , 2002, cond-mat/0210085.