Randomized Spectral Clustering in Large-Scale Stochastic Block Models
From MaRDI portal
Publication:5057098
DOI10.1080/10618600.2022.2034636OpenAlexW3003916954MaRDI QIDQ5057098
Xiao Guo, Hai Zhang, Xiang Yu Chang
Publication date: 15 December 2022
Published in: Journal of Computational and Graphical Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.00839
Related Items
Rclust, Subsampling spectral clustering for stochastic block models in large-scale networks, On the efficacy of higher-order spectral clustering under weighted stochastic block models
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- CUR matrix decompositions for improved data analysis
- Network cross-validation by edge sampling
- Rate-optimal graphon estimation
- Impact of regularization on spectral clustering
- Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding
- Coauthorship and citation networks for statisticians
- Faster least squares approximation
- Spectral clustering and the high-dimensional stochastic blockmodel
- Statistical analysis of network data. Methods and models
- An implicit restarted Lanczos method for large symmetric eigenvalue problems
- On approximate geometric \(k\)-clustering
- Overlapping community detection in networks via sparse spectral decomposition
- Asymptotically efficient estimators for stochastic blockmodels: the naive MLE, the rank-constrained MLE, and the spectral estimator
- Spectral and matrix factorization methods for consistent community detection in multi-layer networks
- Entrywise eigenvector analysis of random matrices with low expected rank
- Randomized algorithms of maximum likelihood estimation with spatial autoregressive models for large-scale networks
- Consistency of spectral clustering in stochastic block models
- Randomized algorithms for low-rank matrix factorizations: sharp performance bounds
- Role of normalization in spectral clustering for stochastic blockmodels
- Iterative Hessian sketch: Fast and accurate solution approximation for constrained least-squares
- Stochastic blockmodels with a growing number of classes
- Strong Consistency of ReducedK-means Clustering
- Newton Sketch: A Near Linear-Time Optimization Algorithm with Linear-Quadratic Convergence
- Randomized Algorithms for Matrices and Data
- Low-Rank Approximation and Regression in Input Sparsity Time
- Approximating Spectral Clustering via Sampling: A Review
- Fast computation of low-rank matrix approximations
- Sampling algorithms for l2 regression and applications
- Community Detection and Stochastic Block Models
- Networks
- Practical Sketching Algorithms for Low-Rank Matrix Approximation
- Optimal Subsampling for Large Sample Logistic Regression
- Simultaneous Dimensionality and Complexity Model Selection for Spectral Graph Clustering
- Discussion of ‘Network cross-validation by edge sampling’
- Randomized methods for matrix computations
- A Survey of Statistical Network Models
- Strong Consistency of Spectral Clustering for Stochastic Block Models
- Information-Based Optimal Subdata Selection for Big Data Linear Regression
- Consistent Adjacency-Spectral Partitioning for the Stochastic Block Model When the Model Parameters Are Unknown
- Achieving Optimal Misclassification Proportion in Stochastic Block Model
- Concentration and regularization of random graphs
- Augmented Implicitly Restarted Lanczos Bidiagonalization Methods
- Signal-plus-noise matrix models: eigenvector deviations and fluctuations
- Randomized numerical linear algebra: Foundations and algorithms
