# Mean-field models for non-Markovian epidemics on networks

- 1.2k Downloads
- 2 Citations

## Abstract

This paper introduces a novel extension of the edge-based compartmental model to epidemics where the transmission and recovery processes are driven by general independent probability distributions. Edge-based compartmental modelling is just one of many different approaches used to model the spread of an infectious disease on a network; the major result of this paper is the rigorous proof that the edge-based compartmental model and the message passing models are equivalent for general independent transmission and recovery processes. This implies that the new model is exact on the ensemble of configuration model networks of infinite size. For the case of Markovian transmission the message passing model is re-parametrised into a pairwise-like model which is then used to derive many well-known pairwise models for regular networks, or when the infectious period is exponentially distributed or is of a fixed length.

## Keywords

Epidemics on networks Non-Markovian transmission and recovery Mean-field models## Mathematics Subject Classification

92D30 37N25## 1 Introduction

The use of mathematical tools to study and understand the spread of infectious diseases is a mature and fruitful area of research. In their 1927 paper Kermack and McKendrick (1927) established the susceptible-infected-recovered (SIR) framework which forms the basis of many models to this day. However, their model assumes that any individual can interact with any other. In reality, in large populations each individual only interacts with a few others, and these connections determine the possible routes of disease transmission. Moreover, studies have found significant heterogeneity in the number of contacts a single individual may have (Pastor-Satorras and Vespignani 2001). The use of graphs or networks to describe these contact patterns represented a major advance in our ability to model more realistic social behaviour. In network-based models individuals are represented by nodes in the network, with edges (or links) encoding the interactions between nodes.

Since the direct analysis of stochastic epidemics on networks is far from trivial, one often relies on deterministic mean-field models that are aimed at approximating some average quantities taken from the stochastic models. Deriving mean-field models can be done in several different ways depending on what one chooses to focus on. For example, considering all nodes and edges in all possible states leads to pairwise models (Keeling 1999; House and Keeling 2011), while considering separately each individual and all possible ways in which it can become infected by its neighbours leads to the message passing (MP) formalism (Karrer and Newman 2010). Focussing on all possible star-like structures, typically defined by a node and all its neighbours, and also taking into account their disease status, yields the so-called effective-degree models (Lindquist et al. 2011). Edge-based compartmental models (EBCM) are based on considering a randomly chosen test node and working out the probability of it staying susceptible, with this probability being then equivalent to the proportion of susceptible nodes in the entire population (Miller et al. 2012). See Danon et al. (2011), Pastor-Satorras et al. (2015) and Kiss et al. (2017) for reviews. All of these models start from the same stochastic model, thus, it is not surprising that some of these models (House and Keeling 2011; Taylor and Kiss 2014; Miller and Kiss 2014; Kiss et al. 2017) are, in fact, equivalent, as we will demonstrate later.

While network models capture contact more accurately, the assumption that the underlying stochastic transmission and recovery processes are memoryless (Keeling and Eames 2005; Volz 2008; House and Keeling 2011) remains restrictive. Of course, memoryless processes are mathematically more tractable and relatively simple to analyse when compared to models where the inter-event times are chosen from distributions other than the exponential. However, when compared to data, these assumptions are often violated. For example, diseases can exhibit unique and non-Markovian behaviour in terms of the strength and duration of infection. In this respect, the distribution of the infectious period is usually better approximated by some peaked distribution with a well defined mean, see e.g. Bailey (1954), Gough (1977), Wearing et al. (2005) and references therein.

The MP method does not rely on these assumptions and is able to predict the average behaviour of an epidemic outbreak with general distributions for the transmission times and the duration of infection, although we still require these be independent. Throughout the paper we will denote these distributions as \(\tau (a)\) and *q*(*a*), where *a* is the time since the node became infected, known as the age of infection. Once a susceptible node has been exposed to a transmission event, it becomes infected immediately, while the recovery from the disease grants a lifetime immunity. Using these distributions assumes a homogeneous response to disease; whilst this restriction is not always necessary (see e.g. Wilkinson and Sharkey 2014), it is a common simplification in order to obtain a concise model. However, the main focus of this paper is to explore the flexibility of the EBCM in being able to capture epidemics where the infection and recovery processes are described by general independent distributions.

