Bias-Adjusted Spectral Clustering In Multi-Layer Stochastic Block Models
summary
Proposes spectral clustering on the sum of squared adjacency matrices with diagonal removed to cancel a layerwise bias that grows like L, turning the problematic A^2 diagonal into a computable degree correction; proves error rate shrinks with more layers as fraction misclustered ≤ C sqrt(log)/(n rho sqrt(L)) under a multilayer SBM, with simulations (30 layers) showing clear gains in the moderate-sparsity regime. Applies to a real gene co-expression set of ~8,000 genes over 10 timepoints, K=8, and recovers temporally varying community activity.
AI-written summary · about
chapters (17)
- 0:00Introduction
- 1:37Background
- 2:22Example
- 4:03Multilayer stochastic block model
- 5:38Single layer community recovery
- 6:44Layerwise positivity assumption
- 9:36Least square approach
- 10:49Least square approximation
- 12:29Spectral clustering
- 14:37Error decomposition
- 18:27Simulation
- 19:44Analysis
- 27:49rnsteins Inequality
- 29:58Hands and Writing Inequality
- 30:33Gene Coexpression Network
- 31:19Results
- 34:40Temporal Analysis
related talks
24mStochastic Block Models with R: Statistically rigorous clustering
38mThe Impact of Regularization in Spectral Clustering
47mLearning Probabilistic Models for Graph Partitioning in the Presence of Noise
45mCorrelated Stochastic Block Models: Graph Matching And Community Recovery
25mLucky Talk: From Coding to Clustering
47mCrowdsourcing for Clustering: Algorithms and Information-Theoretic Lower Bounds
49mSpectral Algorithms for Learning Latent Variable Models
37mThe Sum-of-Squares Approach to Clustering Non-Spherical Gaussian Mixtures
