Non-backtracking Spectrum of Random Graphs: Community Detection and Non-regular Ramanujan Graphs

A non-backtracking walk on a graph is a directed path such that no edge is the inverse of its preceding edge. The non-backtracking matrix of a graph is indexed by its directed edges and can be used to count on-backtracking walks of a given length. It has been used recently in the context of community detection and has appeared previously in connection with the Ihara zeta function and in some generalizations of Ramanujan graphs. In this work, we study the largest eigen valus of the non-backtracking matrix of the Erdos-Renyi random graph and of the Stochastic Block Model in the regime where the number of edges is proportional to the number of vertices. Our results confirm the "spectral redemption conjecture" that community detection can be made on the basis of the leading eigenvectors above the feasibility threshold.

[1]  H. Kesten,et al.  Additional Limit Theorems for Indecomposable Multidimensional Galton-Watson Processes , 1966 .

[2]  M. Murty.  Ramanujan Graphs , 1965 .

[3]  Louis H. Y. Chen,et al.  An Introduction to Stein's Method , 2005 .

[4]  Charles Bordenave,et al.  A new proof of Friedman's second eigenvalue theorem and its extension to random lifts , 2015, Annales scientifiques de l'École normale supérieure.

[5]  Noga Alon,et al.  On the second eigenvalue of a graph , 1991, Discret. Math..

[6]  Elchanan Mossel,et al.  Reconstruction and estimation in the planted partition model , 2012, Probability Theory and Related Fields.

[7]  F. Chung.  Diameters and eigenvalues , 1989 .

[8]  Joel Friedman,et al.  The Relativized Second Eigenvalue Conjecture of Alon , 2014, ArXiv.

[9]  R. Bhatia.  Matrix Analysis , 1996 .

[10]  Joel Friedman,et al.  A proof of Alon's second eigenvalue conjecture and related problems , 2004, ArXiv.

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

[12]  H. Kesten,et al.  A Limit Theorem for Multidimensional Galton-Watson Processes , 1966 .

[13]  Charles R. Johnson,et al.  Topics in Matrix Analysis , 1991 .

[14]  N. Linial,et al.  Expander Graphs and their Applications , 2006 .

[15]  János Komlós,et al.  The eigenvalues of random symmetric matrices , 1981, Comb..

[16]  J. Friedman,et al.  THE NON-BACKTRACKING SPECTRUM OF THE UNIVERSAL COVER OF A GRAPH , 2007, 0712.0192.

[17]  Audry Terras.  What are zeta functions of graphs and what are they good for ? , 2005 .

[18]  T. Sunada,et al.  Zeta Functions of Finite Graphs , 2000 .

[19]  Laurent Massoulié,et al.  Community detection thresholds and the weak Ramanujan property , 2013, STOC.

[20]  Cristopher Moore,et al.  Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[21]  I. Benjamini,et al.  Recurrence of Distributional Limits of Finite Planar Graphs , 2000, math/0011019.

[22]  Alexander Lubotzky,et al.  Cayley graphs: eigenvalues, expanders and random walks , 1995 .

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

[24]  Kathryn B. Laskey,et al.  Stochastic blockmodels: First steps , 1983 .

[25]  Béla Bollobás,et al.  The phase transition in inhomogeneous random graphs , 2007, Random Struct. Algorithms.