The rest of the paper is organised as follows. In the following section we introduce the MP method (Karrer and Newman 2010) and show how the epidemic model is constructed. We then go on to present the extension of the edge-based compartmental model (Miller et al. 2012) to SIR epidemics with general but independent distributions for time to transmission and duration of the infectious period. This section also contains the main result of the paper, namely, a full rigorous proof that MP model and the EBCM are equivalent, and hence, that the EBCM provides an exact representation of the average stochastic behaviour on the ensemble of infinite Configuration Model (CM) networks (Bender and Canfield 1978; Molloy and Reed 1995, 1998). Section 3 contains a re-parametrisation of the MP model in the special case of Markovian transmission. This proves to be a useful tool in showing how several well-known models can be derived from the MP model or the EBCM when additional assumptions about the network or recovery process are made. In Sect. 4, we compare numerical solutions of the mean-field models to averaged results from explicit stochastic network simulations. The paper concludes with a discussion of main results and possible directions for future research.

## 2 Model summary

### 2.1 The message passing (MP) method

*q*(

*a*) as the densities for transmission and duration of the infectious period one can introduce a new function

*f*(

*a*)

*t*is \(\int _{0}^{t} f(a) da\), since a neighbour can only transmit the disease if it has not yet recovered. Note that the integration of (1) over all time is the overall probability of an attempted transmission of the disease across a given network edge, commonly known as the

*transmissibility*of the disease. This is a quantity which is important in percolation models to determine the epidemic threshold and expected final epidemic size of a major outbreak (Newman 2002; Kenah and Robins 2007).

*u*. This node is placed into a cavity state where it can become infected but is not able to transmit the disease to any of its neighbours. This has no effect on the probability of the node being in any given state (Miller et al. 2012). Now consider a node

*v*which is a neighbour of

*u*; the

*message*is the probability that

*v*has

*not*attempted to transmit the disease to

*u*by calendar time

*t*, denoted \(H^{u \leftarrow v}(t)\). This probability is comprised of two distinct possibilities; the first possibility is that

*v*will make no attempt to transmit the disease before age

*t*, this is given by \(1 - \int _0^t f(a) \, da\). This means that even if

*v*is one of the initially infected nodes, it would not attempt to transmit to

*u*. Alternatively, it could be that

*v*will transmit to

*u*at some age \(a <t\), but

*v*itself was infected at some time \(t_1 > t - a\) and has, therefore, not yet attempted to transmit the disease to its neighbour

*u*. This requires

*v*to have initially been susceptible (with probability

*z*) and to have escaped transmission from each of its neighbours until at least time \((t-a)\). On a tree network with no loops, this is exactly \(z \int _0^t f(a)\prod _{w \in \mathcal {N}(v)\backslash u} H^{v \leftarrow w}(t-a) \,da\), where \(\mathcal {N}(v)\) denotes the set of neighbours of

*v*. Hence, combining these two gives

*t*. For example, the probability that

*u*is susceptible is the product of \(H^{u \leftarrow w}(t)\) across all neighbours \(w \in \mathcal {N}(u)\) multiplied by the probability that it was initially susceptible,

*z*. On a single fixed finite tree network, solving (2) for all edges will, in fact, yield the exact solution of the stochastic epidemic (Karrer and Newman 2010). The size of such a system of equations would be twice the number of all edges in the network (since both \(H^{u \leftarrow v}(t)\) and \(H^{v \leftarrow u}(t)\) would need to be calculated).

