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…