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

Abstract : A non-backtracking walk on a graph is a directed path such that no edge is the inverse of its preceding edge. The nonbacktracking 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 Erdos-R ˝ enyi 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.
Type de document :
Communication dans un congrès
2015 IEEE 56th Annual Symposium on Foundations of Computer Science, Oct 2015, Berkeley, United States. 2015 IEEE 56th Annual Symposium on Foundations of Computer Science. 〈10.1109/FOCS.2015.86〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01226796
Contributeur : Laurent Massoulié <>
Soumis le : mardi 10 novembre 2015 - 10:51:58
Dernière modification le : vendredi 16 novembre 2018 - 02:02:55

Lien texte intégral

Identifiants

Citation

Charles Bordenave, Marc Lelarge, Laurent Massoulié. Non-backtracking spectrum of random graphs: community detection and non-regular Ramanujan graphs. 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, Oct 2015, Berkeley, United States. 2015 IEEE 56th Annual Symposium on Foundations of Computer Science. 〈10.1109/FOCS.2015.86〉. 〈hal-01226796〉

Partager

Métriques

Consultations de la notice

553