Spectral clustering in the dynamic stochastic block model
From MaRDI portal
Publication:668613
DOI10.1214/19-EJS1533zbMath1415.62046arXiv1705.01204OpenAlexW2963900617WikidataQ128360898 ScholiaQ128360898MaRDI QIDQ668613
Publication date: 19 March 2019
Published in: Electronic Journal of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.01204
Asymptotic properties of parametric estimators (62F12) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Random graphs (graph-theoretic aspects) (05C80)
Related Items (14)
An optimal statistical and computational framework for generalized tensor estimation ⋮ Latent structure blockmodels for Bayesian spectral graph clustering ⋮ Sparse and smooth: improved guarantees for spectral clustering in the dynamic stochastic block model ⋮ Optimal Bipartite Network Clustering ⋮ Unnamed Item ⋮ Rate optimal Chernoff bound and application to community detection in the stochastic block models ⋮ Multilayer hypergraph clustering using the aggregate similarity matrix ⋮ Bias-Adjusted Spectral Clustering in Multi-Layer Stochastic Block Models ⋮ Generalized Low-Rank Plus Sparse Tensor Estimation by Fast Riemannian Optimization ⋮ Latent Space Model for Higher-Order Networks and Generalized Tensor Decomposition ⋮ Online estimation and community detection of network point processes for event streams ⋮ Consistency of the maximum likelihood and variational estimators in a dynamic stochastic block model ⋮ Optimal change point detection and localization in sparse dynamic networks ⋮ Community detection on mixture multilayer networks via regularized tensor decomposition
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Estimating the number of communities by spectral methods
- Fast community detection by SCORE
- Rate-optimal graphon estimation
- Impact of regularization on spectral clustering
- Detecting communities and their evolutions in dynamic social networks -- a Bayesian approach
- Oracle inequalities for network models and sparse graphon estimation
- Spectral clustering and the high-dimensional stochastic blockmodel
- Community detection in sparse random networks
- A state-space mixed membership blockmodel for dynamic network tomography
- Statistical analysis of network data. Methods and models
- Optimal spatial adaptation to inhomogeneous smoothness: An approach based on kernel estimates with variable bandwidth selectors
- Consistency of community detection in networks under degree-corrected stochastic block models
- Hybrid linear modeling via local best-fit flats
- Dynamic network models and graphon estimation
- Consistency of spectral clustering in stochastic block models
- Role of normalization in spectral clustering for stochastic blockmodels
- Adaptive evolutionary clustering
- Co-clustering separately exchangeable network data
- Community detection in dense random networks
- A nonparametric view of network models and Newman–Girvan and other modularities
- Mixed membership stochastic blockmodels
- A Survey of Statistical Network Models
- Spectral techniques applied to sparse random graphs
- Achieving Optimal Misclassification Proportion in Stochastic Block Model
- Statistical Clustering of Temporal Networks Through a Dynamic Stochastic Block Model
- An Introduction to Matrix Concentration Inequalities
This page was built for publication: Spectral clustering in the dynamic stochastic block model