Non-backtracking spectra of weighted inhomogeneous random graphs

Abstract

We study a model of random graphs where each edge is drawn independently (but not necessarily identically distributed) from the others, and then assigned a random weight. When the mean degree of such a graph is low, it is known that the spectrum of the adjacency matrix $A$ deviates significantly from that of its expected value $\mathbb{E}A$.

In contrast, we show that over a wide range of parameters the top eigenvalues of the non-backtracking matrix $B$ – a matrix whose powers count the non-backtracking walks between two edges – are close to those of $\mathbb{E}A$, and all other eigenvalues are confined in a bulk with known radius. We also obtain a precise characterization of the scalar product between the eigenvectors of $B$ and their deterministic counterparts derived from the model parameters.

This result has many applications, in domains ranging from (noisy) matrix completion to community detection, as well as matrix perturbation theory. In particular, we establish as a corollary that a result known as the Baik–Ben Arous–Péché phase transition, previously established only for rotationally invariant random matrices, holds more generally for matrices $A$ as above under a mild concentration hypothesis.