Spectral clustering in the dynamic stochastic block model
From MaRDI portal
Abstract: In the present paper, we studied a Dynamic Stochastic Block Model (DSBM) under the assumptions that the connection probabilities, as functions of time, are smooth and that at most nodes can switch their class memberships between two consecutive time points. We estimate the edge probability tensor by a kernel-type procedure and extract the group memberships of the nodes by spectral clustering. The procedure is computationally viable, adaptive to the unknown smoothness of the functional connection probabilities, to the rate of membership switching and to the unknown number of clusters. In addition, it is accompanied by non-asymptotic guarantees for the precision of estimation and clustering.
Recommendations
- Statistical clustering of temporal networks through a dynamic stochastic block model
- Dynamic network models and graphon estimation
- Consistency of the maximum likelihood and variational estimators in a dynamic stochastic block model
- Dynamic stochastic block models: parameter estimation and detection of changes in community structure
- Consistency of spectral clustering in stochastic block models
Cites work
- scientific article; zbMATH DE number 28602 (Why is no real title available?)
- scientific article; zbMATH DE number 486467 (Why is no real title available?)
- A nonparametric view of network models and Newman–Girvan and other modularities
- A state-space mixed membership blockmodel for dynamic network tomography
- A survey of statistical network models
- Achieving optimal misclassification proportion in stochastic block models
- Adaptive evolutionary clustering
- An introduction to matrix concentration inequalities
- Co-clustering separately exchangeable network data
- Community detection in dense random networks
- Community detection in sparse random networks
- Consistency of community detection in networks under degree-corrected stochastic block models
- Consistency of spectral clustering in stochastic block models
- Detecting communities and their evolutions in dynamic social networks -- a Bayesian approach
- Dynamic network models and graphon estimation
- Estimating the number of communities by spectral methods
- Fast community detection by SCORE
- Hybrid linear modeling via local best-fit flats
- Impact of regularization on spectral clustering
- Mixed membership stochastic blockmodels
- Optimal spatial adaptation to inhomogeneous smoothness: An approach based on kernel estimates with variable bandwidth selectors
- Oracle inequalities for network models and sparse graphon estimation
- Rate-optimal graphon estimation
- Role of normalization in spectral clustering for stochastic blockmodels
- Spectral clustering and the high-dimensional stochastic blockmodel
- Spectral techniques applied to sparse random graphs
- Statistical analysis of network data. Methods and models
- Statistical clustering of temporal networks through a dynamic stochastic block model
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
Cited in
(25)- A Time-Varying Network for Cryptocurrencies
- Statistical clustering of temporal networks through a dynamic stochastic block model
- Optimal bipartite network clustering
- Consistency of the maximum likelihood and variational estimators in a dynamic stochastic block model
- Latent structure blockmodels for Bayesian spectral graph clustering
- Sparse and smooth: improved guarantees for spectral clustering in the dynamic stochastic block model
- Dynamic network models and graphon estimation
- Consistency of spectral clustering in stochastic block models
- An optimal statistical and computational framework for generalized tensor estimation
- Generalized Low-Rank Plus Sparse Tensor Estimation by Fast Riemannian Optimization
- Community detection in complex networks: from statistical foundations to data science applications
- Multilayer hypergraph clustering using the aggregate similarity matrix
- Latent Space Model for Higher-Order Networks and Generalized Tensor Decomposition
- Online estimation and community detection of network point processes for event streams
- Discussion of “Co-citation and Co-authorship Networks of Statisticians” by Pengsheng Ji, Jiashun Jin, Zheng Tracy Ke, and Wanshan Li
- Spectral co-clustering in multi-layer directed networks
- Kernel spectral clustering with memory effect
- Global spectral clustering in dynamic networks
- Optimal change point detection and localization in sparse dynamic networks
- Rate optimal Chernoff bound and application to community detection in the stochastic block models
- scientific article; zbMATH DE number 7255138 (Why is no real title available?)
- Spectral clustering and the high-dimensional stochastic blockmodel
- Community detection on mixture multilayer networks via regularized tensor decomposition
- Bias-Adjusted Spectral Clustering in Multi-Layer Stochastic Block Models
- Profile-pseudo likelihood methods for community detection of multilayer stochastic block models
This page was built for publication: 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 Q668613)
