Abstract
We consider a very general stochastic model for an SIR epidemic on a network which allows an individual’s infectious period, and the time it takes to contact each of its neighbours after becoming infected, to be correlated. We write down the message passing system of equations for this model and prove, for the first time, that it has a unique feasible solution. We also generalise an earlier result by proving that this solution provides a rigorous upper bound for the expected epidemic size (cumulative number of infection events) at any fixed time \(t>0\). We specialise these results to a homogeneous special case where the graph (network) is symmetric. The message passing system here reduces to just four equations. We prove that cycles in the network inhibit the spread of infection, and derive important epidemiological results concerning the final epidemic size and threshold behaviour for a major outbreak. For Poisson contact processes, this message passing system is equivalent to a nonMarkovian pair approximation model, which we show has wellknown pairwise models as special cases. We show further that a sequence of message passing systems, starting with the homogeneous one just described, converges to the deterministic Kermack–McKendrick equations for this stochastic model. For Poisson contact and recovery, we show that this convergence is monotone, from which it follows that the message passing system (and hence also the pairwise model) here provides a better approximation to the expected epidemic size at time \(t>0\) than the Kermack–McKendrick model.
Introduction
One of the earliest and most comprehensively analysed epidemic models is the susceptibleinfectedrecovered (SIR) model of Kermack and McKendrick (1927). In addition to providing insights into threshold behaviour and vaccination, it has also underpinned much subsequent work in applied mathematical epidemiology (Anderson and May 1992). A stochastic version, constructed from similar assumptions, was defined and analysed later (for example, Bailey 1975, Chapter 6) and it became of interest to understand the relationship between the two (Kurtz 1970, 1971; Barbour 1972, 1974).
More recently, various heterogeneities have been added to both deterministic and stochastic epidemic models. A particularly important one is the contact network which allows for specific relationships between pairs of individuals; see Danon et al. (2011) and PastorSatorras et al. (2015) for reviews. While it is straightforward to simulate stochastic epidemics on networks, deterministic approximations have also been developed to assist our understanding. Important examples of these include pair approximation (Keeling 1999; Sharkey 2008), message passing (Karrer and Newman 2010) and edgebased models (Miller et al. 2011).
The message passing approximation for stochastic epidemics was developed by Karrer and Newman (2010) and is central to the work that we present here. This approach allows one to exactly capture the marginal distributions for the health statuses of individuals (i.e whether they are susceptible, infected or recovered) when the contact network is a tree and provides useful rigorous bounds for these distributions otherwise. Notably, the message passing approach is also applicable to extremely general nonMarkovian stochastic epidemics and the number of equations it requires scales linearly with the number of connected pairs of individuals; far fewer than the number of Kolmogorov forward equations for the Markovian case which scales exponentially with population size. Wilkinson and Sharkey (2014) showed that, when contact processes are assumed to be Poisson, a generalised version of the message passing equations is equivalent to a pairwise model that is defined at the level of individuals, thus unifying two major representations of epidemic dynamics. Their argument relies on the application of Leibniz’s integral rule, so here we take the opportunity to provide sufficient conditions for the applicability of that rule in this context (“Appendix 4”).
In Sect. 2 we define a more general stochastic model which allows for realistic correlations between contact times and infectious periods. Specifically, it allows all of an individual’s postinfection contact times (to each of its neighbours), and the negative of its infectious period, to be positively correlated. This could capture, for example, a scenario where infected individuals adopt some diseasecombating behaviour such as taking antiviral medication, increasing the infectious contact times to all of their neighbours and decreasing their infectious period. We write down the message passing system for this stochastic model in Sect. 2.1 and then, for the first time, provide a nonrestrictive sufficient condition for the message passing equations to have a unique feasible solution (Theorem 1). This is important because so far, the message passing construction of Karrer and Newman has not been shown to give rise to a unique epidemic. We then, in Sect. 2.2, extend the results found in Karrer and Newman (2010) and Wilkinson and Sharkey (2014) to this more general stochastic model; for example, the message passing system cannot underestimate the expected epidemic size at any time \(t>0\), i.e. the expected number of susceptibles infected during (0, t] (Theorem 2; Corollary 1). This is what led Karrer and Newman to describe the message passing system as providing a ‘worst case scenario’.
For all of Sect. 3, we focus on a special case of the above stochastic model which assumes a contact structure with a large amount of symmetry and that all individuals behave in the same way. We refer to this special case as the ‘homogeneous stochastic model’. The corresponding message passing system is written down in Sect. 3.1 and, after exploiting symmetries, this reduces to a system comprising of only four equations which we refer to as the ‘homogeneous message passing system’. This system is identical in form to a special case of the equations formulated by Karrer and Newman (2010, equations 26 and 27), although here it is related to a different stochastic model. We then obtain several epidemiologically relevant results in Sect. 3.2: the stochastic epidemic is shown to be inhibited by cycles in the contact network (Theorem 3), a simple relation for an upper bound on the final epidemic size in the stochastic model is proved and sufficient conditions for no major outbreak in the stochastic model are found (Theorem 4). The latter gives an upper bound on the critical vaccination coverage to prevent a major outbreak, assuming a perfect vaccination.
As a special case of the general correspondence shown in Wilkinson and Sharkey (2014), the homogeneous message passing system has an equivalent nonMarkovian pairwise model when the contact processes are Poisson. In Sect. 3.3 we write down these equations explicitly (Theorem 5). This pairwise model provides exactly the same epidemic time course as the homogeneous message passing system and hence exactly the same upper bound on the epidemic size at time t (Corollary 2), and gives the same final epidemic size (Corollary 3). Pairwise models are known to give good approximations of stochastic epidemic dynamics on networks in a broad range of cases [see, for example, Keeling (1999) and Sharkey (2008)]. Thus the proof of equivalence when contact processes are Poisson suggests that message passing provides a good approximation as well as useful bounds.
In Sect. 3.4, we derive the classic Kermack–McKendrick epidemic model as an asymptotic special case of the homogeneous message passing system (Theorem 6). Notably, our derivation of such ‘deterministic’ epidemic models from the homogeneous message passing system allows us to relate them explicitly to the stochastic model [see also, for example, Trapman (2007) and Barbour and Reinert (2013)]. Thus, we are able to show that in the case where contact and recovery processes are independent and Poisson, the Kermack–McKendrick model bounds the expected epidemic size at time t in the homogeneous stochastic model (Corollary 4). However, the bound is coarser than that provided by the homogeneous message passing system and the pairwise system, which therefore give a better approximation than the Kermack–McKendrick model. The paper ends with a brief discussion in Sect. 4.
The stochastic model (nonMarkovin networkbased SIR dynamics)
We define a very general class of networkbased stochastic epidemics which allow heterogeneous and nonPoisson individuallevel processes, and heterogeneity in the initial states of individuals (including the case where the initial states of all individuals are nonrandom).
Let \(G=({\mathcal {V}},{\mathcal {E}})\) be an arbitrary (possibly countably infinite) simple, undirected graph, where \({\mathcal {V}}\) is the set of vertices (individuals) and \({\mathcal {E}}\) is the set of undirected edges between vertices (throughout the paper we will use the terms ‘graph’, ‘network’ and ‘contact network’ interchangeably). For \(i \in {\mathcal {V}}\), let \({\mathcal {N}}_i=\{ j \in {\mathcal {V}} : (i,j) \in {\mathcal {E}} \}\) be the set of neighbours of i and let \({\mathcal {N}}_i<\infty \). We assume that two individuals are neighbours if and only if at least one can make direct contacts to the other. A particular realisation of the stochastic model is specified as follows. Each individual/vertex \(i \in {\mathcal {V}}\) is assigned a set of numbers \({\mathcal {X}}_i\) relevant to the behaviour of i and the spread of the epidemic:
where \(Y_i\) is equal to 1, 2, or 3, according to whether i is instantaneously infected at \(t=0\), initially susceptible or initially recovered/vaccinated, these being mutually exclusive; \(\mu _i \in [0,\infty ]\) is i’s infectious period if i is ever infected; \(\omega _{ji} \in [0, \infty ]\) is the time elapsing between i first becoming infected and it making a contact to j, if i is ever infected. Therefore, for \(t \ge 0\), i makes an infectious contact to j at time t if and only if (i) i becomes infected at some time \(s \le t\), (ii) \(\omega _{ji}=ts\), and (iii) \(\omega _{ji}< \mu _i\). Susceptible individuals become infected as soon as they receive an infectious contact, and infected individuals immediately become recovered when their infectious period terminates (initially recovered/vaccinated individuals never become infected). We let \({\mathcal {X}}= \cup _{i \in {\mathcal {V}}} {\mathcal {X}}_i\). Thus, the state of the population at time \(t \in [0, \infty )\), which takes values in \(\{S,I,R\}^{{\mathcal {V}}}\), is a function of \({\mathcal {X}}\).
The situation which we wish to consider is where \({\mathcal {X}}\) is a set of random variables, so from now on we refer to \(Y_i, \mu _i, \omega _{ji}\), where \(i \in {\mathcal {V}}, j \in {\mathcal {N}}_i\), as random variables. We use \(r_i\) and \(h_{ij}\) to denote the (marginal) probability density functions (PDFs) for \(\mu _i\) and \(\omega _{ij}\) respectively, and \(z_i\) and \(y_i\) to denote \(\mathrm{P}(Y_i=2)\) and \(\mathrm{P}(Y_i=3)\) respectively. Thus, \(\mathrm{P}(Y_i=1)=1y_iz_i\). The probability that individual \(i \in {\mathcal {V}}\) is in state \(Z \in \{S,I,R\}\) at time \(t \ge 0\) is denoted by \(P_{Z_i}(t)\).
Importantly we assume that for every \(i \in {\mathcal {V}}\),
is a set of associated random variables, as defined by Esary et al. (1967) and discussed in this context by Donnelly (1993) and Ball et al. (2015). Additionally, we assume that the set of multivariate random variables \(\{ {\mathcal {X}}_i: i \in {\mathcal {V}}\}\) is mutually independent, and that \(Y_i\) and \({\mathcal {X}}_i^*\) are independent for all \(i \in {\mathcal {V}}\). A finite set of random variables, \(T_1, T_2,\dots ,T_n\) say, is associated (or positively correlated) if
for all nondecreasing realvalued functions f, g for which the expectations in (1) exist. Note that (1) implies that the correlation of any pair of these random variables is positive (i.e. \(\ge 0\)). Further, if \(T_1, T_2,\dots ,T_n\) are mutually independent, then they are associated; see Esary et al. (1967, Theorem 2.1).
The above assumptions of association and independence are made so as to obtain the maximum amount of generality while the message passing and pairwise systems, which we shall define, give rigorous bounds on the expected dynamics in the stochastic model, and exact correspondence when the graph is a tree or forest.
Our stochastic model represents a generalisation of that considered by Karrer and Newman (2010), and also generalises the model considered by Wilkinson and Sharkey (2014), which assumed that all of the elements of \({\mathcal {X}}\) are mutually independent. Here, we do not make this last assumption and allow all of an individual’s postinfection contact times (to each of its neighbours), and the negative of its infectious period, to be positively correlated. This could capture, for example, the scenario where infected individuals tend to adopt some diseasecombating behaviour, increasing the contact times to all of their neighbours and decreasing their infectious period.
The model considered by Wilkinson and Sharkey (2014), which incorporates a directed graph, is equivalent to a special case of the above model. Directedness is still captured by the above model since, for any given \(i \in {\mathcal {V}}\) and \( j \in {\mathcal {N}}_i\), \(\omega _{ij}\) and \(\omega _{ji}\) are assigned independently.
The message passing system and its unique solution
Following Wilkinson and Sharkey (2014), we apply the message passing approach of Karrer and Newman (2010) to the stochastic model defined in Sect. 2. Recall that message passing relies on the concept of the cavity state in order to simplify calculations. An individual is placed into the cavity state by cancelling its ability to make contacts. This does not affect its own fate but it does affect the fates of others because it cannot pass on the infection.
For arbitrary \(i \in {\mathcal {V}}\) and neighbour \(j \in {\mathcal {N}}_i\), let \(H^{i \leftarrow j}(t)\) denote the probability that i, when in the cavity state, does not receive an infectious contact from j by time t. We can now write:
where \(f_{ij}(\tau ) \varDelta \tau = h_{ij}(\tau ) P(\mu _j > \tau \mid \omega _{ij}= \tau ) \varDelta \tau \) is the probability (\(+o(\varDelta \tau )\)) that j makes an infectious contact to i during the time interval \([\tau ,\tau + \varDelta \tau )\) (for \(\varDelta \tau \rightarrow 0\)), where time \(\tau \) is measured from the moment j becomes infected, and \(\varPhi _i^j(t)\) is the probability that j does not receive any infectious contacts by time t when i and j are both in the cavity state. Note that although the stochastic model considered here is more general, \(H^{i \leftarrow j}(t)\) may still be expressed, as in (2), similarly to equation 1 in Wilkinson and Sharkey (2014), because \(\{{\mathcal {X}}_i: i \in {\mathcal {V}}\}\) is mutually independent and \(Y_i\) is independent from \({\mathcal {X}}_i^*\) for all \(i \in {\mathcal {V}}\).
To obtain a solvable system, the probability \(H^{i \leftarrow j}(t)\) is approximated by \(F^{i \leftarrow j}(t)\), where \(F^{i \leftarrow j}(t) \, \, (i \in {\mathcal {V}}, j \in {\mathcal {N}}_i)\) satisfies
Any solution of (3) which gives \(F^{i \leftarrow j}(t) \in [0,1]\) for all \(t \ge 0\), and all \(i \in {\mathcal {V}} , j \in {\mathcal {N}}_i\), is called feasible. It was shown by Wilkinson and Sharkey (2014), following Karrer and Newman (2010), that a feasible solution exists as the limit of an iterative procedure.
The message passing system can now be defined (for \( i \in {\mathcal {V}}\)):
where the variables on the lefthand side approximate \(P_{S_i}(t)\), \(P_{I_i}(t)\) and \(P_{R_i}(t)\) respectively (recall that \(P_{S_i}(t)\), \(P_{I_i}(t)\) and \(P_{R_i}(t)\) are respectively the probability that individual i is susceptible, infective and recoveredorvaccinated at time t). Numerical evidence for the effectiveness of the message passing system, in capturing the expected dynamics of the stochastic model, can be seen in Figures 1 and 2 of Wilkinson and Sharkey (2014).
Note that the dimension of the message passing system (3)(6) is appreciably smaller than that of the Kolomogorov forward equations for the case where the dynamics are Markovian. Suppose that \({\mathcal {V}}=N\). Then the forward equations have dimension \(3^N\) and the message passing system has dimension at most \(N(N1)+3N\). In many cases, symmetries can be exploited to reduce the dimension of both the forward equations, see e.g. Simon et al. (2011), and the message passing system. However, the message passing system is still typically much smaller and can be very small, as in the model studied in Sect. 3.
Theorem 1
(Uniqueness of the feasible solution of the message passing system) Assume that
Then there is a unique feasible solution of Eqs. (3)–(6) and the feasible \(F^{i \leftarrow j}(t)\) are continuous and nonincreasing for all \(i \in {\mathcal {V}}, j \in {\mathcal {N}}_i\).
Proof
See “Appendix 1”. \(\square \)
It was shown by Wilkinson and Sharkey (2014) that when the graph is finite and \(f_{ij}(\tau )=T_{ij} \mathrm{e}^{ T_{ij} \tau } \int _{\tau }^{\infty } r_j(\tau ') \text{ d } \tau ' \, \, (i \in {\mathcal {V}}, j \in {\mathcal {N}}_i)\), where \(T_{ij} \in (0, \infty )\), i.e. contact processes are Poisson and independent of recovery processes, then the message passing system (3)–(6) is equivalent to an individuallevel pairwise system of integrodifferential equations. It now follows that this pairwise system of equations also has a unique feasible solution.
The message passing system (3)–(6), which coincides with that given in Wilkinson and Sharkey (2014) although the underlying model here is more general, differs from the message passing system in Karrer and Newman (2010) in that the probability an individual is initially infected need not be the same for all individuals, and individuals may be initially recovered or vaccinated. The system (3)–(6) also accounts for heterogeneity in the recovery and contact processes. A key use of message passing equations is that they yield a rigorous upper bound for the mean spread in the underlying stochastic epidemic. In the next subsection, we show that this property extends to our more general model.
Bounding the expected epidemic size at time \(\varvec{t}\)
For \(t \ge 0\), let X(t) denote the number of susceptibles at time t. Thus, \(X(0)X(t)\) is the total number of individuals infected by time t not counting those infected at \(t=0\). We refer to this quantity as the epidemic size at time t.
Theorem 2
(Message passing bounds the marginal distribution for the health status of an individual) For all \(t \ge 0\) and all \(i \in {\mathcal {V}}\),
with equality if G is a tree or forest.
Proof
In the case where \({\mathcal {X}}\) is mutually independent and \({\mathcal {V}}\) is finite, this is proved by Wilkinson and Sharkey (2014) and Ball et al. (2015) by generalising Karrer and Newman (2010). The proof for our current more general model is in “Appendix 2”. \(\square \)
For \(t \ge 0\), let Z(t) denote the number of recoveredorvaccinated individuals at time t. The following corollary follows immediately from Theorem 2 on noting that, for \(t \ge 0\),
Corollary 1
For all \(t \ge 0\), we have \(\mathrm{E}[X(t)] \ge \sum _{i}S^{(i)}_{\text {mes}}(t)\) and \(\mathrm{E}[Z(t)] \le \sum _{i}R^{(i)}_{\text {mes}}(t)\), with equality occurring when the graph is a tree or forest. The expected epidemic size at time t is given by \(E[X(0)X(t)]=\sum _{i \in {\mathcal {V}}}z_i  E[X(t)]\). Thus, since we have a lower bound on E[X(t)] we also have an upper bound on the expected epidemic size at time t.
The homogeneous stochastic model
In this section we consider a special case of the stochastic model, and we refer to this special case as ‘the homogeneous stochastic model’. In the homogeneous stochastic model, the graph is symmetric and connected. Examples of symmetric connected graphs include complete graphs, ring lattices, infinite square lattices and Bethe lattices. In a symmetric graph, each individual has the same (finite) number n of neighbours, and we say that the graph is nregular. To avoid triviality we assume \(n \ge 2\).
Definition 1
A graph \(G=({\mathcal {V}},{\mathcal {E}})\) is called symmetric if it is arctransitive; i.e. for any two ordered pairs of neighbours i, j, and \(i',j'\), there exists a graphautomorphism which maps i to \(i'\) and j to \(j'\) (Godsil and Royle 2001).
Additionally, in the homogeneous stochastic model, the joint distribution of \((Y_i, \mu _i , \omega _{j i}(j \in {\mathcal {N}}_i))\) is symmetric in its last n arguments and is the same for all \(i \in {\mathcal {V}}\). Thus, it is impossible to distinguish between any two individuals by their behaviour or by their position in the graph. Note that we have not precluded the variables in \({\mathcal {X}}_i^*\) from being nontrivially associated (for all \(i \in {\mathcal {V}}\)), i.e. i’s infectious period and the time it takes for it to contact each of its neighbours, after infection, may all be nontrivially correlated.
We use r and h to denote the (marginal) PDFs for \(\mu _i\) and \(\omega _{ij}\) respectively, and z and y to denote \(\mathrm{P}(Y_i=2)\) and \(\mathrm{P}(Y_i=3)\) respectively. Thus, \(\mathrm{P}(Y_i=1)=1yz\). To avoid triviality, we assume that \(0<z<1\) and \(0 \le y<1z\).
Owing to symmetry (in this special case), the probability distribution for the health status of an individual is the same for all individuals, i.e. for all \(i,i' \in {\mathcal {V}}\) and all \(t \ge 0\), we have \(P_{S_i}(t)=P_{S_{i'}}(t), P_{I_i}(t)=P_{I_{i'}}(t)\) and \(P_{R_i}(t)=P_{R_{i'}}(t)\) (let \(P_S(t), P_I(t)\) and \(P_R(t)\) denote these quantities). Similarly, for all \(i \in {\mathcal {V}}, j \in {\mathcal {N}}_i\) and all \(i' \in {\mathcal {V}}, j' \in {\mathcal {N}}_{i'}\), and all \(t \ge 0\), we have \(H^{i \leftarrow j}(t)= H^{i' \leftarrow j'}(t)\) (let \(H_{\text {sym}}(t)\) denote this quantity).
The homogeneous message passing system
For the homogeneous stochastic model, (3) becomes
where we have used \(f_{ij}(\tau )=f_{i'j'}(\tau )\) for all \(i \in {\mathcal {V}}, j \in {\mathcal {N}}_i\), and all \(i' \in {\mathcal {V}}, j \in {\mathcal {N}}_{i'}\), and all \(\tau \ge 0\), and we let \(f(\tau )\) denote this quantity.
The arctransitivity of symmetric graphs and the symmetry in (9) allow us to simplify (3)–(6), and to write down the full homogeneous message passing system as:
where
In deriving these equations, we have used \(F^{i \leftarrow j}(t)= F^{i' \leftarrow j'}(t)\) for all \(i \in {\mathcal {V}}, j \in {\mathcal {N}}_i\) and all \(i' \in {\mathcal {V}}, j' \in {\mathcal {N}}_{i'}\), and all \(t \ge 0\), and we let \( F_{\text {sym}}(t)\) denote this quantity. Note that we have also made use of the fact that every individual has n neighbours. This system is identical in form (when vaccination is disallowed) to the message passing system for the configuration network model provided by Karrer and Newman (2010, equations 26 and 27, making use of equations 1, 4 and 5), in the case where every individual has n neighbours with probability 1. From Theorem 1, we know that if \(\sup _{\tau \ge 0} f(\tau ) < \infty \) then (13) has a unique feasible solution.
For clarity we write out these equations for the simplifying cases of Poisson transmission and recovery processes, and Poisson transmission and fixed (nonrandom) recovery.
Example 1
(Poisson transmission and recovery) For independent Poisson transmission and recovery processes (specifically, \({\tau }_i\) and \({\omega }_{ji}\) are independent and exponentially distributed with rates \(\gamma \) and \(\beta \) respectively), with \(f(\tau )=\beta \mathrm{e}^{(\beta + \gamma ) \tau }\), the homogeneous message passing system can be solved via the following ordinary differential equations (ODEs):
with \(S_{\text {mes}}(t)\) and \(I_{\text {mes}}(t)\) given by (10) and (11).
Example 2
(Poisson transmission and fixed recovery) For Poisson transmission processes and a fixed recovery period (specifically, \(\tau _i\) is nonrandom with value \(R \in [0, \infty ]\) and \({\omega }_{ji}\) is exponentially distributed with rate \(\beta \)), with \(f(\tau )=\beta \mathrm{e}^{ \beta \tau }(1 \theta (tR))\) where \(\theta \) is the Heaviside step function, the homogeneous message passing system can be solved using the following delay differential equation:
with
and \(S_{\text {mes}}(t)\) and \(I_{\text {mes}}(t)\) given by (10) and (11).
Other choices of \(f(\tau )\) exist which allow the message passing system to be solved via (nonintegro) differential equations, such as the top hat function (Karrer and Newman 2010, equation 33).
Epidemiological results
As well as bounding/approximating (or correctly computing in the case of an infinite regular tree) the expected fractional epidemic size at time \(t \ge 0\), the homogeneous message passing system generates other epidemiologically relevant results for the stochastic model, as demonstrated here.
Theorem 3
(Cycles in the network inhibit the stochastic epidemic) Suppose that \(\sup _{\tau \ge 0}f(\tau ) < \infty \). The probability of an arbitrary individual being susceptible at a given time, for the nregular Bethe lattice (infinite tree), is less than or equal to this quantity for all other nregular symmetric graphs (where the homogeneous stochastic model is otherwise unchanged). The same holds for the probability of an arbitrary individual being recovered except with the inequality reversed.
Proof
From Theorem 2, we know that system (10)–(13) cannot overestimate the probability of an arbitrary individual being susceptible at time t and cannot underestimate the probability of an arbitrary individual being recovered at time t. However, also from Theorem 2, the system is exact if the graph is a tree. \(\square \)
Theorem 3 suggests that, all other things being equal, an infection will have the greatest impact by time t when the contact structure is most treelike. Indeed, it is known that clustering and the presence of cycles in the graph may slow down and limit the spread of an infection (see Miller (2009) and references therein).
Theorem 4
(Final epidemic size relation and sufficient conditions for no major outbreak) For all \(t \ge 0\),
where \(S_{\text {mes}}(\infty ) \equiv \lim _{t \rightarrow \infty }S_{\text {mes}}(t)\) may be computed as the unique solution in [0, z] of
with \(p \equiv \int _0^{\infty } f(\tau ) \text{ d } \tau \), and \(R_{\text {mes}}(\infty )=1S_{\text {mes}}(\infty )\).
Further, when the fraction initially infected is small, i.e. \(z \rightarrow 1  y\) from below, then
where \(R_0 \equiv (n1)p\). (This means that if each individual is independently vaccinated with probability greater than or equal to \(1 1/ R_0\), or if \(R_0 \le 1\), then a major outbreak of the disease is impossible.)
Proof
Equation (18) follows from Theorem 2 and the observation that \(P_S(t)\) and \(P_R(t)\) are nonincreasing and nondecreasing respectively.
The feasible \(F_{\text {sym}}(t)\) is nonincreasing (see Theorem 1), so it converges to some \(F_{\text {sym}}(\infty ) \in [0,1]\) as \(t \rightarrow \infty \). Note also that, by definition, \(\int _0^t f(\tau ) \text{ d } \tau \) converges to \(p \in [0,1]\) as \(t \rightarrow \infty \). Now, using (13), we can write \(F_{\text {sym}}(t)=1\int _0^{\infty } f_t(\tau ) \text{ d } \tau \), where \(f_t(\tau )=f(\tau )(1yz F_{\text {sym}}(t\tau )^{n1})\) for \(\tau \in [0,t]\) and is equal to zero for \(\tau >t\). Note that \(f_t(\tau )\) converges pointwise to \(f(\tau )(1yz F_{\text {sym}}(\infty )^{n1})\) as \(t \rightarrow \infty \). Thus, since \(0 \le f_t(\tau ) \le f(\tau )\) for all \(t, \tau \ge 0\), we can use the dominated convergence theorem to obtain, c.f. Karrer and Newman (2010, equations 23 and 24),
Taking the limit as \(t \rightarrow \infty \) in (10), and making use of (21), proves equation (19). It is straightforward to show by graphical means that (19) has a unique solution in [0, z]. In the case where \(z \rightarrow 1y\) from below, it is also straightforward to show by graphical means that, after setting \(z=1y\) in (19), then \(S_{\text {mes}}(\infty )=z(=S_{\text {mes}}(0)=P_S(0))\) is the only solution in [0, z] if \(y \ge 1  1/R_0\) (\(R_0 \le 1\) implies this condition). Equation (20) is then proved by noting that \(P_S(t) \ge S_{\text {mes}}(t)\), and \(P_S(t)\) is nonincreasing from \(P_S(0)=S_{\text {mes}}(0)\). \(\square \)
Equation 19 is consistent with the final size relation given by Diekmann et al. (1998) (equations 5.3 and 5.4) for a regular random graph in the limit of large population size.
Remark 1
Consider an infinite sequence of finite homogeneous stochastic models, indexed by m, where \(y_m=y \in [0,1)\) for all m, and where \(N_m \rightarrow \infty \), \(p_m(n_m1)\rightarrow R_0 < \infty \), \(z_m \rightarrow 1y\), as \(m \rightarrow \infty \) (here, \(N_m\) denotes the number of individuals in the mth model). This does not preclude the expected number of initial infectives from tending to some positive number, or even diverging, as \(m \rightarrow \infty \). It is straightforward that, in the limit of this sequence, the sufficient conditions for no major outbreak in Theorem 4 still hold. Note that if in addition we have \(n_m \rightarrow \infty \) as \(m \rightarrow \infty \), then the final size relation for the homogeneous message passing system (in this limit) becomes, using (19) with \(z=1y\),
This is a wellknown final size relation in the mean field literature, although usually vaccination is not included (see Miller (2012) for a discussion of derivations of this relation).
The homogeneous message passing system gives the same epidemic time course as a pairwise model
Here we show that a generalised pairwise SIR model, with wellknown pairwise models as special cases, gives the same epidemic time course as the homogeneous message passing system. This allows us to prove epidemiological results for the generalised pairwise model. Since pairwise models are known to give good approximations of stochastic epidemic dynamics on networks [see, for example, Keeling (1999) and Sharkey (2008)], this also strengthens the case for the message passing system being a good approximation.
Theorem 5
(Equivalence of the message passing and pairwise models) For the homogeneous stochastic model, assume that the contact processes are Poisson with rate \(\beta \) and that they are independent from the recovery processes, such that \(f(\tau )=\beta \mathrm{e}^{ \beta \tau } \int _{\tau }^{\infty }r(\tau ') \text{ d } \tau '\). Assume also that \(r(\tau )\) is continuous. Then,
where
and N is a positive number.
Proof
See “Appendix 3”. \(\square \)
Corollary 2
(At all time points the pairwise model cannot underestimate the expected epidemic size) If, in the homogeneous stochastic model, contact processes are Poisson with rate \(\beta \), i.e. the marginal distribution for \(\omega _{ji}\) is exponential with parameter \(\beta \) for all \(i \in {\mathcal {V}}, j \in {\mathcal {N}}_i\), and these are independent from the infectious periods, then
where \(\ [R](t){=}N[S](t)[I](t)\).
Proof
This follows immediately from Theorems 2 and 5. \(\square \)
Corollary 3
(Final epidemic size equation for the pairwise model)
where \([S](\infty ) \equiv \lim _{t \rightarrow \infty }[S](t)\) and \(p \equiv \int _0^{\infty } \beta \mathrm{e}^{ \beta \tau '} \int _{\tau '}^{\infty }r(\tau ) \text{ d } \tau \text{ d } \tau '\).
Proof
This follows immediately from Theorems 4 and 5. \(\square \)
Note that (22)–(25) constitute a closed system for the variables [S](t), [I](t), [SS](t) and [SI](t) (if \([S](t)=0\) then the righthand sides of (24) and (25) are undefined, but in this case the lefthand sides are equal to zero). With reference to (28) and (29), the quantities \(SS_{\text {mes}}(t)\) and \(SI_{\text {mes}}(t)\) are constructed to capture/approximate, for any given pair of neighbours at time t, the probability that they are both susceptible and the probability that the first is susceptible while the second is infected respectively (see “Appendix 3”). The system (22)–(25) also follows directly from application of the individuallevel pairwise equations in Wilkinson and Sharkey (2014, equations 8 and 9). In the case where the infectious period is exponentially distributed and letting N be the population size, (23) and (25) simplify to ODEs, and the pairwise (without clustering) model of Keeling (1999) is obtained. Similarly, after substituting \(r(\tau )=\delta (tR)\), where \(\delta \) is the Dirac delta function, into (23) and (25), the pairwise model of Kiss et al. (2015) for a nonrandom infectious period of duration R is obtained (except that the last term in (23) and the last term in (25), which relate to the behaviour of the initial infectives, need to be neglected). However, it may be more efficient to solve the simpler message passing systems [via (14)–(15) and (16)–(17) respectively] and then, if pairwise quantities are required, these can be computed using (28) and (29).
As part of the proof of equivalence between message passing and pairwise models that we present here, we also close a gap in the arguments of Wilkinson and Sharkey (2014) by demonstrating sufficient conditions for the valid application of Leibniz’s integral rule (“Appendix 4”) in the derivation of the pairwise equations from the message passing equations (“Appendix 3”).
The homogeneous message passing system gives the same epidemic time course as the Kermack–McKendrick model (asymptotically)
Here, we consider a sequence of homogeneous stochastic models where the regular degree n tends to infinity. As \(n \rightarrow \infty \), an individual is able to make contacts to a number of neighbours which tends to infinity, so to obtain a finite limit we assume that the infection function \(f(\tau )\) depends on n (which we write \(f_n(\tau )\)) such that:
Note that, in the limit of large n, transmission is frequency dependent and the expected number of infectious contacts made by a given infected individual during the time interval \((t_1,t_2)\) is \(\int _{t_1}^{t_2} f^*(\tau )\text{ d } \tau \), where time is measured from the moment the individual first became infected.
The deterministic model proposed by Kermack and McKendrick (1927) is as follows:
Equations 12–15 of Kermack and McKendrick (1927) may be obtained from (30) to (32) after multiplying through by the total population size N in their paper.
The following theorem shows that, under this limiting regime and mild further conditions, the homogeneous message passing system gives the same epidemic time course as the model of Kermack and McKendrick (1927). For \(n=1,2,\dots \), let \(S_{\text {mes}(n)}(t),I_{\text {mes}(n)}(t)\) and \(R_{\text {mes}(n)}(t)\) denote the message passing system given by (10)(13), where \(F_{\text {sym}}(t)\) is replaced by \(F_{\text {sym}(n)}(t)\), which satisfies (13) with \(f(\tau )\) replaced by \(f_n(\tau )\).
Theorem 6
(Deriving the Kermack–McKendrick model from message passing) Suppose that for all \(T\ge 0\),

(i)
\(\epsilon _n(T)=\sup _{0 \le t \le T}nf_n(t)f^*(t) \rightarrow 0\) as \(n \rightarrow \infty \),

(ii)
\(M_T=\sup _{0 \le t \le T} f^*(t) < \infty \),
and that, for all \(n=1,2,\dots ,\)

(iii)
\(f_n(t)\) is continuously differentiable,

(iv)
\(\left( S_{\text {mes}(n)}(0),I_{\text {mes}(n)}(0), R_{\text {mes}(n)}(0)\right) =(S(0),I(0),R(0))=(z,1zy,y)\).
Then, for all \(T>0\),
Proof
Fix \(T>0\) and note first from (13) that, for feasible \(F_{\text {sym}(n)}(t)\) and all \(t \in [0,T]\),
Now \(n\int _0^t f_n(\tau ) \text{ d }\tau \le T(M_T+\epsilon _n(T))\), for all \(t \in [0,T]\), so conditions (i) and (ii) imply that there exists \(\epsilon _n^{(1)}(T)\ge 0\) such that for all \(t \in [0,T]\),
where \(\epsilon _n^{(1)}(T) \rightarrow 0\) as \(n \rightarrow \infty \). Thus, for all sufficiently large n, \( F_{\text {sym}(n)}(t)\) is nonzero for all \(t \in [0,T]\).
Differentiating (10) yields
and differentiating (13), using Leibniz’s integral rule (see “Appendix 4”), gives
Substituting (38) into (37), and using (10), gives
It can be shown, using (30) and (39) that, for all \( t \in [0,T]\),
where \(B(n,T) \rightarrow 0\) as \(n \rightarrow \infty \) and \(0 \le A(n,T) \le 4M_T\) for all sufficiently large n (see “Appendix 5”). Application of Gronwall’s inequality (see “Appendix 4”) then yields that, for all \( t \in [0,T]\),
Thus
whence
proving (33). Equation (35) now follows using a similar argument and (34) is then immediate. \(\square \)
It is straightforward that if \(f^*(\tau )= \beta k \mathrm{e}^{ \gamma \tau }\) and \(r(\tau )=\gamma \mathrm{e}^{ \gamma \tau }\) then the Kermack–McKendrick model reduces to a system of ODEs:
For this special case, we state the following corollary to Theorem 6, see also Wilkinson et al. (2016), where it is proved that, for nonrandom initial conditions, the Kermack–McKendrick model bounds the socalled ‘general stochastic epidemic’.
Corollary 4
(In the Markovian case, message passing and pairwise models are better approximations than the Kermack–McKendrick model) Assume that, in the homogeneous stochastic model, contact and recovery processes are independent and Poisson with rates \(\beta \) and \(\gamma \) respectively. Specifically, \(h(\tau )=\beta \mathrm{e}^{\beta \tau }\), \(r(\tau )=\gamma \mathrm{e}^{ \gamma \tau }\) and \(f(\tau )=\beta \mathrm{e}^{(\beta + \gamma )\tau }\). Let k denote the regular degree of the symmetric graph (instead of n). For this special case,
where S(t) and R(t) are given by (42)–(44), with \(S(0)=z,I(0)=1yz\) and \(R(0)=y\), and \(S_{\text {mes}}(t)\) and \(R_{\text {mes}}(t)\) are given by (9)–(12) with n replaced by k.
Proof
See “Appendix 6”. \(\square \)
Discussion
The message passing equations of Karrer and Newman (2010) approximate the expected time course for nonMarkovian SIR epidemic dynamics on networks. In a later paper, Wilkinson and Sharkey (2014) slightly generalised their equations in order to make them applicable to stochastic models with more individual level heterogeneity. Here, for the first time, we have shown that Karrer and Newman’s system of message passing equations, and its generalisation, have unique feasible solutions (Theorem 1).
An important feature of the message passing equations is that they produce an upper bound to the expected epidemic size (cumulative number of infection events) at every point in time. Thus, they give a ‘worst case scenario’. In addition, they exactly capture the expected epidemic when the contact network is a tree. Here, we extended these results to a further generalised stochastic model which includes realistic correlations between postinfection contact times and the infectious period (Theorem 2). This situation can occur when individuals may adopt diseasecombating behaviour, such as taking antiviral medication, which acts both on the ability of an individual to pass on the infection as well as the duration of their infectivity.
Much of this paper was devoted to a special case of the stochastic model which we referred to as the ‘homogeneous stochastic model’, in which individuals are homogeneous and the contact network is a symmetric graph (correlations between postinfection contact times and the infectious period are still allowed). Examples of a symmetric graph include a finite complete graph, an infinite square lattice and an infinite Bethe lattice. Due to symmetry, the message passing system here reduces to just four equations which we refer to as the ‘homogeneous message passing system’. This system is equivalent in form to a special case of the system found by Karrer and Newman (2010) to describe epidemic dynamics on random configuration networks, but here it is applied to a different stochastic model. These equations were analysed, making use of Theorem 2, to obtain a result which shows that cycles in the contact network serve to inhibit the stochastic epidemic (Theorem 3). Following arguments from Karrer and Newman (2010), we also obtained a single equation which provides an upper bound on the final epidemic size (Theorem 4); for the Bethe lattice, the final epidemic size is captured exactly. This naturally provides sufficient conditions, in terms of an \(R_{0}\)like quantity and the level of vaccination, for there to be no major outbreak (Theorem 4).
We found that the ‘limit’ of an appropriate sequence of homogeneous message passing systems gives the same epidemic time course as the Kermack and McKendrick (1927) epidemic model (Theorem 6) showing that it can be viewed as a special case of message passing. This also has the advantage of relating it to the underlying stochastic model (see also Barbour and Reinert (2013) who establish an exact correspondence). The final epidemic size result, and sufficient conditions for no major outbreak, described above for the homogeneous message passing system then translate directly.
From the homogeneous message passing system, we also constructed an equivalent populationlevel pairwise system which incorporates a general infectious period (Theorem 5). This can also be derived directly as a special case of the general individuallevel pairwise system of Wilkinson and Sharkey (2014, equations 8 and 9) by applying the conditions of the homogeneous stochastic model. Here we filled a gap in the arguments of this paper by demonstrating sufficient conditions for the valid application of Leibniz’s integral rule (“Appendix 4”). This populationlevel pairwise system contains the Poisson pairwise model (without clustering) of Keeling (1999) as a special case. It also contains the delay differential equation model of Kiss et al. (2015) as a special case. We note that an entirely different derivation of (22)–(25) has been found independently and in parallel by Röst et al. (2016).
In general, we have emphasised the equivalence between several different types of SIR epidemic model. Specifically, we mention the derivation of the Kermack–McKendrick model as a special case of message passing and the equivalence (under Markovian transmission) of message passing and a class of pairwise models [see also Wilkinson and Sharkey (2014)]. We also note the recently submitted paper by Sherborne et al. (2016) which highlights the equivalence of messagepassing and edgebased models (Miller et al. 2011), and that there is equivalence between edgebased models and the model of Volz (2008) [proved by Miller (2011)], and between the model of Volz and the binding site model of Leung and Diekmann (2017, Remark 1). While for SIR dynamics, message passing provides quite a general unifying framework, we note that for other dynamics such as SIS, it remains difficult to formulate a similar construction.
Unification of models is valuable in narrowing the lines of enquiry and simplifying ongoing research. In addition, owing to their different constructions, different types of results have been more forthcoming for some models than for others, and unification can allow results for one model to be automatically transferred to another. For example, here, by unification with message passing, we have been able to show that when contact and recovery processes are independent and Poisson, the Kermack–McKendrick model (which then reduces to a mass action ODE model) provides a rigorous upper bound on the expected epidemic size at time \(t>0\) in the homogeneous stochastic model (Corollary 4). However, the bound is coarser than that provided by the message passing and pairwise systems, so we now know that these are better approximations. This extends the result that, for nonrandom initial conditions, the Kermack–McKendrick model bounds the socalled ‘general stochastic epidemic’ (Wilkinson et al. 2016). An interesting development would be to show that the Kermack–McKendrick model (30)–(32) bounds the homogeneous stochastic model more generally. We observe that this could be achieved by showing that the message passing system for the stochastic model is the first in a sequence of message passing systems indexed by n, which satisfies the conditions for Theorem 6, and where \(S_{\text {mes}(n)}(t)\) is nonincreasing with n; this is easy to do for Poisson transmission and recovery processes (“Appendix 6”). Another extension worthy of investigation is to multitype SIR epidemics.
References
Anderson RM, May RM (1992) Infectious diseases of humans. Oxford University Press, Oxford
Bailey NTJ (1975) The mathematical theory of infectious diseases. Griffin, London
Ball FG, Wilkinson RR, Sharkey KJ (2015) Erratum: Message passing and moment closure for susceptible–infected–recovered epidemics on finite networks. Phys Rev E 92:039904
Barbour AD (1972) The principle of the diffusion of arbitrary constants. J Appl Probab 9(3):519–541
Barbour AD (1974) On a functional central limit theorem for Markov population processes. Adv Appl Probab 6(1):21–39
Barbour AD, Reinert G (2013) Approximating the epidemic curve. Electron J Probab 18(54):1–30
Corduneanu C (1991) Integral equations and applications. Cambridge University Press, Cambridge
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. doi:10.1155/2011/284909
Diekmann O, de Jong MCM, Metz JAJ (1998) A deterministic epidemic model taking account of repeated contacts between the same individuals. J Appl Probab 35(2):448–462
Donnelly P (1993) The correlation structure of epidemic models. Math Biosci 117(1–2):49–75
Esary JD, Proschan F, Walkup DW (1967) Association of random variables, with applications. Ann Math Stat 38(5):1466–1474
Godsil C, Royle G (2001) Algebraic graph theory. Springer, New York
Karrer B, Newman MEJ (2010) A message passing approach for general epidemic models. Phys Rev E 82:016101
Keeling MJ (1999) The effects of local spatial structure on epidemiological invasions. Proc Biol Sci 266:589–867
Kermack WO, McKendrick AG (1927) A contribution to the mathematical theory of epidemics. Proc R Soc Lond A 115:700–721
Kiss IZ, Röst G, Zsolt V (2015) Generalization of pairwise models to nonMarkovian epidemics on networks. Phys Rev Lett 115:078701
Kurtz TG (1970) Solutions of ordinary differential equations as limits of pure jump Markov processes. J Appl Probab 7(1):49–58
Kurtz TG (1971) Limit theorems for sequences of jump Markov processes approximating ordinary differential processes. J Appl Probab 8(2):344–356
Leung KY, Diekmann O (2017) Dangerous connections: on binding site models of infectious disease dynamics. J Math Biol 74:619–671
Miller JC (2009) The spread of infectious disease through clustered populations. J R Soc Interface. doi:10.1098/rsif.2008.0524
Miller JC (2011) A note on a paper by Erik Volz: SIR dynamics in random networks. J Math Biol 62(3):349–358
Miller JC (2012) A note on the derivation of epidemic final sizes. Bull Math Biol 74(9):2125–2141
Miller JC, Slim AC, Volz EM (2011) Edgebased compartmental modelling for infectious disease spread. J R Soc Interface 9:890–906
PastorSatorras R, Castellano C, Van Mieghem P, Vespignani A (2015) Epidemic processes in complex networks. Rev Mod Phys 87:925
Röst G, Vizi Z, Kiss IZ (2016) Pairwise approximation for SIR type network epidemics with nonMarkovian recovery. arXiv:1605.02933
Sharkey KJ (2008) Deterministic epidemiological models at the individual level. J Math Biol 57:311–331
Sherborne N, Miller JC, Blyuss KB, Kiss IZ (2016) Meanfield models for nonMarkovian epidemics on networks: from edgebased compartmental to pairwise models. arXiv:1611.04030
Simon PL, Taylor M, Kiss IZ (2011) Exact epidemic models on graphs using graphautomorphism driven lumping. J Math Biol 62(4):479–508
Trapman P (2007) Reproduction numbers for epidemics on networks using pair approximation. Math Biosci 210:464–489
Volz E (2008) SIR dynamics in random networks with heterogeneous connectivity. J Math Biol 56(3):293–310
Wilkinson RR, Ball FG, Sharkey KJ (2016) The deterministic KermackMcKendrick model bounds the general stochastic epidemic. Scheduled for publication. J Appl Probab 53(4):1031–1040
Wilkinson RR, Sharkey KJ (2014) Message passing and moment closure for susceptible–infected–recovered epidemics on finite networks. Phys Rev E 89:022808
Acknowledgements
R.R.W. acknowledges support from EPSRC (DTA studentship). R.R.W. and K.J.S. acknowledge support from the Leverhulme Trust (RPG2014341). We thank the reviewers and associate editor for their constructive comments which have improved the presentation of the paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
Research sponsered in part by The Leverhulme Trust Grant RPG2014341 to KJS.
Appendices
Appendix 1: Proof of Theorem 1
Reproducing an argument from Karrer and Newman (2010), we construct here a feasible (bounded between 0 and 1) solution of (3). Let \(F_{(0)}^{i \leftarrow j}(t)=1\) for all \(i \in {\mathcal {V}}, j \in {\mathcal {N}}_i\) and all \(t \ge 0\), and define the following iterative procedure. For \(m=1,2,\ldots \), let
It is easily shown that \(1 \ge F_{(m)}^{i \leftarrow j}(t) \ge F_{(m+1)}^{i \leftarrow j}(t)\ge 1 \int _0^t f_{ij}(\tau ) \text{ d } \tau \), for all \(i \in {\mathcal {V}}, j \in {\mathcal {N}}_i\), \(t \ge 0\) and \(m=0,1,\dots \), whence \(\mathbf {F}_m(t) \equiv (F_m^{i \leftarrow j}(t): i \in {\mathcal {V}}, j \in {\mathcal {N}}_i)\) converges to some \(\mathbf {F}_{\infty }(t)\) as \(m \rightarrow \infty \), and \(\mathbf {F}_{\infty }(t)\) is a feasible solution of (3). Moreover, letting \(\mathbf {F}_*(t)\) be any feasible solution of (3), it can be shown, arguing as in Corduneanu (1991), section 1.3, that
where \(N_{\text {max}}=\sup _{i \in {\mathcal {V}}}{\mathcal {N}}_i\) and \(f_{\text {max}}=\sup _{i \in {\mathcal {V}}, j \in {\mathcal {N}}_i} \sup _{t' \ge 0}f_{ij}(t')\). Assume that \(N_{\text {max}}< \infty \) and \(f_{\text {max}}< \infty \). Then, the righthand side of (46) converges to zero as \(m \rightarrow \infty \), and \(\mathbf {F}_{\infty }(t)\) must be the unique feasible solution of (3).
Note that (45) implies that if, for all \(i \in {\mathcal {V}}, j \in {\mathcal {N}}_i\), it is the case that \(F_{(m1)}^{i \leftarrow j}(t)\) is nonincreasing and belongs to [0, 1] for all \(t \ge 0\), then these properties are also held by \(F_{(m)}^{i \leftarrow j}(t) \) for all \(i \in {\mathcal {V}}, j \in {\mathcal {N}}_i\). Since these properties are held by \(F_{(0)}^{i \leftarrow j}(t) (=1)\) for all \(i \in {\mathcal {V}}, j \in {\mathcal {N}}_i\), then, by induction, they hold for all \(m\ge 0\), so \(F_{(\infty )}^{i \leftarrow j}(t)\) is nonincreasing for all \(i \in {\mathcal {V}}, j \in {\mathcal {N}}_i\). Thus, the feasible solution of (13) (for \(F_{\text {sym}}(t)\)) is nonincreasing, whence \(S_{\text {mes}}(t)\) is nonincreasing.
To show continuity of the feasible solution, first note that (45) implies that if, for all \(i \in {\mathcal {V}}, j \in {\mathcal {N}}_i\), it is the case that \(F_{(m1)}^{i \leftarrow j}(t)\) is continuous, then \(F_{(m)}^{i \leftarrow j}(t) \) is also continuous for all \(i \in {\mathcal {V}}, j \in {\mathcal {N}}_i\). Since \(F_{(0)}^{i \leftarrow j}(t) (=1)\) is continuous for all \(i \in {\mathcal {V}}, j \in {\mathcal {N}}_i\), then, by induction, \(F_{(m)}^{i \leftarrow j}(t) \) is continuous for all \(m \ge 0, i \in {\mathcal {V}}, j \in {\mathcal {N}}_i\). Now, for any fixed \(T>0\), the bound in (46) holds for all \(t \in [0, T]\) provided t in the righthand side of (46) is replaced by T. Thus \(\mathbf {F}_m(t)\) converges uniformly to \(\mathbf {F}_{\infty }(t)\) over [0, T] as \(n \rightarrow \infty \) and, since each \(\mathbf {F}_m(t)\) is continuous on [0, T], it follows that \(\mathbf {F}_{\infty }(t)\) is also continuous on [0, T]. This holds for any \(T>0\), so \(\mathbf {F}_{\infty }(t)\) is continuous on \([0,\infty )\).
Appendix 2: Proof of Theorem 2
We suppose first that the vertex set \({\mathcal {V}}\) is finite. Similarly to Wilkinson and Sharkey (2014, section III), and Ball et al. (2015), it is straightforward to show that the indicator variable \({\mathbbm {1}}_{i \leftarrow \mathcal {A} (t)}\) for the event that a cavity stateindividual \(i \in {\mathcal {V}}\) does not receive any infectious contacts from any of \(\mathcal {A} \subset {\mathcal {N}}_i\) by time \(t \ge 0\) is a function of the random variables \({\mathcal {X}}^{**} \equiv \cup _{i \in {\mathcal {V}}}\{{\mathcal {X}}_i^*, Y_i \}\) (see the beginning of Sect. 2), and that it is nondecreasing with respect to each element of \({\mathcal {X}}^{**}\). Thus, since \({\mathcal {X}}^{**}\) is a set of associated variables [by assumption, and Esary et al. (1967, (P2) and (P3))] and \(Y_i\) is independent of all other members of \({\mathcal {X}}^{**}\), then using Esary et al. (1967, Theorem 4.1), we have
with equality occurring when the graph is a tree or forest (where putting an individual into the cavity state prevents any dependencies between the states of its neighbours). Recall that \(z_i \equiv \mathrm{P}(Y_i=2)\) is the probability that i is initially susceptible.
Similarly, the indicator variable \({\mathbbm {1}}_{(i)j \leftarrow \mathcal {A} (t)}\) for the event that a cavity stateindividual \(j \in {\mathcal {V}}\) does not receive any infectious contacts from any of \(\mathcal {A} \subset {\mathcal {N}}_j {\setminus } i\) by time \(t \ge 0\), where \(i \in {\mathcal {N}}_j\) is also in the cavity state, is a function of the random variables \({\mathcal {X}}^{**}\), and it is nondecreasing with respect to each. Again, since \({\mathcal {X}}^{**}\) is a set of associated variables then we have [c.f. (2) and (3)],
where the second inequality follows from the fact that taking an individual out of the cavity state cannot increase the probability that a different individual receives no infectious contacts from a given neighbour by time \(t \ge 0\). Again, equality occurs when the graph is a tree or forest.
The above derivations of (47) and (48) break down when the vertex set \({\mathcal {V}}\) is countably infinite, since the theory in Esary et al. (1967) requires that the set of random variables \({\mathcal {X}}^{**}\) is finite. Suppose now that \({\mathcal {V}}\) is countably infinite and label the vertices \(1,2,\dots \). Fix \(i \in {\mathcal {V}}\) and an integer \(n \ge i\). Let \(G^{(n)}=({\mathcal {V}}^{(n)}, {\mathcal {E}}^{(n)})\) be the graph obtained from G by deleting the vertices \(n+1,n+2, \dots \) and all edges connected to those vertices. Now, since \({\mathcal {V}}^{(n)} < \infty \), the inequality (47) yields
where the superfix n denotes that the quantity is defined for the epidemic on \(G^{(n)}\). Further, for \(n=i,i+1,\dots \), the epidemic on \(G^{(n)}\) can be defined using the same set \({\mathcal {X}}^{**} \equiv \cup _{i \in {\mathcal {V}}}\{{\mathcal {X}}_i^*, Y_i \}\) of random variables. It then follows that, for any \(t \ge 0\), the event that individual i is susceptible at time t in the epidemic on \(G^{(n)}\) decreases with n and tends to the event that individual i is susceptible at time t in the epidemic on G as \(n \rightarrow \infty \), so \(P_{S_i}^{(n)}(t) \rightarrow P_{S_i}(t)\) as \(n \rightarrow \infty \) by the continuity of probability measures. A similar argument shows that \(H^{(n),i \leftarrow j}(t) \rightarrow H^{i \leftarrow j}(t)\) as \(n \rightarrow \infty \). Letting \(n \rightarrow \infty \) in (49) then shows that (47) holds when \({\mathcal {V}}\) is countably infinite, as \({\mathcal {N}}_i < \infty \). The same method of proof shows that (48) also holds when \({\mathcal {V}}\) is countably infinite.
Using (48) in conjunction with (2) we have
where equality occurs when the graph is a tree or forest. Using (50), it is easy to show by the iterative procedure in “Appendix 1” (except with \(F^{i \leftarrow j}_{(0)}(t)=H^{i \leftarrow j}(t)\)) that a unique feasible solution of (3) exists and, using this solution, that \(F^{i \leftarrow j}(t) \le H^{i \leftarrow j}(t)\) for all \(i \in {\mathcal {V}}, j \in {\mathcal {N}}_i\) and all \(t \ge 0\), with equality occurring when the graph is a tree or forest. This fact, in combination with (47), c.f. (4), proves (7), and consequently, c.f. (6), gives (8).
Appendix 3: Proof of Theorem 5
Here we consider the homogeneous stochastic model defined at the beginning of Sect. 3 with reference to the beginning of Sect. 2. We assume that transmission processes are Poisson with rate \(\beta \) and that they are independent of the recovery processes, specifically \(f(\tau )=\beta \mathrm{e}^{ \beta \tau } \int _{\tau }^{\infty } r(\tau ') \text{ d }\tau '\). We assume that \(r(\tau )\) is continuous so that we may apply Leibniz’s integral rule to compute derivatives (see “Appendix 4”). In this case, a pairwise system incorporating a general infectious period can be derived from the homogeneous message passing system (10)–(13) with the additional variables:
where \(SS_{\text {mes}}(t)\) approximates the probability that a pair of neighbours are susceptible at time t, and \(SI_{\text {mes}}(t)\) approximates the probability that the first is susceptible and the second is infected at time t [see Wilkinson and Sharkey (2014, section II B) where these pairwise quantities were first considered in the context of message passing]. To understand the construction of the factor in brackets in (52), note that for any pair of neighbours i, j, the probability that i is susceptible and j is infected at time t remains the same when i is placed into the cavity state. Further, when transmission processes are Poisson with rate \(\beta \), we must have that:
Thus, the factor in brackets in (52) can be seen to approximate the probability on the righthand side of (53) for any pair of neighbours i, j (recall that \(F_{\text {sym}}(t)\) approximates \(H^{i \leftarrow j}(t)\) for any pair of neighbours i, j).
To obtain populationlevel quantities, we define [as in Sharkey (2008, appendix B)]:
where N is a positive number. Note that (10) and (52) imply
so, since \(F_{\text {sym}}(0)=1\), we have:
Substituting from (10)–(12) and (51), and using (55), it is straightforward to write down the time derivatives of [S](t), [I](t) and [SS](t) as in (22)–(24).
Finding the time derivative of [SI](t) is more involved. Setting \(u=t\tau \) in (13) and differentiating with respect to t using Leibniz’s integral rule yields, recalling \(f(\tau )= \beta \mathrm{e}^{ \beta \tau } \int _{\tau }^{\infty } r(\tau ') \text{ d } \tau '\), that
Substituting from (52) and (57) into (54), we can write
Differentiating the righthand side of (58), we can now express the time derivative of [SI](t) as
Substituting from (10), (51), (52), (54), (55) and (56) into (59) yields the expression for \(\dot{[SI]}(t)\) in (25); the terms on the righthand side of (25) are ordered by equality with the terms on the righthand side of (59).
Appendix 4: Continuity conditions for the application of Leibniz’s integral rule and Gronwall’s inequality
To derive (38), Leibniz’s integral rule is applied to (13), and this is valid if \(F_{\text {sym}}(t)\) is continuously differentiable. Similarly, the application of the rule in the derivation of (57) and (59) is valid if \(f(\tau )\) and \(F_{\text {sym}}(t)\) are continuously differentiable. Here we show that \(F_{\text {sym}}(t)\) is continuously differentiable if \(f(\tau )\) is continuously differentiable. Note that if \(f(\tau )= \beta e^{ \beta \tau } \int _{\tau }^{\infty } r(\tau ') \text{ d } \tau '\) then \(f(\tau )\) is continuously differentiable when \(r(\tau )\) is continuous.
With reference to the message passing system, (10)–(13), assume that \(f(\tau )\) is continuously differentiable. Thus we may apply Leibniz’s integral rule to (13), after setting \(\tau '=t\tau \), in order to compute the derivative of \(F_{\text {sym}}(t)\) as follows
It follows from “Appendix 1” that \(F_{\text {sym}}(t)\) is continuous. Thus, since \(\dot{f}(\tau )\) is also continuous, (60) implies that \(\dot{F}_{\text {sym}}(t)\) is continuous.
To derive (41), Gronwall’s inequality is applied to (40), and this is valid if \(\dot{S}_{\text {mes}(n)}(t)\) and \(\dot{S}(t)\) are continuous. By condition (iii) of Theorem 6, we have that \(\dot{F}_{\text {sym}(n)}(t)\) is continuous (by the above argument), so \(\dot{S}_{\text {mes}(n)}(t)\) is continuous. Conditions (i) and (iii) imply that \(f^*(t)\) is continuous, which implies that \(\dot{S}(t)\) is continuous.
We note that Leibniz’s integral rule was assumed to be applicable in Wilkinson and Sharkey (2014). It is straightforward, using a similar argument to above, to show that the application of the rule in that paper is valid if \(f_{ij}(\tau )\) is continuously differentiable for all \(i \in V, j \in N_i\).
Appendix 5: Proof of (40)
It follows from (30) and (39) that, for all \(t \in [0,T]\),
where
and
Now
where
and
Considering \( A_n^{(1)}(t)\), note that, since \(0 \le S_{\text {mes}(n)}(t) \le 1\),
where
and
Now conditions (i), (ii) and (36) imply that, for all \(t \in [0,T],\tau \in [0,t]\),
and
whence
as \(\int _0^t \dot{S}(t \tau ) \text{ d } \tau = S(0)S(t) \in [0,1]\). A similar argument, noting that
shows that
Hence, recalling (63),
Turning to \(A_n^{(2)}(t)\), note that since \(S_{\text {mes}(n)}(0)=S(0)\),
so
Further, since \(I(0)=1yz\) and \(0 \le I(0), S_{\text {mes}(n)}(t) \le 1\),
using a similar result to (64).
Thus, using (61), (62), (65), (66) and (67), we may define
and
such that inequality (40) is satisfied for all \(t \in [0,T]\). Further, since both \(\epsilon _n(T)\) and \(\epsilon _n^{(1)}(T)\) converge to 0 as \(n \rightarrow \infty \), it follows that \(B(n,T) \rightarrow 0\) as \(n \rightarrow \infty \) and \(0 \le A(n,T) \le 4 M_T\) for all sufficiently large n.
Appendix 6: Proof of Corollary 4
Here, we consider the homogeneous stochastic model (defined at the beginning of Sect. 3, with reference to the beginning of Sect. 2) for the special case where transmission and recovery processes are independent and Poisson with rates \(\beta \) and \(\gamma \) respectively. Specifically, \(h(\tau )=\beta \mathrm{e}^{\beta \tau }\), \(r(\tau )=\gamma \mathrm{e}^{ \gamma \tau }\) and \(f(\tau )=\beta \mathrm{e}^{(\beta + \gamma )\tau }\). For convenience, we let k denote the regular degree of the symmetric graph (instead of n).
For this special case, we show here that for the same initial conditions and parameters,
where \(P_{S}(t)\) is the probability that an arbitrary individual is susceptible at time t (this being the same for all individuals) and S(t) is given by the special case of the Kermack–McKendrick model (42)–(44), with \(S(0)=z>0, I(0)=1yz>0\) and \(R(0)=y\); \(S_{\text {mes}}(t)\) is given by (10) and (13) but with n replaced by k. Note that since
and
then (68) implies that \(R(t) > R_{\text {mes}}(t) \ge P_{R}(t)\) for all \(t>0\).
We already have \(P_{S}(t)\ge S_{\text {mes}}(t)\) by Theorem 2 and the fact that the message passing system, in this case, has a unique solution. Thus, we may prove (68) and Corollary 4 by showing that \(S_{\text {mes}}(t) > S(t)\) for all \(t>0\).
Setting \(f_n(\tau )= (\beta k/n)\mathrm{e}^{(\beta k/n+ \gamma ) \tau }\) and \(f^*(\tau )=\beta k \mathrm{e}^{ \gamma \tau }\), the Kermack–McKendrick model reduces to the system of ODEs (42)–(44) and the conditions for Theorem 6 are satisfied. Thus, letting \(F_{\text {sym}(n)}(t)\) be defined by (13) but with \(f(\tau )\) replaced by \(f_{n}(\tau )\), and letting \(S_{\text {mes}(n)}(t)\) be defined by (10) but with \(F_{\text {sym}}(t)\) replaced by \(F_{\text {sym}(n)}(t)\) (as in Sect. 3.4),
and
Therefore, if \(S_{\text {mes}(n)}(t) \equiv z F_{\text {sym}(n)}(t)^n\) is strictly decreasing with respect to n, for all \(t > 0\), then we have \(S_{\text {mes}}(t) > S(t)\) for all \(t > 0\). We now show this to be the case.
Letting \(u_n(t)=F_{\text {sym}(n)}(t)^n (=S_{\text {mes}(n)}(t)/z)\), we can write [c.f. (14)]
For fixed \(u \in (0,1)\), we have that \(u^{\frac{n 1}{n}}\) is strictly decreasing with n, and also that
is strictly decreasing with n. Therefore, since \(u_n(0)=1\) and \(u_n(t) \in (0,1)\) for \(t>0\), it follows that \(u_{n}(t)\) (and hence \(S_{\text {mes}(n)}(t)\)) is strictly decreasing with n for all \(t>0\).
Rights and permissions
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.
About this article
Cite this article
Wilkinson, R.R., Ball, F.G. & Sharkey, K.J. The relationships between message passing, pairwise, Kermack–McKendrick and stochastic SIR epidemic models. J. Math. Biol. 75, 1563–1590 (2017). https://doi.org/10.1007/s0028501711238
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s0028501711238
Keywords
 Stochastic SIR epidemic
 Kermack–McKendrick model
 NonMarkovian
 Message passing
 Pairwise
 Network
Mathematics Subject Classification
 92D30
 91D30