# Regularized Stochastic Block Model for robust community detection in complex networks

arXiv: https://arxiv.org/abs/1903.11751 · HTML: https://mlsanity.com/paper/1903.11751/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 28 Mar 2019.

## Built on by (most cited first, 2 of 2)

- [A Comprehensive Review of Community Detection in Graphs](https://mlsanity.com/paper/2309.11798/) (2023)
- [Probability density estimation for sets of large graphs with respect to spectral information using stochastic block models](https://mlsanity.com/paper/2207.02168/) (2022)

## Abstract (arXiv)

The stochastic block model is able to generate different network partitions, ranging from traditional assortative communities to disassortative structures. Since the degree-corrected stochastic block model does not specify which mixing pattern is desired, the inference algorithms, which discover the most likely partition of the networks nodes, are likely to get trapped in the local optima of the log-likelihood. Here we introduce a new model constraining nodes' internal degrees ratios in the objective function to stabilize the inference of block models from the observed network data. Given the regularized model, the inference algorithms, such as Markov chain Monte Carlo, reliably finds assortative or disassortive structure as directed by the value of a single parameter. We show experimentally that the inference of our proposed model quickly converges to the desired assortative or disassortative partition while the inference of degree-corrected stochastic block model gets often trapped at the inferior local optimal partitions when the traditional assortative community structure is not strong in the observed networks.