Throughout this paper we consider unweighted, bi-directional and static networks constructed according to the configuration model (CM). Every node is assigned a number of neighbours, known as its degree, according to a probability distribution \(p_k\), known as the *degree distribution*, that describes the probability that a randomly chosen node has degree *k*. Let us now focus on an ensemble of CM networks and consider an average message, \(H_1\), instead of considering distinct messages across every edge (Karrer and Newman 2010). For CM networks, as the size of the network tends to infinity, so does the length of the shortest loops, and, therefore, the network becomes locally tree-like. This means that the messages that a node receives from each of its neighbours are independent, and the average message received by the test node *u* is equal to the product of the average message for each neighbour.

*excess degree*of the node, its degree excluding the edge which connects it to the test node. The following moment generating functions average this product over the degree distribution

*excess degree distribution*, since \(kp_k/\langle {k} \rangle \) describes the probability that a node reached by traversing a randomly selected edge has \((k-1)\) other contacts (Newman 2002); the mean excess degree is given by \(G_2'(1)\). The moment generating function \(G_2(x)\) will be used to trace the route of infection in later models. Using \(G_1\) to replace the product in (2), the equation for the average message \(H_1(t)\) is

*q*(

*a*) are both exponential distributions), with transmission and recovery parameters \(\beta \) and \(\gamma \), leads to

*z*is the fraction of the population which was initially susceptible at time \(t=0\) (Karrer and Newman 2010). However, the precise form of this equation is not universal, it depends on the particular choice of \(\tau (a)\) and

*q*(

*a*). The proportions of susceptible, infected and recovered individuals at any time

*t*are then given, in terms of the message \(H_1(t)\), as

### 2.2 EBCM for general transmission and recovery processes

*q*(

*a*). Again, the EBCM uses the fact that the probability that the test node

*u*remains susceptible is the probability that

*u*escapes transmission from all of its neighbours. This concept is similar to the notion and use of \(H_1\) in MP models. Recovery is modelled using age-structured differential equations. However, the EBCM uses the instantaneous rates of transmission and recovery given by the

*hazard functions*rather than the raw densities \(\tau (a)\) and

*q*(

*a*). These are defined as

*survival functions*(see, e.g., Miller 2011).

*t*. As this test node is chosen at random, these probabilities are equal to the proportions of the population in each state at time

*t*, denoted

*S*(

*t*),

*I*(

*t*) and

*R*(

*t*), respectively.

*t*. This approach then differs from MP by directly expressing a differential equation for the dynamics of \(\varTheta \). The model is known as “edge-based” because it considers the state of the neighbours of the test node; the densities \(\Phi _S(t)\), \(\Phi _I(t)\) and \(\Phi _R(t)\) describe the probability that at time

*t*a random neighbour of the test node is (i) still susceptible, (ii) infected but has not attempted to transmit the disease to the test node, (iii) recovered, and did not transmit to the test node whilst it was infected. The age of infection is, in general, crucial in determining the hazard rates, and so we introduce

*i*(

*t*,

*a*) as the density of infected nodes with the age of infection

*a*. Similarly, \(\phi _I(t,a)\) is the density of infected neighbours who have not transmitted to the test node and have age

*a*. Thus, it is clear that \(I(t) = \int _0^t i(t,a) da\) and \(\Phi _I(t) = \int _0^t \phi _I (t,a) da\). These variables are summarised in Table 2. We also introduce the Dirac delta function as follows Gel’fand and Shilov (1964)

The variables and functions describing the transmission and recovery processes

Variable | Definition |
---|---|

\(\tau (a)\) | The density of the transmission process |

| The density of the duration of the infectious period |

\(\xi _{\tau }(a)\) | The |

\(\xi _{q}(a)\) | The |

\(\zeta (a)\) | The |

\(\rho (a)\) | The |

| The probability that, in a small interval, an infectious contact is made by an infected node of age |

| The probability that, in a small interval, an infectious node of age |

The list of variables in the EBCM

Variable | Definition |
---|---|

\(\varTheta (t)\) | The probability that the initially susceptible test node has not received a transmission from a random neighbour by time |

\(\Phi _S(t)\) | The probability that a random neighbour of the test node |

\(\Phi _I(t)\) | The probability that a random neighbour of the test node |

