Hierarchical configuration model

Research output: Contribution to journalArticleAcademicpeer-review

119 Downloads (Pure)

Abstract

We introduce a class of random graphs with a community structure, which we call the hierarchical configuration model. On the inter-community level, the graph is a configuration model, and on the intra-community level, every vertex in the configuration model is replaced by a community: i.e., a small graph. These communities may have any shape, as long as they are connected. For these hierarchical graphs, we find the size of the largest component, the degree distribution and the clustering coefficient.
Furthermore, we determine the conditions under which a giant percolation cluster exists, and find its size.
Original languageEnglish
Article number1214
Number of pages25
JournalInternet Mathematics
DOIs
Publication statusPublished - 30 Dec 2016

Fingerprint Dive into the research topics of 'Hierarchical configuration model'. Together they form a unique fingerprint.

Cite this