Estimating the number of communities in weighted networks
arXiv:2211.14844 · doi:10.3390/e25040551
Abstract
Community detection in weighted networks has been a popular topic in recent years. However, while there exist several flexible methods for estimating communities in weighted networks, these methods usually assume that the number of communities is known. It is usually unclear how to determine the exact number of communities one should use. Here, to estimate the number of communities for weighted networks generated from arbitrary distribution under the degree-corrected distribution-free model, we propose one approach that combines weighted modularity with spectral clustering. This approach allows a weighted network to have negative edge weights and it also works for signed networks. We compare the proposed method to several existing methods and show that our method is more accurate for estimating the number of communities both numerically and empirically.
References in corpus (29)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Community structure in social and biological networks
- Modularity and community structure in networks
- Community detection in graphs
- Finding community structure in networks using the eigenvectors of matrices
- Cooperative Game Theory Approaches for Network Partitioning
- The structure of scientific collaboration networks
- Functional cartography of complex metabolic networks
- Epidemic processes in complex networks
- Analysis of weighted networks
- Stochastic blockmodels and community structure in networks
- Community detection in networks: A user guide
- Quantifying social group evolution
- Spectral clustering and the high-dimensional stochastic blockmodel
- Consistency of spectral clustering in stochastic block models
- Fast community detection by SCORE
- Analysis of community structure in networks of correlated data
- Pseudo-likelihood methods for community detection in large sparse networks
- Learning Latent Block Structure in Weighted Networks
- Estimating the number of communities in a network
- Coauthorship and Citation Networks for Statisticians
- A goodness-of-fit test for stochastic block models
- Nonparametric weighted stochastic block models
- Efficient method for estimating the number of communities in a network
- Hypergraph Spectral Clustering in the Weighted Stochastic Block Model
- Determining the Number of Communities in Degree-corrected Stochastic Block Models
- On Mixed Memberships and Symmetric Nonnegative Matrix Factorizations