Entrywise eigenvector analysis of random matrices with low expected rank

Recovering low-rank structures via eigenvector perturbation analysis is a common problem in statistical machine learning, such as in factor analysis, community detection, ranking, matrix completion, among others. While a large variety of bounds are available for average errors between empirical and population statistics of eigenvectors, few results are tight for entrywise analyses, which are critical for a number of problems such as community detection. This paper investigates entrywise behaviors of eigenvectors for a large class of random matrices whose expectations are low rank, which helps settle the conjecture in Abbe, Bandeira and Hall (2014) that the spectral algorithm achieves exact recovery in the stochastic block model without any trimming or cleaning steps. The key is a first-order approximation of eigenvectors under the .. norm: uk.Au.k..k, where {uk} and {u.k} are eigenvectors of a random matrix A and its expectation EA, respectively. The fact that the approximation is both tight and linear in A facilitates sharp comparisons between uk and u.k. In particular, it allows for comparing the signs of uk and u.k even if .uk.u.k.. is large. The results are further extended to perturbations of eigenspaces, yielding new ..-type bounds for synchronization (Z2-spiked Wigner model) and noisy matrix completion.