Analytical Formulation of the Block-Constrained Configuration Model
arXiv:1811.05337 · doi:10.1007/s41109-019-0241-1
Abstract
We provide a novel family of generative block-models for random graphs that naturally incorporates degree distributions: the block-constrained configuration model. Block-constrained configuration models build on the generalised hypergeometric ensemble of random graphs and extend the well-known configuration model by enforcing block-constraints on the edge generation process. The resulting models are analytically tractable and practical to fit even to large networks. These models provide a new, flexible tool for the study of community structure and for network science in general, where modelling networks with heterogeneous degree distributions is of central importance.
24 pages, 6 figures, 3 tables
References in corpus (11)
- Fast unfolding of communities in large networks
- Cooperative Game Theory Approaches for Network Partitioning
- Maps of random walks on complex networks reveal community structure
- Near linear time algorithm to detect community structures in large-scale networks
- Statistical Mechanics of Community Detection
- Stochastic blockmodels and community structure in networks
- Model selection and hypothesis testing for large-scale network models with overlapping groups
- Reconstructing networks with unknown and heterogeneous errors
- Unbiased sampling of network ensembles
- Generalized Hypergeometric Ensembles: Statistical Hypothesis Testing in Complex Networks
- Multiplex Network Regression: How do relations drive interactions?