Entrywise limit theorems for eigenvectors of signal-plus-noise matrix models with weak signals
From MaRDI portal
Publication:6178566
Abstract: We establish a finite-sample Berry-Esseen theorem for the entrywise limits of the eigenvectors for a broad collection of signal-plus-noise random matrix models under challenging weak signal regimes. The signal strength is characterized by a scaling factor through , where is the dimension of the random matrix, and we allow to grow at the rate of . The key technical contribution is a sharp finite-sample entrywise eigenvector perturbation bound. The existing error bounds on the two-to-infinity norms of the higher-order remainders are not sufficient when is proportional to . We apply the general entrywise eigenvector analysis results to the symmetric noisy matrix completion problem, random dot product graphs, and two subsequent inference tasks for random graphs: the estimation of pure nodes in mixed membership stochastic block models and the hypothesis testing of the equality of latent positions in random graphs.
Cites work
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 1168330 (Why is no real title available?)
- scientific article; zbMATH DE number 1964693 (Why is no real title available?)
- scientific article; zbMATH DE number 7415085 (Why is no real title available?)
- A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs
- A generalized solution of the orthogonal Procrustes problem
- A limit theorem for scaled eigenvectors of random dot product graphs
- A nonparametric two-sample hypothesis testing problem for random graphs
- A note on the orthogonal Procrustes problem and norm-dependent optimality
- Achieving optimal misclassification proportion in stochastic block models
- An \(\ell_{\infty}\) eigenvector perturbation bound and its application
- Asymptotic Statistics
- Asymptotic Theory of Eigenvectors for Random Matrices With Diverging Spikes
- Community detection and stochastic block models: recent developments
- Community structure in social and biological networks
- Compressed sensing
- Consistency of spectral clustering in stochastic block models
- Debiasing the Lasso: optimal sample size for Gaussian designs
- Efficient Estimation for Random Dot Product Graphs via a One-Step Procedure
- Efficient discovery of overlapping communities in massive networks
- Entrywise Estimation of Singular Vectors of Low-Rank Matrices With Heteroskedasticity and Dependence
- Entrywise eigenvector analysis of random matrices with low expected rank
- Estimating Mixed Memberships With Sharp Eigenvector Deviations
- Exact Recovery in the Stochastic Block Model
- Exact matrix completion via convex optimization
- Introduction to empirical processes and semiparametric inference
- Large sample covariance matrices and high-dimensional data analysis
- Limit theorems for eigenvectors of the normalized Laplacian for random graphs
- Low-rank matrix completion using alternating minimization
- Matrix completion from noisy entries
- Matrix estimation by universal singular value thresholding
- Minimax risk of matrix denoising by singular value thresholding
- Mixed membership stochastic blockmodels
- Near-optimal bounds for phase synchronization
- Network cross-validation by edge sampling
- Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
- On consistency and sparsity for principal components analysis in high dimensions
- On the Monotonicity, Log-Concavity, and Tight Bounds of the Generalized Marcum and Nuttall $Q$-Functions
- Optimal Bayesian estimation for random dot product graphs
- Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding
- Perturbation bounds in connection with singular value decomposition
- Random Dot Product Graph Models for Social Networks
- Random matrix theory in statistics: a review
- Rate-optimal perturbation bounds for singular subspaces with applications to high-dimensional statistics
- Reconstruction of a low-rank matrix in the presence of Gaussian noise
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- Role of normalization in spectral clustering for stochastic blockmodels
- Semidefinite programming based preconditioning for more robust near-separable nonnegative matrix factorization
- Signal-plus-noise matrix models: eigenvector deviations and fluctuations
- Simple: Statistical Inference on Membership Profiles in Large Networks
- Spectral analysis of large dimensional random matrices
- Spectral clustering and the high-dimensional stochastic blockmodel
- Statistical inference on random dot product graphs: a survey
- Tensor decompositions for learning latent variable models
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- The Rotation of Eigenvectors by a Perturbation. III
- The Sup-norm Perturbation of HOSVD and Low Rank Tensor Denoising
- The eigenvalues and eigenvectors of finite, low rank perturbations of large random matrices
- The two-to-infinity norm and singular subspace geometry with applications to high-dimensional statistics
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
- Universally consistent vertex classification for latent positions graphs
- Unperturbed: spectral analysis beyond Davis-Kahan
This page was built for publication: Entrywise limit theorems for eigenvectors of signal-plus-noise matrix models with weak signals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6178566)