Figure 1

Schematic representation of the steps of our algorithm. (a) The algorithm assigns a within-degree and between-degree to each node, which are represented here as half-within-edges and half-between-edges respectively. (b) The half-between-edges are then connected using a modified version of the Havel-Hakimi algorithm, and to remove degree correlations, the between-edges are randomized. (c) Finally, the half-within-edges are connected using the standard Havel-Hakimi algorithm for each module and (d) the within-edges are randomized to remove degree correlations.