TL;DR
This paper introduces a nonparametric Bayesian method for inferring hierarchical modular structures in networks using a microcanonical stochastic block model, enabling scalable, multi-scale community detection and model selection.
Contribution
It presents a novel microcanonical Bayesian inference approach that improves scalability and depth of hierarchical community detection in networks compared to traditional methods.
Findings
Efficient inference algorithm scales to large networks and many modules.
Allows sampling of hierarchical community structures from the posterior.
Provides a framework for model selection and comparison.
Abstract
A principled approach to characterize the hidden structure of networks is to formulate generative models, and then infer their parameters from data. When the desired structure is composed of modules or "communities", a suitable choice for this task is the stochastic block model (SBM), where nodes are divided into groups, and the placement of edges is conditioned on the group memberships. Here, we present a nonparametric Bayesian method to infer the modular structure of empirical networks, including the number of modules and their hierarchical organization. We focus on a microcanonical variant of the SBM, where the structure is imposed via hard constraints, i.e. the generated networks are not allowed to violate the patterns imposed by the model. We show how this simple model variation allows simultaneously for two important improvements over more traditional inference approaches: 1.…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
