Community detection thresholds and the weak Ramanujan property

Decelle et al.citeDecelle11 conjectured the existence of a sharp threshold for community detection in sparse random graphs drawn from the stochastic block model. Mossel et al.citeMossel12 established the negative part of the conjecture, proving impossibility of meaningful detection below the threshold. However the positive part of the conjecture remained elusive so far. Here we solve the positive part of the conjecture. We introduce a modified adjacency matrix B that counts self-avoiding paths of a given length ℓ between pairs of nodes and prove that for logarithmic ℓ, the leading eigenvectors of this modified matrix provide non-trivial detection, thereby settling the conjecture. A key step in the proof consists in establishing a em weak Ramanujan property of matrix B. Namely, the spectrum of B consists in two leading eigenvalues ρ(B), λ2 and n-2 eigenvalues of a lower order O(nε√ρ(B)) for all ε>0, ρ(B) denoting B's spectral radius. d-regular graphs are Ramanujan when their second eigenvalue verifies |λ|≤ 2 √d-1. Random d-regular graphs have a second largest eigenvalue λ of 2√d-1+o(1) (see Friedmancitefriedman08), thus being em almost Ramanujan. ErdHos-R'enyi graphs with average degree d at least logarithmic (d=Omega(log n)) have a second eigenvalue of O(√d) (see Feige and OfekciteFeige05), a slightly weaker version of the Ramanujan property. However this spectrum separation property fails for sparse (d=O(1)) ErdHos-R'enyi graphs. Our result thus shows that by constructing matrix B through neighborhood expansion, we regularize the original adjacency matrix to eventually recover a weak form of the Ramanujan property.