A Unified Framework for Community Detection and Model Selection in Blockmodels

Abstract

Blockmodels are a foundational tool for modeling community structure in networks, with the stochastic blockmodel (SBM), degree-corrected blockmodel (DCBM), and popularity-adjusted blockmodel (PABM) forming a natural hierarchy of increasing generality. While community detection under these models has been extensively studied, much less attention has been paid to the model selection problem, i.e., determining which model best fits a given network. Building on recent theoretical insights about the spectral geometry of these models, we propose a unified framework for simultaneous community detection and model selection across the full blockmodel hierarchy. A key innovation is the use of loss functions that serve a dual role: they act as objective functions for community detection and as test statistics for hypothesis testing. We develop a greedy algorithm to minimize these loss functions and establish theoretical guarantees for exact label recovery and model selection consistency under each model. Extensive simulation studies demonstrate that our method achieves high accuracy in both tasks, outperforming or matching state-of-the-art alternatives. Applications to five real-world networks further illustrate the interpretability and practical utility of our approach. R code for implementing the method is available at https://github.com/subhankarbhadra/model-selection.

Journal of Computational and Graphical Statistics, 2025

References in corpus (15)

• Community structure in social and biological networks
• Cooperative Game Theory Approaches for Network Partitioning
• Stochastic blockmodels and community structure in networks
• User-friendly tail bounds for sums of random matrices
• Spectral clustering and the high-dimensional stochastic blockmodel
• Consistency of spectral clustering in stochastic block models
• Fast community detection by SCORE
• Consistency of community detection in networks under degree-corrected stochastic block models
• Pseudo-likelihood methods for community detection in large sparse networks
• Sharp nonasymptotic bounds on the norm of random matrices with independent entries
• A goodness-of-fit test for stochastic block models
• Model Selection for Degree-corrected Block Models
• Subsampling bootstrap of count features of networks
• A generalized hypothesis test for community structure in networks
• Popularity Adjusted Block Models are Generalized Random Dot Product Graphs