On the efficacy of higher-order spectral clustering under weighted stochastic block models
From MaRDI portal
Publication:6071724
DOI10.1016/j.csda.2023.107872arXiv2206.15379OpenAlexW4387484597MaRDI QIDQ6071724
Xiang Yu Chang, Hai Zhang, Xiao Guo
Publication date: 28 November 2023
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2206.15379
Cites Work
- Sparse inverse covariance estimation with the graphical lasso
- Network cross-validation by edge sampling
- Coauthorship and citation networks for statisticians
- Consistency of spectral hypergraph partitioning under planted partition model
- Spectral clustering and the high-dimensional stochastic blockmodel
- Optimal adaptivity of signed-polygon statistics for network testing
- Optimal rates for community estimation in the weighted stochastic block model
- Spectral and matrix factorization methods for consistent community detection in multi-layer networks
- Consistency of spectral clustering in stochastic block models
- An Efficient Sampling Algorithm for Network Motif Detection
- Model selection and estimation in the Gaussian graphical model
- Networks
- Learning latent block structure in weighted networks
- Wedge sampling for computing clustering coefficients and triangle counts on large graphs†
- Randomized Spectral Clustering in Large-Scale Stochastic Block Models
- A Survey of Statistical Network Models
- On a two-truths phenomenon in spectral graph clustering
- Consistent Adjacency-Spectral Partitioning for the Stochastic Block Model When the Model Parameters Are Unknown
- Spectral techniques applied to sparse random graphs
- On the Method of Typical Bounded Differences
- The Rotation of Eigenvectors by a Perturbation. III
- Inference using noisy degrees: differentially private \(\beta\)-model and synthetic graphs
