Sparse and smooth: improved guarantees for spectral clustering in the dynamic stochastic block model

DOI10.1214/22-EJS1986MaRDI QIDQ2136643FDOQ2136643

Authors: Nicolas Keriven, Samuel Vaiter 

Publication date: 11 May 2022

Published in: Electronic Journal of Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.02892

zbMATH Keywords

spectral clusteringdynamic networkdynamic stochastic block modelconcentration bounds

Mathematics Subject Classification ID

Statistics (62-XX)

Cites Work

• Spectral clustering and the high-dimensional stochastic blockmodel
• Least squares quantization in PCM
• A survey of statistical network models
• A proof of the block model threshold conjecture
• Consistency of maximum-likelihood and variational estimators in the stochastic block model
• Consistency of the maximum likelihood and variational estimators in a dynamic stochastic block model
• Consistency of spectral clustering in stochastic block models
• Spectral redemption in clustering sparse networks
• Global spectral clustering in dynamic networks
• Statistical Clustering of Temporal Networks Through a Dynamic Stochastic Block Model
• Concentration and regularization of random graphs
• Spectral clustering in the dynamic stochastic block model
• Consistency of spectral clustering
• Detecting communities and their evolutions in dynamic social networks -- a Bayesian approach
• Spectral and matrix factorization methods for consistent community detection in multi-layer networks
• Sharp nonasymptotic bounds on the norm of random matrices with independent entries
• Role of normalization in spectral clustering for stochastic blockmodels
• Kernel spectral clustering of large dimensional data
• Title not available (Why is that?)
• Community Detection and Stochastic Block Models
• A variational approach to the consistency of spectral clustering
• Limit theorems for eigenvectors of the normalized Laplacian for random graphs
• Continuous empirical characteristic function estimation of mixtures of normal parameters
• Partitioning Well-Clustered Graphs: Spectral Clustering Works!
• CONCENTRATION OF RANDOM GRAPHS AND APPLICATION TO COMMUNITY DETECTION
• Approximating Spectral Clustering via Sampling: A Review

Cited In (6)

• Sparse and Smooth: improved guarantees for Spectral Clustering in the Dynamic Stochastic Block Model
• Entropic Optimal Transport on Random Graphs
• Consistency of spectral clustering in stochastic block models
• Optimal couplings between sparse block models
• Spectral clustering and the high-dimensional stochastic blockmodel
• Bias-Adjusted Spectral Clustering in Multi-Layer Stochastic Block Models

This page was built for publication: Sparse and smooth: improved guarantees for spectral clustering in the dynamic stochastic block model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2136643)