Regularized Stochastic Block Model for robust community detection in complex networks
arXiv:1903.11751 · doi:10.1038/s41598-019-49580-5
Abstract
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.
References in corpus (9)
- The structure and function of complex networks
- Finding and evaluating community structure in networks
- Modularity and community structure in networks
- Community detection in graphs
- Stochastic blockmodels and community structure in networks
- Asymptotic analysis of the stochastic block model for modular networks and its algorithmic applications
- The ground truth about metadata and community detection in networks
- Community detection in networks: Modularity optimization and maximum likelihood are equivalent
- Efficient Monte Carlo and greedy heuristic for the inference of stochastic block models