Efficient method for estimating the number of communities in a network
arXiv:1706.02324 · doi:10.1103/PhysRevE.96.032310
Abstract
While there exist a wide range of effective methods for community detection in networks, most of them require one to know in advance how many communities one is looking for. Here we present a method for estimating the number of communities in a network using a combination of Bayesian inference with a novel prior and an efficient Monte Carlo sampling scheme. We test the method extensively on both real and computer-generated networks, showing that it performs accurately and consistently, even in cases where groups are widely varying in size or structure.
13 pages, 4 figures
References in corpus (7)
- Finding community structure in networks using the eigenvectors of matrices
- Cooperative Game Theory Approaches for Network Partitioning
- Benchmark graphs for testing community detection algorithms
- Stochastic blockmodels and community structure in networks
- Community detection in networks: A user guide
- Missing and spurious interactions and the reconstruction of complex networks
- Phase transition in the detection of modules in sparse networks