A spectral inference method for determining the number of communities in networks
Yujia Wu, Xiucai Ding, Jingfei Zhang, Wei Lan, and Chih-Ling Tsai

TL;DR
This paper introduces a simple, model-free spectral method for accurately estimating the number of communities in various networks, including sparse and dense ones, without complex parameter tuning.
Contribution
It proposes a novel eigengap ratio-based spectral inference technique that works across different block models and network sparsity levels without explicit model fitting.
Findings
Method accurately estimates community number in simulations
Effective for both sparse and dense networks
Demonstrated usefulness on real-world network data
Abstract
To characterize the community structure in network data, researchers have developed various block-type models, including the stochastic block model, the degree-corrected stochastic block model, the mixed membership block model, the degree-corrected mixed membership block model, and others. A critical step in applying these models effectively is determining the number of communities in the network. However, to the best of our knowledge, existing methods for estimating the number of network communities either rely on explicit model fitting or fail to simultaneously accommodate network sparsity and a diverging number of communities. In this paper, we propose a model-free spectral inference method based on eigengap ratios that addresses these challenges. The inference procedure is straightforward to compute, requires no parameter tuning, and can be applied to a wide range of block models…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplex Network Analysis Techniques · Bayesian Methods and Mixture Models · Markov Chains and Monte Carlo Methods