\(\phi _I(t,a)\) | The probability a random neighbour of the test node |

\(\Phi _R(t)\) | The probability a random neighbour of the test node |

| The density of susceptible nodes |

| The density of infected nodes |

| The density of infected nodes with age of infection |

| The density of recovered nodes |

\(G_1(x)\) | The generating function of the excess degree distribution: \(\frac{1}{\langle {k} \rangle }\sum _{k=0}^\infty p_k k x^{(k-1)}\) |

\(G_2(x)\) | The derivative of the generating function of the excess degree distribution: \(\frac{1}{\langle {k} \rangle }\sum _{k=0}^\infty p_k k(k-1) x^{(k-2)}\) |

*t*transmitting the disease, hence, we have

*t*and

*a*, and we have a second partial differential equation in the model

The new edge-based compartmental model (8) offers an alternative way to derive a system of equations that are able to characterise the dynamics of an epidemic outbreak. Although it seems more complex than the MP model, the EBCM is perhaps more intuitive, as many of the variables it involves relate directly to densities of nodes in different states and to the transitions between different states. The EBCM has also proven to be quite versatile and easily extendable to account for different scenarios. For instance, Miller et al. (2012) extended the original EBCM for static networks to dynamic networks where edges are deleted, created or rewired. It may be possible to use similar techniques to extend (8) to model diseases spreading through dynamic networks. To our knowledge, the MP model has so far not been extended beyond static networks, although it may be possible.

As the MP model (5) and the non-Markovian edge-based compartmental model (8) are based on the same underlying stochastic epidemic, it is natural to question how accurate and how similar they are. Karrer and Newman (2010) showed that the MP model (5) is exact on the ensemble of CM networks. Therefore, proving that the EBCM and MP model are equivalent will imply that the EBCM is exact under the same circumstances.

### 2.3 Model equivalence

We now present and prove the main result of this paper, that the edge-based compartmental and MP model are equivalent for any suitable choices of \(\tau (a)\) and *q*(*a*).

### Theorem 1

If \(\tau (a)\) and *q*(*a*) are independent, integrable probability density functions, then the MP model (5) and the EBCM (8) are equivalent, and will produce identical trajectories for any shared initial conditions.

### Proof

The proof consists of showing equivalence for two main elements: the messages for the respective models \(H_1(t)\) and \(\varTheta (t)\), and the densities of nodes in each state.

*f*(

*a*) in (1) and using (7), we obtain

*S*(

*t*) in (8g) and \(\langle {S} \rangle (t)\) in (5) differ only in that \(\Theta \) is replaced by \(H_1\), which are identical and thus interchangeable.

*t*

*a*is the same as the density of infected individuals created at time \(t-a\) multiplied by the survival probability for the duration of infection, \(\xi _q(a)\), i.e.

An implicit analytical relation for the final epidemic size can be found directly from (8). This result corresponds to well-known results based on tools from percolation theory (Newman 2002; Kenah and Robins 2007; Miller 2007), and to the final epidemic size obtained for MP models (Karrer and Newman 2010). It is given in the following corollary.

### Corollary 1

### Proof

Now that the equivalence between the edge-based compartmental and MP models has been established, we consider the special cases resulting from making extra assumptions about the network (e.g. fully connected and regular) and the infection (e.g. Markovian) and recovery processes (e.g. Markovian or infectious periods of fixed length). This is motivated by the observation that many earlier epidemic models are based on \(\tau (a)\), *q*(*a*) and/or \(p_k\) having the specific forms listed above.

In the following section we aim to produce a model hierarchy by recasting/reducing the EBCM or MP models to earlier models. However, it is not straightforward to see how such earlier models can be derived directly from the EBCM or MP model. This problem can be solved by a re-parametrisation of the MP model in the spirit of pairwise models, and, as a result, one can begin to build a hierarchy of models starting from the most general formulation.

## 3 Model hierarchy

