Analytical Formulation of the Block-Constrained Configuration Model

DOI10.1007/S41109-019-0241-1arXiv1811.05337MaRDI QIDQ6309643FDOQ6309643

Authors:

Publication date: 12 November 2018

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.

Mathematics Subject Classification ID

Contingency tables (62H17) Random graphs (graph-theoretic aspects) (05C80) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Combinatorial probability (60C05)

This page was built for publication: Analytical Formulation of the Block-Constrained Configuration Model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6309643)