Configuring Random Graph Models with Fixed Degree Sequences

Abstract

Random graph null models have found widespread application in diverse research communities analyzing network datasets, including social, information, and economic networks, as well as food webs, protein-protein interactions, and neuronal networks. The most popular family of random graph null models, called configuration models, are defined as uniform distributions over a space of graphs with a fixed degree sequence. Commonly, properties of an empirical network are compared to properties of an ensemble of graphs from a configuration model in order to quantify whether empirical network properties are meaningful or whether they are instead a common consequence of the particular degree sequence. In this work we study the subtle but important decisions underlying the specification of a configuration model, and investigate the role these choices play in graph sampling procedures and a suite of applications. We place particular emphasis on the importance of specifying the appropriate graph labeling-stub-labeled or vertex-labeled-under which to consider a null model, a choice that closely connects the study of random graphs to the study of random contingency tables. We show that the choice of graph labeling is inconsequential for studies of simple graphs, but can have a significant impact on analyses of multigraphs or graphs with self-loops. The importance of these choices is demonstrated through a series of three in-depth vignettes, analyzing three different network datasets under many different configuration models and observing substantial differences in study conclusions under different models. We argue that in each case, only one of the possible configuration models is appropriate. While our work focuses on undirected static networks, it aims to guide the study of directed networks, dynamic networks, and all other network contexts that are suitably studied through the lens of random graph null models. * All authors contributed equally to this work.

Rejection-Based Simulation of Non-Markovian Agents on Complex Networks

“…We demonstrate the effectiveness our approach on classical epidemic-type processes and synthetically generated networks following the configuration model with a truncated power-law degree distribution [38]. That is P (k) ∝ k −β for 3 ≤ k ≤ |N |.…”

Annotated hypergraphs: models and applications

“…Unfortunately, no results are extant for this class of edge-swap Markov chains, while the best available upper bound for the mixing time of a related class of chains [19,18] scales poorly with the node degrees and total number of edges. Despite this, edge-swap Markov chains can be deployed in a variety of practical settings, see [13] for a review.…”

Space-independent community and hub structure of functional brain networks

“…Because the randomized networks tend to preserve only low-level features of the observed network, e.g. average binary density, degree sequence, etc., this hypothesis testing framework allows us to identify higher-level features of the observed network that are not easily attributable to random fluctuations [49]. Increasingly, it is becoming understood that the traditional random network models can be too liberal for many of the hypothesis testings [50][51][52][53].…”