Different model families (pairwise, effective degree, MP, EBCM etc.) emerge from different considerations of the same underlying stochastic process. In this section we aim to produce a model hierarchy on CM networks by showing that for specific choices of network topology or recovery process, many well-known models can be derived from the more general MP model. In particular, we will focus on deriving pairwise models (Wilkinson et al. 2017; Volz 2008; Keeling and Grenfell 1997; Kiss et al. 2015). In order to do this, we first present a general re-parametrisation of the MP model (5), and this will act as stepping stone or interpolation between the EBCM/MP and the well-known earlier models. Since all earlier models use a Markovian infection process, the re-parametrisation also uses this assumption.

Pairwise models are based on differential equations for the expected number of nodes in each state. These depend on the number of edges connecting susceptible and infected nodes, and so differential equations are constructed for the expected number of such edges, which themselves depend on the numbers of triples in certain states (e.g. susceptible-susceptible-infected). To break this dependence, a moment closure approximation is commonly used to express the number of triples in terms of pairs and individuals (Keeling 1999).

Recently, Wilkinson and Sharkey (2014) and Wilkinson et al. (2017) have shown that for regular tree networks exact pairwise models can be derived from the MP model when the transmission process is assumed to be Markovian. Here we use similar methods and the notation from Sect. 2.1 to extend this result to the class of CM networks.

*t*. This can be defined in terms of existing quantities from the MP model. The susceptible node must have been initially susceptible and escaped infection from all other neighbours until time

*t*, given by \(zG_1(H_1(t))\). This must be multiplied by the probability that the remaining neighbour of the susceptible node is infected and has not yet transmitted the disease to this neighbour. To find this probability it is easier to calculate all other possibilities and subtract them from one. These possibilities are: (i) the neighbour is still susceptible, (ii) the neighbour has already transmitted the disease, (iii) the neighbour was infected but has recovered without transmitting the disease. Combining these gives

*N*denotes the total size of the population.

At any time *t* the expected number of susceptibles can be found as \([S](t) = zN G_0(H_1(t))\). System (22a) has been derived directly from the MP model, and thus it becomes exact under the same conditions - on the ensemble of CM networks as the network size tends to infinity. Moreover, retaining the concept of the message, \(H_1\), has meant that system (22a) does not depend on higher order arrangements of nodes (e.g. triples). Therefore, unlike most pairwise models, no further approximations are required to close the model. Similar results have been achieved in the past using heuristic arguments (House and Keeling 2011).

This re-parametrised system (22a) is the first crucial step in being able to move from general to specific models on CM networks, with special focus on unifying various approaches by considering different models from the same perspective.

### 3.1 Degree-regular networks

*k*-regular (homogeneous) network, all nodes have the same degree, i.e. \(k_u = \langle {k} \rangle = k\), and so the generating functions from (3) simplify to

*S*](

*t*) follows directly from (5), and [

*SS*](

*t*) is defined as the number of edges connecting two nodes who were both initially susceptible at time \(t=0\) and have escaped infection from their \((k-1)\) other neighbours.

*I*] (20). Substituting the simpler generating functions yields

*S*] and [

*SS*] directly from (23). Using the new relations (25) and (27), system (24) can be rewritten to give

### 3.2 Special distributions of the infectious period

*q*(

*a*) is substituted into (20), we have

*a*, and since the number of infected nodes created

*a*time ago is \(\beta [SI](t-a)\) for \(a < t\) and \(N(1-z)\) for \(a=t\), (30) can be rewritten as

*SI*] edge to have survived until age

*a*without receiving transmission, either along this edge or from another infected neighbour. Therefore, by the same logic one can replace the final two terms in (22b) with \(\gamma [SI]\). This leads to a model, which, although formulated differently, is similar to models of Volz (2008) and House and Keeling (2011), namely,

*q*(

*a*) is chosen to be a delta distribution in (28) (although that original model did not explicitly account for the recovery of initially infected nodes).

