Efficient method for estimating the number of communities in a network
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 7 Jun 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 0; 2023: 0; 2024: 0; 2025: 1.
3 papers.
- 2021SSSNET: Semi-Supervised Signed Network Clusteringcited by 20
- 2021DIGRAC: Digraph Clustering Based on Flow Imbalancecited by 15
- 2025Estimation of partial rankings from sparse, noisy comparisonscited by 3
- 2025Estimation of partial rankings from sparse, noisy comparisons5 Jan 2025
- 2021SSSNET: Semi-Supervised Signed Network Clustering13 Oct 2021
- 2021DIGRAC: Digraph Clustering Based on Flow Imbalance9 Jun 2021