A Spectral Method for Joint Community Detection and Orthogonal Group Synchronization
From MaRDI portal
Publication:6166053
DOI10.1137/21m1467845zbMath1522.90078arXiv2112.13199MaRDI QIDQ6166053
Yifeng Fan, Yuehaw Khoo, Zhizhen Zhao
Publication date: 6 July 2023
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.13199
Random matrices (probabilistic aspects) (60B20) Semidefinite programming (90C22) Statistical aspects of big data and data science (62R07)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Clustering by Passing Messages Between Data Points
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Reconstruction and estimation in the planted partition model
- Angular synchronization by eigenvectors and semidefinite programming
- Community detection in sparse networks via Grothendieck's inequality
- A fast randomized algorithm for the approximation of matrices
- The dimension-free structure of nonhomogeneous random matrices
- SCDM-k: localized orbitals for solids via selected columns of the density matrix
- A proof of the block model threshold conjecture
- On semidefinite relaxations for the block model
- Random Laplacian matrices and convex relaxations
- Near-optimal performance bounds for orthogonal and permutation group synchronization via spectral methods
- Entrywise eigenvector analysis of random matrices with low expected rank
- A representation theory perspective on simultaneous alignment and classification
- Spectral method and regularized MLE are both optimal for top-\(K\) ranking
- Handbook series linear algebra. Linear least squares solutions by Householder transformations
- A Krylov--Schur Algorithm for Large Eigenproblems
- Spectral redemption in clustering sparse networks
- Achieving Exact Cluster Recovery Threshold via Semidefinite Programming: Extensions
- Achieving Exact Cluster Recovery Threshold via Semidefinite Programming
- Exact Recovery in the Stochastic Block Model
- Viewing Angle Classification of Cryo-Electron Microscopy Images Using Eigenvectors
- The solution of some random NP-hard problems in polynomial expected time
- Representation theoretic patterns in multi-frequency class averaging for three-dimensional cryo-electron microscopy
- An Introduction to Random Matrices
- An $\ell_{\infty}$ Eigenvector Perturbation Bound and Its Application to Robust Covariance Estimation
- Computing Localized Representations of the Kohn--Sham Subspace Via Randomization and Refinement
- A Simple SVD Algorithm for Finding Hidden Partitions
- Near-Optimal Bounds for Phase Synchronization
- High-Dimensional Probability
- Least squares quantization in PCM
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Joint Community Detection and Rotational Synchronization via Semidefinite Programming
- Uniform Bounds for Invariant Subspace Perturbations
- Simple, direct and efficient multi-way spectral clustering
- Global Registration of Multiple Point Clouds Using Semidefinite Programming
- Community detection thresholds and the weak Ramanujan property
- Spectral Synchronization of Multiple Views in SE(3)
- Indirect Blockmodeling of 3-Way Networks
- Spectral techniques applied to sparse random graphs
- Achieving Optimal Misclassification Proportion in Stochastic Block Model
- An Introduction to Matrix Concentration Inequalities
- The Rotation of Eigenvectors by a Perturbation. III
- Unitary Triangularization of a Nonsymmetric Matrix
- Some Metric Inequalities in the Space of Matrices
- Optimal orthogonal group synchronization and rotation group synchronization