Finally, it is worth briefly noting that in the case of a fully connected network, corresponding to a homogeneously well-mixed population we have that \([SI] = [S][I]\), and thus, the Markovian mass-action SIR model, which assumes that the population is unstructured, is recovered. Moreover, with the proper conditions, Wilkinson et al. (2017) proved that the message passing model is equivalent to the mass action model of Kermack and McKendrick (1927) for general transmission and recovery processes.

## 4 Numerical simulation results

In order to illustrate the accuracy of (22a), we compare the numerical solution of this model to results of direct stochastic network simulation. A common approach for simulating traditional Markovian models has been to use the Gillespie algorithm (Gillespie 1977). However, as modelling started to move away from the purely Markovian models, novel stochastic simulation methods have been derived (Anderson 2007; Boguná et al. 2014) which provide efficient simulation algorithms that are able to generate true sample paths of the stochastic process.

In this section we take advantage of the fact that in the system (22a) transmission is a Poisson process in order to use an algorithm similar to those described by Barrio et al. (2006). This approach is sometimes known as the rejection method and was proven to be stochastically exact by Anderson (2007). The transmission process is run as in the standard Gillespie algorithm; whenever a node becomes infected, a duration of infection is drawn from the distribution *q*(*a*); at each time step the time of next transmission is randomly generated, but if an infected node is scheduled to recover sooner, then the transmission event is rejected, and time is updated to the next recovery time (for full details see Anderson 2007).

In the very early stages of an outbreak stochastic effects dominate the dynamics of the epidemic spread, which means that numerical simulations can often produce results that significantly differ from deterministic predictions. In this situation, methods such as branching process approximations (Heesterbeek 2000) are more appropriate. To ensure that this does not affect our results, we allow every iteration of the algorithm to reach a point where the stochastic effects are no longer a concern, and the infected population behaves deterministically. In practice this is achieved by running each individual realisation of the epidemic from a single initial seed until a specified level of infectivity is reached, at which point time is reset to zero in both the simulation and the mean-field model.

A sufficient number of individual simulations are averaged to ensure that the mean behaviour of the stochastic model is correctly captured and is suitable for comparison with results derived from the deterministic models.

In Fig. 3 the results of numerical simulations are shown for three different distributions of the infectious period all having the same mean: a normal distribution, an exponential distribution, and a fixed infectious period. Two important observations can be made. Firstly, the excellent agreement between the average of simulations (markers) and the mean-field model (lines) provides empirical validation of the mean-field model. Secondly, Fig. 3 shows marked differences between the epidemics despite the mean of the infectious periods being the same. In particular, the exponential distribution leads to the slowest epidemic growth (and smallest epidemic peak) with the infectious periods of fixed length leading to the fastest growing epidemics (and largest epidemic peak). These results highlight the potential risks of using inaccurate modelling assumptions. The results also suggest that the variance in the duration of the infectious period has a significant effect on the time evolution of the epidemic: a decrease in variance leads to an increase in the initial growth rate (Kiss et al. 2015).

## 5 Discussion

In this paper we have reviewed the message passing formalism for SIR epidemics on networks, and introduced a novel extension of the edge-based compartmental model to the case of general but independent transmission and recovery processes. Both of these models are capable of accurately describing the expected dynamics of non-Markovian epidemics on tree networks. The main result of the paper is the complete and rigorous of equivalence between these models, and, as a result, the non-Markovian EBCM (8) is exact on the ensemble of infinite-size CM networks.

Adapting recent methods (Wilkinson and Sharkey 2014; Wilkinson et al. 2017) enabled us to re-parametrise the MP model for the special case of a Markovian transmission process but arbitrary CM networks. The compact model (22a) remains exact and is, in fact, a hybrid between MP and classical pairwise models.

Many pairwise models are defined heuristically (Eames and Keeling 2002; Gross et al. 2006; House and Keeling 2011), but by deriving model (22a) as a re-parametrisation of the MP model we have developed a general model from which existing pairwise models can be extracted. By demonstrating this we hope to provide some intuition for how these newer models work and to illustrate that they build on existing models whilst providing a modern twist. It is encouraging that such mean-field models remain relatively compact, highlighting that the SIR epidemic can be modelled quite effectively, as long as a small number of key characteristics of the network and the epidemic process are known.

