Unbiased sampling of network ensembles
Squartini, Tiziano; Mastrandrea, Rossana; Garlaschelli, Diego
- Sampling random graphs with given properties is a key step in the analysis of networks, as random ensembles represent basic null models required to identify patterns such as communities and motifs. A key requirement is that the sampling process is unbiased and efficient. The main approaches are microcanonical, i.e. they sample graphs that exactly match the enforced constraints. Unfortunately, when applied to strongly heterogeneous networks (including most real-world graphs), the majority of these approaches become biased and/or time-consuming. Moreover, the algorithms defined in the simplest cases (such as binary graphs with given degrees) are not easily generalizable to more complicated ensembles. Here we propose a solution to the problem via the introduction of a `maximize-and-sample' (`Max & Sam') method to correctly sample ensembles of networks where the constraints are `soft' i.e. they are realized as ensemble averages. Being based on exact maximum-entropy distributions, our approach is unbiased by construction, even for strongly heterogeneous networks. It is also more computationally efficient than most microcanonical alternatives. Finally, it works for both binary and weighted networks with a variety of constraints, including combined degree-strengths sequences and full reciprocity structure, for which no alternative method exists. Our method can also be turned into a microcanonical one, via a restriction to the relevant subset. We show various applications to real-world networks and provide a code implementing all our algorithms.
- Type of Publication:
- complex networks; ensemble nonequivalence; maximum entropy principle; null models of graphs; sampling network ensembles
- New Journal of Physics