Entrywise limit theorems for eigenvectors of signal-plus-noise matrix models with weak signals
From MaRDI portal
Publication:6178566
DOI10.3150/23-bej1602arXiv2106.09840OpenAlexW4388513805MaRDI QIDQ6178566
Publication date: 16 January 2024
Published in: Bernoulli (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.09840
Berry-Esseen theorementrywise eigenvector analysisrandom dot product graphssignal-plus-noise matrix modelsymmetric noisy matrix completion
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A nonparametric two-sample hypothesis testing problem for random graphs
- Network cross-validation by edge sampling
- A limit theorem for scaled eigenvectors of random dot product graphs
- Universally consistent vertex classification for latent positions graphs
- Reconstruction of a low-rank matrix in the presence of Gaussian noise
- Minimax risk of matrix denoising by singular value thresholding
- Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding
- The eigenvalues and eigenvectors of finite, low rank perturbations of large random matrices
- Spectral clustering and the high-dimensional stochastic blockmodel
- Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
- Spectral analysis of large dimensional random matrices
- Rate-optimal perturbation bounds for singular subspaces with applications to high-dimensional statistics
- Limit theorems for eigenvectors of the normalized Laplacian for random graphs
- Debiasing the Lasso: optimal sample size for Gaussian designs
- Entrywise eigenvector analysis of random matrices with low expected rank
- The two-to-infinity norm and singular subspace geometry with applications to high-dimensional statistics
- Matrix estimation by universal singular value thresholding
- Consistency of spectral clustering in stochastic block models
- Role of normalization in spectral clustering for stochastic blockmodels
- Random matrix theory in statistics: a review
- Introduction to empirical processes and semiparametric inference
- A generalized solution of the orthogonal Procrustes problem
- Exact matrix completion via convex optimization
- Tensor decompositions for learning latent variable models
- Exact Recovery in the Stochastic Block Model
- Mixed membership stochastic blockmodels
- Asymptotic Statistics
- Community structure in social and biological networks
- Community Detection and Stochastic Block Models
- An $\ell_{\infty}$ Eigenvector Perturbation Bound and Its Application to Robust Covariance Estimation
- Statistical inference on random dot product graphs: a survey
- Near-Optimal Bounds for Phase Synchronization
- A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs
- Entrywise Estimation of Singular Vectors of Low-Rank Matrices With Heteroskedasticity and Dependence
- Optimal Bayesian estimation for random dot product graphs
- Efficient discovery of overlapping communities in massive networks
- Large Sample Covariance Matrices and High-Dimensional Data Analysis
- On Consistency and Sparsity for Principal Components Analysis in High Dimensions
- Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
- Recovering Low-Rank Matrices From Few Coefficients in Any Basis
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- On the Monotonicity, Log-Concavity, and Tight Bounds of the Generalized Marcum and Nuttall $Q$-Functions
- Achieving Optimal Misclassification Proportion in Stochastic Block Model
- The Sup-norm Perturbation of HOSVD and Low Rank Tensor Denoising
- Random Dot Product Graph Models for Social Networks
- Low-rank matrix completion using alternating minimization
- The Rotation of Eigenvectors by a Perturbation. III
- Perturbation bounds in connection with singular value decomposition
- Signal-plus-noise matrix models: eigenvector deviations and fluctuations
- Simple: Statistical Inference on Membership Profiles in Large Networks
- Estimating Mixed Memberships With Sharp Eigenvector Deviations
- Asymptotic Theory of Eigenvectors for Random Matrices With Diverging Spikes
- Compressed sensing
- Efficient Estimation for Random Dot Product Graphs via a One-Step Procedure
This page was built for publication: Entrywise limit theorems for eigenvectors of signal-plus-noise matrix models with weak signals