The results from our numerical simulations illustrate the dangers of using inaccurate or overly simplistic data to make predictions, in particular, the common assumption of fully Markovian dynamics. The MP and non-Markovian edge-based compartmental models are, therefore, crucial if we are to develop accurate epidemic models on networks.

Numerous extensions of the present work are possible. For example, the implementation of an efficient solver of the novel EBCM is still outstanding. Efficient numerical methods to solve such age-structured models exist, but this was outside the scope of our study. In some sense the novel EBCM is the most complete mean-field model when one considers SIR epidemics on CM networks. This is due to the model being able to handle arbitrary degree distributions, as well as general independent transmission and recovery processes. Additionally, it could be refined to account for dynamic or adaptive contacts. Dynamic networks have already been incorporated in edge-based modelling in the purely Markovian setting (Miller et al. 2012), and it may be possible to extend this to a more general framework to allow for a more unified treatment of models that include the concurrent spread of the disease and link turnover.

## Notes

### Acknowledgements

N. Sherborne acknowledges funding for his PhD studies from the EPSRC (Engineering and Physical Sciences Research Council), EP/M506667/1, and the University of Sussex.

## References

- Anderson DF (2007) A modified next reaction method for simulating chemical systems with time dependent propensities and delays. J Chem Phys 127(21):214107CrossRefGoogle Scholar
- Bailey NTJ (1954) A statistical method of estimating the periods of incubation and infection of an infectious disease. Nature 174(4420):139–140CrossRefGoogle Scholar
- Barrio M, Burrage K, Leier A, Tian T (2006) Oscillatory regulation of Hes1: discrete stochastic delay modelling and simulation. PLoS Comput Biol 2(9):e117CrossRefGoogle Scholar
- Bender EA, Canfield ER (1978) The asymptotic number of labeled graphs with given degree sequences. J Comb Theory A 24(3):296–307MathSciNetCrossRefMATHGoogle Scholar
- Boguná M, Lafuerza LF, Toral R, Serrano MÁ (2014) Simulating non-Markovian stochastic processes. Phys Rev E 90(4):042108CrossRefGoogle Scholar
- Danon L, Ford AP, House T, Jewell CP, Keeling MJ, Roberts GO, Ross JV, Vernon MC (2011) Networks and the epidemiology of infectious disease. Interdiscip Perspect Infect Dis 2011:284909Google Scholar
- Eames KT, Keeling MJ (2002) Modeling dynamic and network heterogeneities in the spread of sexually transmitted diseases. Proc Nat Acad Sci 99(20):13330–13335CrossRefGoogle Scholar
- Gel’fand I, Shilov G (1964) Generalized functions, vol 1. Academic Press, New YorkMATHGoogle Scholar
- Gillespie DT (1977) Exact stochastic simulation of coupled chemical reactions. J Phys Chem 81(25):2340–2361CrossRefGoogle Scholar
- Gough K (1977) The estimation of latent and infectious periods. Biometrika 64(3):559–565MathSciNetCrossRefMATHGoogle Scholar
- Gross T, D’Lima CJD, Blasius B (2006) Epidemic dynamics on an adaptive network. Phys Rev Lett 96(20):208701CrossRefGoogle Scholar
- Heesterbeek J (2000) Mathematical epidemiology of infectious diseases: model building, analysis and interpretation, vol 5. Wiley, New YorkMATHGoogle Scholar
- House T, Keeling MJ (2011) Insights from unifying modern approximations to infections on networks. J R Soc Interface 8(54):67–73CrossRefGoogle Scholar
- Karrer B, Newman ME (2010) Message passing approach for general epidemic models. Phys Rev E 82(1):016101MathSciNetCrossRefGoogle Scholar
- Keeling MJ (1999) The effects of local spatial structure on epidemiological invasions. Proc R Soc B 266(1421):859–867CrossRefGoogle Scholar
- Keeling MJ, Eames KT (2005) Networks and epidemic models. J R Soc Interface 2(4):295–307CrossRefGoogle Scholar
- Keeling MJ, Grenfell B (1997) Disease extinction and community size: modeling the persistence of measles. Science 275(5296):65–67CrossRefGoogle Scholar
- Kenah E, Robins JM (2007) Second look at the spread of epidemics on networks. Phys Rev E 76(3):036113MathSciNetCrossRefGoogle Scholar
- Kermack WO, McKendrick AG (1927) A contribution to the mathematical theory of epidemics. Proc R Soc Lond A 115(772):700–721CrossRefMATHGoogle Scholar
- Kiss IZ, Röst G, Vizi Z (2015) Generalization of pairwise models to non-Markovian epidemics on networks. Phys Rev Lett 115:078701CrossRefGoogle Scholar
- Kiss IZ, Miller JC, Simon PL (2017) Mathematics of epidemics on networks: from exact to approximate models. Springer, New YorkGoogle Scholar
- Lindquist J, Ma J, Van den Driessche P, Willeboordse FH (2011) Effective degree network disease models. J Math Biol 62(2):143–164MathSciNetCrossRefMATHGoogle Scholar
- Miller JC (2007) Epidemic size and probability in populations with heterogeneous infectivity and susceptibility. Phys Rev E 76:010101CrossRefGoogle Scholar
- Miller RG (2011) Survival analysis, vol 66. Wiley, New YorkGoogle Scholar
- Miller JC, Kiss IZ (2014) Epidemic spread in networks: existing methods and current challenges. Math Model Nat Phenom 9(2):4–42MathSciNetCrossRefMATHGoogle Scholar
- Miller JC, Slim AC, Volz EM (2012) Edge-based compartmental modelling for infectious disease spread. J R Soc Interface 9(70):890–906CrossRefGoogle Scholar
- Molloy M, Reed B (1995) A critical point for random graphs with a given degree sequence. Random Struct Algorithms 6(2–3):161–180MathSciNetCrossRefMATHGoogle Scholar
- Molloy M, Reed B (1998) The size of the giant component of a random graph with a given degree sequence. Comb Probab Comput 7(03):295–305MathSciNetCrossRefMATHGoogle Scholar
- Newman ME (2002) Spread of epidemic disease on networks. Phys Rev E 66(1):016128MathSciNetCrossRefGoogle Scholar
- Pastor-Satorras R, Vespignani A (2001) Epidemic spreading in scale-free networks. Phys Rev Lett 86(14):3200–3203CrossRefGoogle Scholar
- Pastor-Satorras R, Castellano C, Van Mieghem P, Vespignani A (2015) Epidemic processes in complex networks. Rev Mod Phys 87(3):925MathSciNetCrossRefGoogle Scholar
- Röst G, Vizi Z, Kiss IZ (2016) Pairwise approximation for SIR type network epidemics with non-Markovian recovery. arXiv:1605.02933
- Taylor TJ, Kiss IZ (2014) Interdependency and hierarchy of exact and approximate epidemic models on networks. J Math Biol 69(1):183–211MathSciNetCrossRefMATHGoogle Scholar
- Volz E (2008) SIR dynamics in random networks with heterogeneous connectivity. J Math Biol 56(3):293–310MathSciNetCrossRefMATHGoogle Scholar
- Wearing HJ, Rohani P, Keeling MJ (2005) Appropriate models for the management of infectious diseases. PLoS Med 2(7):e174CrossRefGoogle Scholar
- Wilkinson RR, Sharkey KJ (2014) Message passing and moment closure for susceptible-infected-recovered epidemics on finite networks. Phys Rev E 89(2):022808CrossRefGoogle Scholar
- Wilkinson RR, Ball FG, Sharkey KJ (2017) The relationships between message passing, pairwise, Kermack–McKendrick and stochastic SIR epidemic models. J Math Biol. doi: 10.1007/s00285-017-1123-8

## Copyright information

**Open Access**This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.