Non-backtracking spectrum of random graphs: community detection and non-regular Ramanujan graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Annals of Probability Année : 2014

Non-backtracking spectrum of random graphs: community detection and non-regular Ramanujan graphs

Résumé

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 non-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 eigenvalues of the non-backtracking matrix of the Erd}os-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 con rm the "spectral redemption conjecture" that community detection can be made on the basis of the leading eigenvectors above the feasibility threshold.
Fichier non déposé

Dates et versions

hal-01137952 , version 1 (31-03-2015)

Identifiants

  • HAL Id : hal-01137952 , version 1

Citer

Charles Bordenave, Marc Lelarge, Laurent Massoulié. Non-backtracking spectrum of random graphs: community detection and non-regular Ramanujan graphs. Annals of Probability, 2014, pp.abs/1501.06087. ⟨hal-01137952⟩
642 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More