3 Generation of Block Structure In this section, we provide details on the block structure used in Section 4 of the main paper. The collection of networks are designed to mimic community structure and mixing patterns found in contact networks using the degree-corrected stochastic block model, which allows for an arbitrary degree distribution and block structure. Let b$_{i}$ ∈ { 1 , ..., B } be the block membership for node i , with B = 8 blocks total. Define the total degree for members of each block j as κ$_{j}$ := ∑ i k$_{i}$$_{I}$ ( b$_{i}$ = j ) , and the total number of edges m = ∑ B j $_{=1}$κ$_{j}$ 2 . The model specifies the amount of mixing between blocks by specifying mixing matrix ω ∈ N B × $^{B}$, which defines the total number of edges shared between members of pairs of blocks. This matrix requires a constraint to ensure all edges belong to some block pair: ω 1 ≡ κ , where 1 = { 1 , ..., 1 } ⊤ and κ = { κ$_{1}$, ..., κ$_{B}$ } $^{⊤}$. Before specifying the chosen mixing structure, we define three valid mixing matrix specifications, which we combine for our final specification. Nodes might form ties exclusively with members of their same block, in which case ω$_{community}$ gives the mixing matrix corresponding to edges with this structure. Blocks may also mix preferentially with other blocks, forming a core. Mixing matrix ω$_{core}$ assumes block 1 mixes with other blocks with greater frequency than members of other blocks. Finally, all blocks may share their edges proportional to the total degree of each other block holding average block degree constant, which is detailed by ω$_{random}$ . Each of these mixing matrices are detailed below. 26