Uniform Bounds for Invariant Subspace Perturbations
From MaRDI portal
Cites work
- An \(\ell_{\infty}\) eigenvector perturbation bound and its application
- Angular synchronization by eigenvectors and semidefinite programming
- Community detection and stochastic block models: recent developments
- Computing localized representations of the Kohn-Sham subspace via randomization and refinement
- Consistency of spectral clustering
- Consistency of spectral clustering in stochastic block models
- Entrywise eigenvector analysis of random matrices with low expected rank
- Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems
- Exact matrix completion via convex optimization
- Finite sample approximation results for principal component analysis: A matrix perturbation approach
- High-dimensional probability. An introduction with applications in data science
- scientific article; zbMATH DE number 3760758 (Why is no real title available?)
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Matrix completion from noisy entries
- On a perturbation bound for invariant subspaces of matrices
- Optimality and sub-optimality of PCA. I: Spiked random matrix models
- Perturbation bounds in connection with singular value decomposition
- Simple, direct and efficient multi-way spectral clustering
- Sparse PCA: optimal rates and adaptive estimation
- Spectral clustering and the high-dimensional stochastic blockmodel
- Statistical inference on random dot product graphs: a survey
- The Rotation of Eigenvectors by a Perturbation. III
- The two-to-infinity norm and singular subspace geometry with applications to high-dimensional statistics
- Unperturbed: spectral analysis beyond Davis-Kahan
Cited in
(12)- Spectral clustering revisited: information hidden in the Fiedler vector
- An \({\ell_p}\) theory of PCA and spectral clustering
- On some bounds on the perturbation of invariant subspaces of normal matrices with application to a graph connection problem
- Generalized bounds for active subspaces
- A performance guarantee for spectral clustering
- Communication-Efficient Distributed Eigenspace Estimation
- A Spectral Method for Joint Community Detection and Orthogonal Group Synchronization
- Uniform bounds for invariant subspace perturbations
- Strong consistency guarantees for clustering high-dimensional bipartite graphs with the spectral method
- Structure-aware analyses and algorithms for interpolative decompositions
- Detection and estimation of vertexwise latent position shifts across networks
- Multivariate Analysis for Multiple Network Data via Semi-Symmetric Tensor PCA
This page was built for publication: Uniform Bounds for Invariant Subspace Perturbations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146696)
