Bayesian Degree-Corrected Stochastic Blockmodels for Community Detection

Abstract

Community detection in networks has drawn much attention in diverse fields, especially social sciences. Given its significance, there has been a large body of literature with approaches from many fields. Here we present a statistical framework that is representative, extensible, and that yields an estimator with good properties. Our proposed approach considers a stochastic blockmodel based on a logistic regression formulation with node correction terms. We follow a Bayesian approach that explicitly captures the community behavior via prior specification. We further adopt a data augmentation strategy with latent Polya-Gamma variables to obtain posterior samples. We conduct inference based on a principled, canonically mapped centroid estimator that formally addresses label non-identifiability and captures representative community assignments. We demonstrate the proposed model and estimation on real-world as well as simulated benchmark networks and show that the proposed model and estimator are more flexible, representative, and yield smaller error rates when compared to the MAP estimator from classical degree-corrected stochastic blockmodels.

23 pages, 9 figures

References in corpus (8)

• Modularity and community structure in networks
• Benchmark graphs for testing community detection algorithms
• Resolution limit in community detection
• Stochastic blockmodels and community structure in networks
• A Bayesian Approach to Network Modularity
• Modeling Social Networks with Node Attributes using the Multiplicative Attribute Graph Model
• Bayesian inference for logistic models using Polya-Gamma latent variables
• Testing and Modeling Dependencies Between a Network and Nodal Attributes