Selecting the Number of Communities for Weighted Degree-Corrected Stochastic Block Models
Not on the map. Why?
Abstract (arXiv)
We investigate how to select the number of communities for weighted networks without a full likelihood modeling. First, we propose a novel weighted degree-corrected stochastic block model (DCSBM), where the mean adjacency matrix is modeled in the same way as in the standard DCSBM, while the variance profile matrix is assumed to be related to the mean adjacency matrix through a given variance function. Our method of selecting the number of communities is based on a sequential testing framework. In each step, the weighted DCSBM is fitted via some spectral clustering method. A key component of our method is matrix scaling on the estimated variance profile matrix. The resulting scaling factors can be used to normalize the adjacency matrix, from which the test statistic is then obtained. Under mild conditions on the weighted DCSBM, our proposed procedure is shown to be consistent in estimating the true number of communities. Numerical experiments on both simulated and real-world network data demonstrate the desirable empirical properties of our method.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 26 of its 57 references that are in the map. First posted on arXiv 8 Jun 2024.
Builds on
26 of 57 references.
References · 26
- 2013Consistency of spectral clustering in stochastic block modelscited by 128
- 2014Exact Recovery in the Stochastic Block Modelcited by 77
- 2016Community Detection in Degree-Corrected Block Modelscited by 36
- 2016Network cross-validation by edge samplingcited by 26
- 2013Impact of regularization on Spectral Clusteringcited by 25
- 2015Minimax Rates of Community Detection in Stochastic Block Modelscited by 25
- 2014Detecting Overlapping Communities in Networks Using Spectral Methodscited by 22
- 2014Network Cross-Validation for Determining the Number of Communities in Network Datacited by 21
- 2014Community detection in sparse networks via Grothendieck's inequalitycited by 21
- 2014A goodness-of-fit test for stochastic block modelscited by 20
- 2020Strong Consistency, Graph Laplacians, and the Stochastic Block Modelcited by 20
- 2017Theoretical and Computational Guarantees of Mean Field Variational Inference for Community Detectioncited by 19
14 more
- 2014Robust and computationally feasible community detection in the presence of arbitrary outlier nodescited by 17
- 2015Convexified Modularity Maximization for Degree-corrected Stochastic Block Modelscited by 16
- 2018Hierarchical community detection by recursive partitioningcited by 16
- 2018Convex Relaxation Methods for Community Detectioncited by 11
- 2018Determining the Number of Communities in Degree-corrected Stochastic Block Modelscited by 10
- 2016Estimating the number of communities in a networkcited by 9
- 2017Testing for Global Network Structure Using Small Subgraph Statisticscited by 9
- 2014How Many Communities Are There?cited by 8
- 2017Using Maximum Entry-Wise Deviation to Test the Goodness-of-Fit for Stochastic Block Modelscited by 8
- 2019Optimal Adaptivity of Signed-Polygon Statistics for Network Testingcited by 8
- 2015A spectral method for community detection in moderately-sparse degree-corrected stochastic block modelscited by 7
- 2018Network Global Testing by Counting Graphletscited by 5
- 2020Consistency of Spectral Clustering on Hierarchical Stochastic Block Modelscited by 5
- 2020Optimal Estimation of the Number of Communitiescited by 1
Built on by
Not cited yet.