Uniform Bounds for Invariant Subspace Perturbations
From MaRDI portal
Publication:5146696
DOI10.1137/19M1262760MaRDI QIDQ5146696
Publication date: 26 January 2021
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.07865
Related Items (6)
On some bounds on the perturbation of invariant subspaces of normal matrices with application to a graph connection problem ⋮ A Spectral Method for Joint Community Detection and Orthogonal Group Synchronization ⋮ Communication-Efficient Distributed Eigenspace Estimation ⋮ Spectral clustering revisited: information hidden in the Fiedler vector ⋮ A Performance Guarantee for Spectral Clustering ⋮ An \({\ell_p}\) theory of PCA and spectral clustering
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Angular synchronization by eigenvectors and semidefinite programming
- Spectral clustering and the high-dimensional stochastic blockmodel
- Finite sample approximation results for principal component analysis: A matrix perturbation approach
- Optimality and sub-optimality of PCA. I: Spiked random matrix models
- 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
- Consistency of spectral clustering in stochastic block models
- Consistency of spectral clustering
- Sparse PCA: optimal rates and adaptive estimation
- Exact matrix completion via convex optimization
- On a Perturbation Bound for Invariant Subspaces of Matrices
- Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems
- 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
- Computing Localized Representations of the Kohn--Sham Subspace Via Randomization and Refinement
- High-Dimensional Probability
- Simple, direct and efficient multi-way spectral clustering
- The Rotation of Eigenvectors by a Perturbation. III
- Perturbation bounds in connection with singular value decomposition
This page was built for publication: Uniform Bounds for Invariant Subspace Perturbations
