Exact description of limiting SIR and SEIR dynamics on locally tree-like graphs
Abstract.
We study the Susceptible-Infected-Recovered (SIR) and the Susceptible-Exposed-Infected-Recovered (SEIR) models of epidemics, with possibly time-varying rates, on a class of networks that are locally tree-like, which includes sparse Erdős-Rényi random graphs, random regular graphs, and other configuration models. We identify tractable systems of ODEs that exactly describe the dynamics of the SIR and SEIR processes in a suitable asymptotic regime in which the population size goes to infinity. Moreover, in the case of constant recovery and infection rates, we characterize the outbreak size as the unique zero of an explicit functional. We use this to show that a (suitably defined) mean-field prediction always overestimates the outbreak size, and that the outbreak sizes for SIR and SEIR processes with the same initial condition and constant infection and recovery rates coincide. In contrast, we show that the outbreak sizes for SIR and SEIR processes with the same time-varying infection and recovery rates can in general be quite different. We also demonstrate via simulations the efficacy of our approximations for populations of moderate size.
Key words and phrases:
interacting particle systems; continuous time Markov chains; SIR model; SEIR model, epidemics; outbreak size; sparse graphs; random graphs; local limits; mean-field limits; Erdős-Rényi random graphs; configuration model; random regular graph; Galton-Watson trees.1991 Mathematics Subject Classification:
Primary: 60K35; 60F17; Secondary: 60G60; 60J2.1. Introduction
Models, Results and Proof Techniques. The Susceptible-Infected-Recovered (SIR) model has been extensively used to study the spread of infectious diseases, computer viruses, information, and rumors. In this model, each individual in a population is represented as being in one of three states: susceptible (does not have the disease, but could catch it), infected (has the disease and can spread it to susceptible individuals), or recovered (no longer has the disease and cannot be reinfected). The dynamics are governed by a graph, which describes the contact network of individuals in a population, and two strictly positive parameters: , the rate at which an infected individual recovers, and , the rate at which an infected individual transmits the disease to a susceptible individual with whom it is in immediate contact. Random graphs are used to model variation and uncertainly in real-world contact networks. We are interested in the global dynamical behavior that arises from the local interactions of disease spreading. In particular, we are interested in the following questions: how many individuals are at each of the states at any time ? What is the total size of the outbreak, that is, how many individuals were infected during the course of the epidemic? Answering these questions for large populations can be analytically challenging, and simulations are computationally expensive and do not easily allow for rigorous characterization of qualitative behavior.
In the present work, we study a continuous-time stochastic SIR process, and a related epidemic model, the Susceptible-Exposed-Infected-Recovered (SEIR) process, where an additional state is considered for individuals that have been exposed to the pathogen but have not yet become infectious. The SEIR process has been widely used to model the spreading of diseases including the recent SARS-CoV-2 pandemic, for instance, see [Suwardi2020stability, girardi2023anseir, mwalili2020SEIR]. In both cases, we allow for the (infection and recovery) transition rates to be time-dependent, so as to model effects due to seasonal variations, changes in the virulence of a disease, developments in treatment options, and changes in public health policies, which are of significant interest in practice [morris2021optimal, lopez2021modified, fisman2007seasonality]. While the majority of works have considered SIR processes on dense networks, we consider these processes on sparse networks (i.e., where each individual is connected to a bounded number of individuals), which more faithfully describe real-world networks. We provide tractable approximations for the evolution of fractions of individuals in each of the states of the epidemic in terms of a coupled system of ordinary differential equations (ODEs), see (2.4) and (2.11), and for the outbreak size, which is the final fraction of individuals ever infected. Moreover, we show that these approximations are asymptotically exact, as the size of the population increases to infinity, when the graph governing the dynamics is locally-tree like. More precisely, we consider a broad class of sparse (random) graph sequences, including sparse Erdős-Rényi random graphs, random regular graphs, and certain configuration models, which are known to converge in a certain local (weak) sense to a random limit that belongs to the class of unimodular Galton-Watson (UGW) trees; see Theorem 2.5 and Theorem 2.10. We refer the reader to Definition 2.3 for the definition of a UGW tree, and to [vanderHofstad2023vol2, Aldous2004objective] for an extensive account of local convergence of graphs.
Our proof technique starts by appealing to a general result in [Ganguly2022hydrodynamic] that shows that for a general class of interacting particle systems that includes the SIR and SEIR processes, the sequence of empirical measures (equivalently, fractions of individuals in different states) on any locally converging sequence of graphs converges to the law of the marginal evolution of the root node in the limit UGW tree (see also [Lacker2023local, RamICM22] for related results). The key step is then to provide a tractable characterization of the root marginal dynamics of this infinite-dimensional process. While for general particle systems the marginal dynamics of the root, or even of the root and its neighborhood, could be non-Markovian, a key step in our proof is to show that for the SIR and SEIR models, the dynamics simplifies. In fact, we can deduce from our proof that the evolution of the pair of vertices consisting of the root and an offspring is in fact Markovian (see Remark 4.11). The proof of the latter property relies crucially on certain conditional independence relations that we identify (see Proposition 4.7) and a certain projection lemma (Proposition 4.6) in the spirit of [Ganguly2022nonmarkovian, Lemma 9.1]. These properties are combined with symmetry properties of the dynamics (identified in Proposition 4.8) to obtain a very tractable description of the evolution of the marginal law of the root in terms of the abovementioned systems of ODEs.
For both the SIR and SEIR models, the associated system of ODEs is then analyzed to characterize the outbreak size in terms of the moment generating function of the offspring distribution of the limiting UGW tree, evaluated at the unique zero of an explicitly given functional; see Theorem 3.1. In the case of constant recovery and infection rates, we obtain a simpler characterization of the outbreak size and use it to show that the (suitably defined) mean-field prediction always overestimates the outbreak size. In this setting, we also show that although the transient dynamics can be different, the outbreak sizes for the SIR and SEIR models coincide when they have the same rates and initial conditions. In particular, this shows that in this case the outbreak size for the SEIR model does not depend on the rate at which an exposed individual becomes infectious. In contrast, we show that when the rates are time-varying, the outbreak sizes of the corresponding SIR and SEIR processes no longer coincide and can be vastly different even when the (time-varying) ratios of the infection rate to the recovery rate coincide. For both transient dynamics and the outbreak size, we compare our results with numerical simulations to demonstrate the efficacy of these approximations for populations of even moderate size. We also show how the ODEs can be used to study the impact of the amplitude and phase of periodically varying rates on the outbreak size.
When the infection and recovery rates are constant in time, traditional techniques to analyze the outbreak size of the SIR process exploit a reformulation of the final outbreak size in terms of a bond percolation problem.
However, it is not apparent if such a simple correspondence exists when the infection and recovery rates are time-varying, and unlike our approach, percolation-based arguments provide limited insight into the dynamics
of the epidemic process.
Furthermore, our general approach can also be applied to obtain analogous results for other more general epidemic processes including a class of compartmental models and processes with general recovery distributions;
see Remark 2.8 and Remark 2.11. It would also be of interest to investigate to what extent an analogous approach can be used to provide alternatives to mean-field approximations for other classes of models, for instance, such as those described in [RamQuesta22]. We defer a complete investigation to future work.
Discussion of Prior Work. Understanding epidemic dynamics on networks is an active area of contemporary research. The deterministic SIR model, introduced in [kermack1927contribution], is a system of coupled ODEs that describes the evolution over time of the fraction of individuals in each of the states of the epidemic, in a population where everyone can come into contact with everyone else. This is known as the mean-field approximation. The mean-field dynamics are known to emerge as the large limit of the SIR process defined on the complete graph on vertices, when the infection rate scales like . The mean-field approximation provides a dramatic reduction of dimensionality, as it captures the global behavior of a size population by a coupled system of two ODEs. However, most real-world contact networks are sparse, in the sense that the average number of neighbors for an individual in the network remands bounded even when the population size grows.
Because of this, and the application-driven need to understand epidemic dynamics on more realistic networks, the study of SIR dynamics on a range of more realistic sparse network structures is an active area of research. The work of [schutz2008exact] derives equations for the expected number of individuals in each SIR state on a cycle graph, and compares these results with the corresponding quantities associated with the SIR model on the complete graph, as well as the scaled dynamics that result in the mean-field approximation. An SIR model on the -regular tree (the infinite tree where every vertex has neighbors) with general recovery times and time-dependent rates was studied in [gairat2022discrete]. The latter work derives the asymptotic limit, as goes to infinity, of the evolution of the fraction of susceptible individuals over time, which recovers the mean-field approximation. Differential equations to approximate the fraction of susceptible, infected and recovered individuals for the continuous-time SIR model on configuration model graphs were derived heuristically in [Volz2008SIR, Volz2009epidemic] and shown to be asymptotically exact, as the population size goes to infinity, in [Decreusefond2012large, janson2015law]. In very recent work [hall2023exact], the authors obtain an explicit representation of the marginal distribution of each node on a finite tree by solving a coupled system of ODEs. This representation is shown to provide an upper bound on the probability that a node is susceptible on general graphs or with more than one initial infection. However, they show, via simulations, that this upper bound is generally not very tight.
Existing mathematically rigorous work on the SEIR process focuses on studying the deterministic dynamics that arise in the mean-field regime, see [li1999global].
To the best of our knowledge, not much is known rigorously about SEIR processes on sparse graphs or corresponding limits.
In [Zhao2013SEIR], the authors present an ODE system that they heuristically argue should approximate the fraction for large populations size.
However, their approximation is not compared with simulations, and it differs from our ODE system, which is asymptotically exact as the population size approaches infinity.
Organization of the Paper. The rest of the paper is structured as follows. In Section 1.1 we introduce some common notation used throughout the paper. In Section 2 we define the SIR and SEIR processes and state our characterization of the large-population limit of epidemic dynamics (see Theorem 2.5 and Theorem 2.10). In Section 3 we provide a characterization of the outbreak size in the large-population limit (see Theorem 3.1 and Theorem 3.5). The proofs of our results are provided in Section 4. They rely on a conditional independence property that is proven in Section 5 and some auxiliary results on the SEIR process that are relegated to Appendix A. Additionally, the proof of the well-posedness of the limit ODE systems are given in Appendix B.
1.1. Notation
We briefly overview common notation used throughout the paper. We use to denote a graph with vertex set and edge set . When clear from context, we identify a graph with its vertex set, and so for a vertex we might write instead of the more accurate . We let denote the number of vertices of . Given , we let be the boundary of . In the case where is a singleton, we write , and refer to it as the set of neighbors of . The degree of a vertex is defined as . When unambiguous, we omit the dependence on from our notation, and write and . For , we write to mean . Given a set , a configuration and , we write , and in the special case when , .
We let , and let be the set of probability measures on . We identify probability measures on with their probability mass functions. In particular, for and , we write . For , we let be the Dirac measure at . Given a probability space , we denote by the law of a valued random variable .
2. Results on Transient Dynamics
In Section 2.1 we precisely define the SIR process and in Section 2.2 state the main result that describes the limiting dynamics on converging sequences of locally tree-like graphs in terms of solutions to systems of ODEs. In Section 2.3 we define the SEIR process and state the corresponding convergence result.
2.1. SIR Model
Fix a graph , the (time-varying) infection rate , and the (time-varying) recovery rate . We write (resp. ) for the value of (resp. ) at time . The SIR process on , denoted by , is a continuous-time locally interacting Markov chain with the following dynamics. At any time , each individual has a state in the space . The initial states are i.i.d. with and for some . Given , representing the configuration of the neighbors of a vertex, we denote by the number of elements of that are equal to . At time , each individual jumps from to (i.e., becomes infected) at rate , and from to (i.e., recovers) at rate . We impose the following mild assumptions on the recovery and infection rate functions.
Assumption A.
The functions and are continuous and there exist such that
(2.1) |
Throughout the paper, we assume that Assumption A holds.
Remark 2.1.
If we equip with the total ordering given by , then the SIR process is monotonic in the sense that for every and , if then .
Next, we describe the class of graph sequences that we consider, as well as an associated probability measure on that characterizes the corresponding local limit.
Assumption B.
Suppose the sequence of graphs and satisfy one of the following:
-
(1)
(Erdős-Rényi). There exists such that, for every , is a Erdős-Rényi random graph , and is the Poisson distribution with mean .
-
(2)
(Configuration Model). For each , let be a graphical sequence, such that converges weakly to as , and has finite third moment. Let be a graph uniformly chosen among graphs on vertices with degree sequence . We write .
Remark 2.2.
The only place where we use the assumption that has a finite third moment is in Proposition 2.4 below (and the corresponding result for the SEIR process, Proposition 2.9). Every result in this paper holds by replacing the assumption that has finite third moment in Assumption B(2) with the assumption that has finite second moment and that the system (2.4)-(2.5) (and the corresponding system for the SEIR process (2.11)-(2.12)) has a unique solution on .
We refer the reader to [hofstad2016vol1, Chapter 5 and Chapter 7] for an extensive account of random graphs, including precise definitions and well-known properties of the graphs in Assumption B. The class of graphs we consider is locally tree-like, in a sense that we now make precise. Given with finite first moment, we define its size-biased distribution by
(2.2) |
Definition 2.3.
The unimodular Galton-Watson tree with offspring distribution , denoted by UGW), is a rooted random tree where the root has a number of children distributed like and every vertex in subsequent generations has a number of children distributed like , independently of the degree of vertices in the same or previous generations.
It is well known that if and satisfy Assumption B, then converges in a local sense (local weak convergence in probability, as defined in [vanderHofstad2023vol2, Definition 2.11]; see also [Lacker2023local, Definition 2.2] and [Ganguly2022hydrodynamic, Section 2.4]) to a GWT tree. This is established, for instance, in [van2009randomII, Theorem 2.18 and Theorem 4.1].
2.2. Asymptotic Characterization of SIR dynamics
Our first result is the limit characterization (as the graph size goes to infinity) of the evolution of the fractions of individuals that, at each time, are in each of the states . Given a finite graph , for we define
(2.3) |
We start by establishing the existence and uniqueness of the solution to a certain system of ODEs that will be used to describe the limit. As is standard practice, we use the dot notation for derivatives with respect to time, and prime notation for derivatives in space.
Proposition 2.4.
Suppose that has finite third moment and let . Then there exists a unique solution to the following system of ODEs:
(2.4) |
with initial conditions
(2.5) |
The proof of Proposition 2.4 uses standard arguments and is thus relegated to Appendix B. Given and , we define its Laplace transform as follows:
(2.6) |
Given as in Proposition 2.4, for we define
(2.7) |
We now state our main result for the SIR model.
Theorem 2.5.
Suppose that a sequence of random graphs and satisfy Assumption B. Let be the size-biased version of , as defined in (2.2). Suppose that and let and be as defined in (2.7). Then, as we have
(2.8) |
uniformly for .
The proof of Theorem 2.5 is given in Section 4.2. It relies on a hydrodynamic limit result established in [Ganguly2022nonmarkovian, Corollary 4.7], which shows that the fraction of individuals in any state in the SIR process on converges to , where is the SIR process on , and is the root vertex. We then show that the trajectories of satisfy a certain conditional independence property (Proposition 4.7). We combine this property with symmetry properties of the dynamics (see Proposition 4.8) to characterize in terms of a system of ODEs. In particular, for or , the probability is equal to or , respectively, as defined in (2.7). As mentioned in the Introduction, Proposition 4.7 can be seen as a substantial refinement in the case of the SIR process of a certain general Markov random field property that holds for more general interacting particle systems; see [Ganguly2022interacting, Theorem 3.7].
In Figure 1, we compare simulations of the evolution of the SIR process on certain Erdős-Rényi random graphs and random -regular graphs of size with the theoretical prediction from Theorem 2.5. The plots illustrate that even in systems of moderate size, the theoretical prediction closely tracks the simulations.




Remark 2.6.
For simplicity, we restrict our attention to i.i.d. initial conditions, though the techniques in our proofs extend to more general initial conditions, as long as they satisfy certain symmetry properties between the laws of the initial states and that of the random graphs, and satisfy the Markov random field property mentioned above. In the case where the limit tree is the -regular tree , the symmetry conditions correspond to the law of being isomorphism invariant, see [Lacker2021marginal, Remark 3.16].
Remark 2.7.
We also mention that, while Theorem 2.5 is stated for (sparse) ER and CM graphs, our techniques extend to a broader class of graphs, namely to any graph sequence that converges locally weakly in probability to a UGW tree. All results in this paper hold if we replace Assumption B with the assumption that for some with finite third moment and a tree ,
for every and every rooted graph , where denotes graph isomorphism, and is a ball of radius around , that is, the subgraph induced by all vertices in that are at most edges away from .
As mentioned in the Introduction, in the special case when the infection and recovery rates and are constant in time and is the configuration model, an ODE approximation similar to (2.4) was proposed in [Volz2008SIR, Volz2009epidemic] and shown to be asymptotically exact in [Decreusefond2012large, janson2015law]. However, Theorem 2.5 applies to the more general setting of time-varying rates, which is very relevant for applications, e.g., [chen2020time, hong2020estimation, london1973recurrent, dushoff2004dynamical], and more general graph classes (see Remark 2.7). Further, an advantage of our approach is that it allows for several important generalizations, including non-exponential recovery times, as elaborated upon in Remark 2.8 below, the SEIR model, presented in Section 2.3, and further extensions, discussed in Remark 2.11 below.
Remark 2.8.
A large part of the literature on the SIR process focuses on the case where recovery times are exponential random variables, that is, each individual recovers at some rate regardless of how long they have been infected, and the methods exploit this Markovian structure. If recovery times are not exponential, the resulting SIR dynamics are not Markov, and this makes their analysis significantly more challenging. In contrast, the local convergence tools that we used in the proof of Theorem 2.5 can still be used in this setting. Specifically, the hydrodynamic result in [Ganguly2022hydrodynamic] is still valid and shows that the fraction of individuals in each of the SIR states on a finite locally-tree like graph can be approximated by the root particle dynamics of the non-Markovian SIR process on the infinite tree. Further, a version of the conditional independence property of Proposition 4.7 can be established, the marginal root dynamics can be characterized as a piecewise deterministic Markov process, and its law characterized as the solution to a certain PDE. A complete analysis is deferred to future work.
2.3. SEIR Model
In this section, we extend our limit results to the Susceptible-Exposed-Infected-Recovered (SEIR) process. The SEIR process is a model of epidemics in which each individual can be in one of four possible states: in addition to the three states , of the SIR model, an individual can also be in the exposed state , when it has contracted the disease but is not yet able to infect its neighbors.
We define . As in the case of the SIR model, the SEIR model on a (possibly random) graph can be modelled as a locally interacting Markov chain. We denote this process by . The SEIR process is governed by the graph and three functions , with and , as for the SIR model, representing the infection and recovery rates, and now representing the time-dependent rate at which an individual transitions from having been exposed to being infectious. We assume that the initial states are i.i.d. with and for some and such that . At time , an individual jumps from to at the rate , from to at the rate , and from to at the rate . No other jumps are possible. Equipping with the ordering , the SEIR process is non-decreasing in the same sense as Remark 2.1.
Throughout the rest of the paper, we make the following assumption.
Assumption C.
The functions , and are continuous and there exist constants such that
(2.9) |
2.3.1. Asymptotic Characterization of SEIR dynamics
Given a finite graph , we let
(2.10) |
We start by establishing the existence and uniqueness of the solution to a certain system of ordinary differential equations that we use in our main result.
Proposition 2.9.
Suppose that has a finite third moment and let and satisfy . Then there exists a unique solution to the following system of ODEs:
(2.11) |
with initial conditions
(2.12) |
The proof of Proposition 2.9 is similar to that of Proposition 2.4. A brief outline is given at the end of Appendix B.
Given as in Proposition 2.9 and as in (2.6), define
(2.13) |
We can now state our characterization of the large dynamics of the SEIR process.
Theorem 2.10.
The proof of Theorem 2.10 is given in Section 4.2.3, and follows a similar approach as for the SIR model, although the details are more involved.
In Figure 2 we compare our asymptotically exact approximation to values of and for an Erdős-Rényi graph obtained by Monte Carlo simulations ( iterations, plotted with confidence intervals). Once again, our approximation closely tracks the simulation results, even for relatively small .




Remark 2.11.
The result in Theorem 2.10 can be further extended to more general compartmental models that are widely used in the epidemiology literature in order to account for different viral strains and treatment options, for example, see [duchamps2023general, foutel2022from, he2020SEIR, mwalili2020SEIR, hyman1999differential]. These allow for a susceptible state and post-infection states , , … . Supposing that each individual’s transitions among post-infection states do not depend on the states of its neighbors, under Assumption B and continuity assumptions analogous to Assumption C, the hydrodynamic result in [Ganguly2022hydrodynamic] holds. If in addition one assumes that no transitions from post-infection states to state are possible, a version of the independence property of Proposition 4.7 can be established, thus leading to a result analogous to Theorem 2.10. We defer a full account of this general setting to future work.
3. Results on Outbreak Size
An important quantity of interest in the study of epidemic dynamics is the outbreak size, which is the fraction of individuals ever infected, in the interval . By the monotonicity of the SIR and SEIR processes (Remark 2.1), the outbreak size is equal to minus the limit, as , of the fraction of susceptible individuals at time . In Section 3.1 and Section 3.2, we characterize the large-time behavior for the SIR and SEIR processes respectively, as the size of the population approaches infinity. In Section 3.3 we compare our asymptotically exact estimate of the outbreak size with a mean-field approximation for the special case of the SIR process on random regular graphs with constant infection and recovery rates.
3.1. Outbreak Size for SIR Model
Given a sequence of graphs satisfying Assumption B, we let for . We compute the limit of this quantity as , by first showing that , where , given in (2.7), is the hydrodynamic limit of the fraction of susceptible individuals, by Theorem 2.5. We recall that denotes the moment generating function of .
Theorem 3.1.
Let and satisfy Assumption B. Let be the size-biased version of , as defined in (2.2). Then, assuming that ,
where is defined by (2.4)-(2.5). Moreover, is finite and satisfies
(3.1) |
Furthermore, if there exists such that for all , then equation (3.1) is equivalent to
(3.2) |
which has a unique strictly positive solution .
Remark 3.2.
When the ratio is constant in time, the final outbreak size depends on and only through their ratio. This is well known when and are both constant, and in that case it is common in the SIR literature to fix with no loss of generality, by re-scaling time. Theorem 3.1 shows that, when the ratio is not constant, the ratio no longer determines the outbreak size, and instead the time evolution of both and influence the outbreak size. Figure 3 illustrates this phenomenon. It plots , defined in (2.7), which by Theorem 2.5 is the large- asymptotic fraction of susceptible individuals, for two SIR processes with the same ratio for all , though different and , which lead to dramatically different outbreak sizes.
[\capbeside\thisfloatsetupcapbesideposition=right,center,capbesidewidth=0.5]figure[\FBwidth]
Next, for each time-dependent and we identify constant infection and recovery rates that lead to the same outbreak size. These effective rates are unique only up to multiplication by the same constant, and so we identify them by their ratio. For given , we define as
(3.3) |
where we set for any , and where is defined by (2.4)-(2.5) for some fixed with the given and . For , we also define as
(3.4) |
The following result shows that for every pair of rate functions and satisfying Assumption A, there exists a constant so that the outbreak size of an SIR process with rates and , and that of a SIR process with constant infection rate and constant recovery are the same (as ). In particular, we observe that this is not achieved by naively replacing and with their respective average (over time) values, nor by taking to be the (time) average of .
Lemma 3.3.
Proof.
We start by showing that . We know that by Theorem 3.1. By Assumption A and (2.4), is continuous, non-negative, and bounded away from zero near , and so . Letting be constants such that (2.1) holds, we have
Similarly, note that . Setting as in (3.5), by (3.4), we have
Evaluating this at using (3.3), and observing that , we have
which is zero by Theorem 3.1. This shows the existence of such that .
For uniqueness, observe that for each the map is non-decreasing, and strictly increasing on . Let be the unique zero of . It follows that is strictly decreasing in and therefore there is a one-to-one correspondence between and . ∎
We conclude this section with a brief discussion of periodic parameters. For simplicity, we fix and we consider periodic infection rates that could model, for instance, seasonality effects of the infectivity of a pathogen. For a given amplitude , period and we set . Here, is a parameter controlling the phase of the periodic rate at time zero. Note that if the period length is large enough compared to the average infection rate and recovery rate, the outbreak dies out before the full length of the period, and so, while the average of over the period is , the average infection rate during the time the epidemic is “active” (i.e, there are individuals in state ) will be close to . Because of this, we expect to have a greater impact on the outbreak size when is large. This is borne out by Figure 4, which plots the outbreak size as a function of for various and . We see that in every case other than large and small , the outbreak size is decreasing in . This suggests the following conjecture, which we leave for future investigation.




Conjecture 3.4.
Let and . Define . There exists such that, for all , the asymptotic outbreak size is decreasing in .
3.2. Outbreak Size for the SEIR Model
We now turn to the characterization of the outbreak size of an SEIR process. Recall the definition of for given in (2.6).
Theorem 3.5.
Let and satisfy Assumption B. Then




Theorem 3.5 shows that when the ratio is constant, the final outbreak size does not depend on and it coincides with the outbreak size of a SIR process with the same infection rate, recovery rate, and initial condition . On the other hand, when the ratio is not constant, the rate affects the outbreak size. Figure 5 plots , as defined in (2.13), which by Theorem 2.10 is the large limit of the of the fraction of susceptible individuals, for several SEIR processes on a random -regular graph. For fixed constants and , but different values of constant , the time-dynamics can vary significantly, but the final fraction of susceptible individuals does not depend on . In contrast, when changes with time, the final fraction of susceptible individuals (and hence, the outbreak size) varies with .
In Figure 6, we set all rates as constant, and we show that the time evolution of the sum of the fractions of infected and exposed individuals in the SEIR process can be markedly different from that of the fraction of infected individuals in an SIR process, despite the fact that the final outbreak sizes coincide. We leave as a future research direction the problem of understanding the impact of on the SEIR dynamics for finite - for example, how does impact the maximum number of individuals that have ever been infected in any given time period?


3.3. Comparison with the Mean-Field approximation for the SIR model
In this section, we restrict our attention to the SIR process on the uniform -regular graph, with the ratio being constant in time, and compare the asymptotically exact outbreak size with the corresponding mean-field approximation. We first start by observing that on -regular graphs, the characterization (3.2) of the outbreak size can be simplified further as follows.
Corollary 3.6.
Let . Let be such that for every , is chosen uniformly among all -regular graphs with vertices, or equivalently is a graph. Suppose that there exists such that for all . Then, it follows that
where is the unique solution in of the equation
(3.8) |
In particular, we have
Proof.
Fix and set . It is immediate from (2.2) that the size-biased distribution is equal to . For any , , we have that . By Theorem 3.1, the final fraction of susceptible individuals is equal to , where is the solution of equation (3.2), which for reduces to
By a simple arithmetic manipulation, satisfies equation (3.8). Uniqueness of the solution to follows since holds for at most one value of , namely for . ∎
Figure 7 plots the analytic values of obtained from Corollary 3.6 versus simulated values for different values of and . We ran iterations for each pair , sampling a new graph at every iteration. As shown therein, the limit appears to be a good approximation for graphs of moderate size (namely, with ). We leave for future research the problem of finding accurate error bounds for finite .
[\capbeside\thisfloatsetupcapbesideposition=right,center,capbesidewidth=0.5]figure[\FBwidth]
By Theorem 3.1 and Corollary 3.6, is an asymptotically (in ) exact approximation of the total fraction of individuals ever infected on a SIR epidemic on a graph drawn uniformly among the -regular graphs on vertices. We now compare this approximation with a scaled mean-field approximation to the SIR model on a -regular graph which can be formulated via the following system of ODEs, see for example [Ganguly2022nonmarkovian, Section 7]:
with initial conditions , . When there exists such that for all , by performing a change of variables and solving the equation , it can be shown that where is the unique solution in of
(3.9) |



Our next result shows that the mean-field approximation always yields a larger estimate of the outbreak size on random regular graphs compared to the true asymptotic value. This is further illustrated in Figure 8, which plots the mean-field prediction versus our prediction of the outbreak size on random -regular graphs.
Proposition 3.7.
Proof.
4. Proofs of main results
In Section 4.1 we introduce a parameterized family of processes that interpolates between the SIR and SEIR processes. This allows us to prove some intermediate results simultaneously for both processes. In Section 4.2 we provide the proofs of Theorem 2.5 and Theorem 2.10. In Section 4.3 we prove Theorem 3.1 and Theorem 3.5. Throughout, is a sequence of random graphs, , is the size-biased version of , as defined in (2.2), and is a UGW() tree. We assume that and satisfy Assumption B and that the rates satisfy Assumption C.
4.1. The Hybrid S(E)IR Process
Fix the rates as in Section 2.3, the interpolation parameter , probabilities , and with . For a graph , let be a Markov chain on describing the evolution of interacting individuals or particles indexed by the nodes of , where the state of each particle lies in the space . The initial states are i.i.d. across particles, with common law given by
(4.1) |
. Given for some (setting ) recall that denotes the number of entries of that are equal to . At time , the jump rates for the jump processes representing the evolution of a particle are given as follows:
-
•
from to at rate ;
-
•
from to at rate ;
-
•
from to at rate ;
-
•
from to at rate .
No other transitions are allowed. When is finite, classical results guarantee the existence of the process and the uniqueness of its law follows from standard results about finite-state continuous time Markov chains, see for instance [Ganguly2022hydrodynamic, Proposition 4.1]. We note that if , reduces to the SEIR model, and if (and ), is the SIR model. Throughout, whenever , we implicitly assume that , and Assumption C can be substituted with Assumption A. We refer to as the S(E)IR process. We also observe that the process is non-decreasing for every and , that is, for every and ,
(4.2) |
Since we are interested in studying the limit of the S(E)IR process on locally tree-like graphs with and converging to a limit random tree, we need to define on a possibly infinite tree . Intuitively, is a Markov jump process with the same rates as described above, but due to randomness in the tree structure, a rigorous definition (and subsequent characterization of properties) is most conveniently expressed in terms of the following (standard) Ulam-Harris-Neveu labeling which identifies each realization of with a subgraph of the graph of all possible vertices. The latter has vertex set , where denotes the root, and edges , where denotes concatenation, with the convention for all . For , we also let . Given a vertex , denote by its parent, defined to be the unique such that there exists with . The children of a vertex are defined to be the set .
Given a tree with root , we identify it (uniquely up to root preserving automorphisms of ) as a subgraph of via a map from the vertex set of to such that
-
(i)
;
-
(ii)
;
-
(iii)
for at graph distance111given two vertices and in a graph , the graph distance between them is the minimum number of edges on a path from to . from , and .
In order to represent elements in as marks on , we consider a new mark , and define . Given , we extend it to an element in by setting for all . Whenever we consider a graph and , we use and denote neighborhoods and degrees with respect to . We use to refer to the boundary in of a set , and set for . Given an interval and a metric space, let be the space of càdlàg functions222right continuous functions with finite left limits at every in the interior of . equipped with the Skorokhod topology. For a (possibly random) element in and , we write and . Throughout, we write , and we set to be the union of and the single element consisting of the constant- function.
For we write . Also, for simplicity, we identify the states with the vector , and the set of possible jumps with . The jump rate function is then given by
(4.3) |
Remark 4.1.
Given and , we define by for all We define as a continuous time Markov chain on with jump directions and corresponding jump rates at time given by . The initial state of the process is given by , where satisfies the following assumption.
Assumption D.
Let be a collection of i.i.d. -valued random variables with common law given by (4.1). Let be a -valued random variables independent of such that the subgraph of induced by is equal in law to a UGW tree. The -valued random variable satisfies
We can easily recover the graph from the process as follows:
Since the graph can be infinite, it is no longer immediate that the process with the intuitive description above is well defined (see [Ganguly2022hydrodynamic, Appendix A]). However, since is a UGW with having a finite second moment (see Assumption B), this is guaranteed by the following result proved in [Ganguly2022hydrodynamic], which also characterizes as the unique in law solution of a certain jump SDE.
Lemma 4.2.
The S(E)IR process exist and is unique in law. Furthermore, its law is the unique solution to the SDE ,
(4.4) |
where is a -valued random element satisfying Assumption D and are i.i.d. Poisson point processes on with intensity measure equal to Lebesgue measure, independent of .
Proof.
Existence and uniqueness in law of the solution to the SDE (4.4) follows from [Ganguly2022hydrodynamic, Theorem 4.2] on observing that Assumption C implies [Ganguly2022hydrodynamic, Assumption 1], and that by [Ganguly2022hydrodynamic, Proposition 5.1], the UGW() tree is finitely dissociable in the sense of [Ganguly2022hydrodynamic, Definition 5.1]. ∎
We now define
(4.5) |
4.2. Proofs of Transient Results
The proof of Theorem 2.5 is presented in Section 4.2.2. The proof of Theorem 2.10 uses similar techniques, and is thus only outlined in Section 4.2.2, with details relegated to Appendix A. Both proofs rely on four preliminary results first presented in Section 4.2.1. The first ingredient (Theorem 4.5) is a convergence result from [Ganguly2022hydrodynamic], which shows that the limits of the fractions , , coincide with the root marginal probabilities of the limiting S(E)IR dynamics on the graph that arises as the local limit of the graph sequence . The second ingredient is a projection result (Proposition 4.6) that identifies the law of the marginal dynamics on in terms of a certain (a priori non-Markovian) jump process with somewhat implicit jump rates. This result is a generalization of similar projection results obtained in [Ganguly2023marginal, Ganguly2023characterization]. The third and fourth results (Proposition 4.7 and Proposition 4.8) identify key conditional independence and symmetry properties of the dynamics to explicitly identify the jump rates of the marginal dynamics.
Remark 4.4.
For a general class of interacting particle systems (IPS) on UGW trees whose offspring satisfies suitable moment conditions, which in particular includes the SIR and S(E)IR processes, we expect that the marginal dynamics of the IPS on the root and its neighborhood can be described autonomously in terms of a certain (non-Markovian) stochastic process. Indeed, in the special case when is a -regular tree, such a result is established in [Ganguly2023marginal] (see also [Ganguly2022nonmarkovian]) by appealing to a Markov random field property for the trajectories of the process proved in [Ganguly2022interacting, Theorem 3.7] (see also [lacker2021locally, Lacker2021marginal] for corresponding results for interacting diffusions). The current work goes beyond regular trees to include a large class of UGW trees, and also establishes a much stronger conditional independence property of the trajectories for the S(E)IR process when compared to general IPS. The latter is then used to show that for the S(E)IR process, the root marginal dynamics is in fact a Markovian process (see Remark 4.11), and thus its law can be described by a system of ODEs (namely, the forward Kolmogorov equations describing the evolution of the law of the Markov process).
We remind the reader that the standing assumptions made at the beginning of Section 4 are in effect throughout.
4.2.1. Preliminary Results
We start by stating the convergence result.
Theorem 4.5.
For every and , set
(4.6) |
For every , as ,
(4.7) |
where the convergence is in probability.
Proof.
The statement follows from [Ganguly2022hydrodynamic, Corollary 4.7] on observing that Assumption C implies [Ganguly2022hydrodynamic, Assumption 1], Assumption B, along with [Ganguly2022hydrodynamic, Corollary 5.16] implies that the graph sequence and are a.s. finitely dissociable in the sense of [Ganguly2022hydrodynamic, Definition 5.11], and that [Ganguly2022hydrodynamic, Assumption 2] holds trivially since the state is discrete. ∎
In view of Theorem 4.5, our next goal is to characterize the law of the root marginal of . We first apply a projection result that characterizes the law of any marginal for in terms of a certain jump process .
Proposition 4.6.
For every finite , , and , there exists a Borel measurable function such that
-
(1)
the function is càglàd333left continuous with finite right limits at every . for all ;
-
(2)
the function is predictable in the sense that for any and , whenever ;
-
(3)
for every , the stochastic process is a modification444Given two stochastic processes and defined on the same probability space , is a modification of if for every , . of the process .
Furthermore, , where is the pathwise unique solution to the following jump SDE
(4.8) |
where is a -valued random variable satisfying Assumption D, and are i.i.d. Poisson point processes on with intensity measure equal to Lebesgue measure, independent of .
Proof.
In the case when is a deterministic -regular tree, this was proved in Lemma 9.1 and Proposition 9.2 of [Ganguly2022nonmarkovian]; see also [Ganguly2023marginal]. Using a general result from [Ganguly2022interacting, Corollary 4.11], this can be extended to a class of Galton-Watson trees that include the ones considered in Assumption B; we refer the reader to [Ganguly2023characterization] for full details. ∎
Using Proposition 4.6, the law of can be characterized in terms of a jump process . However, the jump rates of the latter process are a priori path-dependent and not very explicit. We now identify two additional properties that allow us to simplify the form of these jump rates and thereby show that is in fact a nonlinear Markov process (see Remark 4.11), that is, a (time-inhomogeneous) Markov process whose transition rates depend not only on the current state but also on the law of the current state.
For a set , we let denote the vector in whose every coordinate is equal to .
Proposition 4.7.
For every , with , and ,
(4.9) |
Moreover, for every , the processes , are conditionally independent given and the degree of .
Proposition 4.8.
For every , and , the conditional probability does not depend on the choice of and .
The proof of Proposition 4.8 proceeds by exploiting the conditional independence property in Proposition 4.7 along with symmetry properties and well-posedness of the SDE (4.4) to show that for all and . The details are relegated to the end of Section 5.
We conclude this section with an elementary result we use repeatedly in the sequel.
Lemma 4.9.
Let be a probability space, and suppose that with and . Then,
(4.10) |
Proof.
Let be as in the statement of the lemma. By the definition of conditional probability, and some simple arithmetic manipulation,
(4.11) |
∎
4.2.2. Proof of Theorem 2.5
We can now complete the proof of our main result for the SIR process by characterizing the time marginals of for the special case , which by Remark 4.3 is equal to the marginal at the root of the SIR process on the possibly infinite tree . For , and , define
(4.12) | ||||||
where is the degree of the vertex , and where we recall that is equivalent to . When clear from context, we omit the dependence on and simply write and .
Proof.
Throughout the proof, in order to simplify the notation we write in lieu of , the SIR process on , and in lieu of for the jump rates defined in (4.3). We start by observing that, by Assumption D, and . Since, clearly , the initial condition (2.5) are established. By the fundamental theorem of calculus, , which is the third equation in (2.4).
We now turn to the derivation of the evolution of and . This requires us to simultaneously track the evolution of two nodes, and , since and are conditional probabilities associate with the joint law of and . To start with, we apply the projection result of Proposition 4.6, with and , to conclude that the joint marginal has the same law as the jump process on that has predictable jump rates
(4.13) |
, and , which satisfy, for every almost surely555The dependence of the allowed jump on the state is a notational nuisance that is a mere artifact of our using a common framework to analyze both the SIR and SEIR processes. Indeed, this is because when we use the common (ordered) state space for both processes, then the SIR process allows only jumps of size from the state S (going from S to I and skipping over E), and only jumps of size from the state I (going from I to R).
(4.14) |
Next, we use the specific form of , as defined in (4.3) and Propositions 4.7 and 4.8 to obtain a more explicit description of , . Since the probabilities and are conditioned on and on (and using the fact that a particle that is in state remains in that state for all subsequent times), we only need to consider the jump intensities , , on the events and .
Define . Recalling the definition of from (4.3), is the cumulative conditional rate at which the children of infect at time , given (which also implies ). Similarly, let be the cumulative conditional rate at which the neighbors of the root other than vertex infect the root at time , given . By Proposition 4.7, for with ,
(4.15) |
Using (4.3) and (4.15), on the event ,
Similarly, on the event ,
Therefore, we can treat as a two particle jump processes driven by Poisson noises with intensity measure equal to Lebesgue measure, whose jumps and jump rates from the states and can be summarized as follows:
Jump: | Rate at time : | |||
with all other jump rates being equal to zero. Next, we fix and we obtain expressions for in terms of , and . We first consider defined in (4.12). Using the monotonicity of the SIR dynamics, we can write
(4.16) |
By an application of Lemma 4.9, with , , and , we obtain
(4.17) |
Since is the rate at which leaves the state , the numerator in the right-hand side of (4.17) is equal to . For the denominator, observe that the rate on the event is equal to
where the first equality follows from (4.3) with , and the second follows from the definition of in (4.12) and by (4.15) (on observing that the event is -measurable). Therefore, it follows that
(4.18) |
which implies that
(4.19) |
In turn, this implies
(4.20) |
Similarly, recalling that from (4.12), using the fact that a particle that at time is in state could only have been in states or at time , and using a similar derivation as in (4.16)-(4.19),
(4.21) |
which implies that
(4.22) |
It follows that
(4.23) |
In view of (4.20) and (4.23) all that is left to find is an expression for , the conditional rate at which the children of vertex infect vertex at time , given , in terms only of and . By Proposition 4.7, is conditionally independent of given . Also by Proposition 4.7, , are conditionally i.i.d. given and , and by Proposition 4.8,
for . This implies that
(4.24) |
Next, we find a more explicit description of the conditional expectation in the last line of (4.24). Let . For , define
(4.25) |
Then, observing that implies that ,
(4.26) |
By (4.3), the conditional rate at which the individual at is infected, given that and , is
(4.27) |
where the second equality follows from Proposition 4.7 and Proposition 4.8, and the first equality follows from an application of Proposition 4.7 with , and . Setting , using the monotonicty (4.2) of the SIR process in the first equality and (4.27) in the second, we have
(4.28) |
and it follows that
and, since by Assumption D,
(4.29) |
Next, observing that since is a UGW, and
the expression in (4.26) can be rewritten as
(4.30) |
where in the third equality we used (4.29). Combining (4.30) and (4.24), and recalling that , we obtain
(4.31) |
As desired, this expresses purely in terms of and . Combining (4.31) with (4.20) and (4.23) establishes the first and second equation of (2.4), thus concluding the proof. ∎
Remark 4.11.
In the proof of Theorem 4.10 we showed that the jump rate as defined in (4.13) is not path dependent on the event . By a similar argument that appeals to Proposition 4.7, one can show that is also not path dependent on the event , thereby showing that is a Markov process. The analogue of the latter property can also be shown to hold for the discrete-time SIR process using a similar (in fact, simpler) proof. Numerical evidence supporting this property for the discrete-time SIR process on trees was first provided in [WortThesis18].
Theorem 4.12.
Proof.
Throughout the proof, in order to simplify the notation we write in lieu of . By Assumption A, the fact that defined in (4.12) is continuous (since by Theorem (4.10) it is characterized in terms of the solution of the ODE system (2.4)-(2.5)) and the fact that the ODE system (4.32) is linear, the initial value problem (4.32)-(4.33) has a unique solution. Clearly, from (4.12), the initial conditions (4.33) hold. Next, we show that (4.32) is satisfied.
We start by considering . Fix , and . Since and is independent of , . From (4.12), noting that implicitly implies we have
(4.34) |
where , and the monotonicity (4.2) of the SIR process is used in the third and fourth equality. Since the jump rate of a susceptible individual whose neighbors’ states are equal to is equal to , we have that
(4.35) |
The expression on the right-hand side of (4.35) does not depend on the exact values of the elements of that are not equal to . Thus, substituting the expression in (4.35) into the last line of (4.34) and rewriting the sum to be over the number of infected neighbors of ,
where in the last equality we used the monotonicity of the SIR process (4.2). Applying Proposition 4.7 with , it follows that are conditionally i.i.d. given . Furthermore, for and , by Proposition 4.8 and another application of Proposition 4.7 with , and , and observing that , we have that
where is as in (4.12). Therefore, conditional on and , has a binomial distribution with parameters . It follows that, letting be a binomial random variable with parameters ,
(4.36) |
This implies
(4.37) |
which proves the first equation in (4.32)
The derivations of the ODEs for and are similar, and are thus only outlined below. As in the last line of (4.34), we start by writing
(4.38) |
where for and
Recalling the definition of the SIR rates as in (4.3) and using arguments similar to what used to derive (4.35)-(4.36), and
(4.39) |
Substituting the last two displays into (4.38), we obtain ,which implies the second equation in (4.32).
Next, to obtain the ODE for note that by definition of the jump rate (4.3), setting ,
(4.40) |
which implies the third equation in (4.32) and concludes the proof.
∎
We can combine the results above to prove Theorem 2.5.
Proof of Theorem 2.5.
By Theorem 4.5, and . By Theorem 4.12, we can characterize the transition rates of defined in (4.12) as the solution to the ODE system (4.32)-(4.33). Let and be as in (4.12), and , .Then we can solve the ODE system (4.32)-(4.33) as follows:
In view of (4.12), by averaging over , that is, by multiplying each of the quantities above by and summing over , we conclude that
where , and the exchange in order of summation and integration is justified by the fact that every term is non-negative. By Theorem 4.10, , , solve the ODE system (2.4)-(2.5). Finally, since and , equation (2.7) follows. This completes the proof. ∎
4.2.3. Proof of Theorem 2.10
Now, we turn our attention to the SEIR process. Since its derivation is similar to that of Theorem 2.5, we relegate most of the details to Appendix A. For , and , define
(4.41) | ||||||
When clear from the context, we omit the dependence on and write and .
Theorem 4.13.
Theorem 4.14.
Let be as in (4.41) and set . Then , , , is the unique solution to the following system of ODEs:
(4.42) |
with initial conditions
(4.43) |
The proof of Theorem 4.14 is given in Appendix A. We conclude this section by outlining how the last two theorems are used to prove Theorem 2.10.
Proof of Theorem 2.10.
By Theorem 4.5, , , and . By Theorem 4.14, we can characterize the transition rates of , given in (4.41) as the solution to the system of ODEs (4.42)-(4.43). We can solve these ODEs to obtain an expression for in terms of and (defined in (4.41)) which, along with for , by Theorem 4.13, solve the ODEs (2.11)-(2.12). Observing that for all and , and noting that
establishes the theorem. ∎
4.3. Proofs related to the Outbreak Size
In this section, we prove Theorem 3.1 and Theorem 3.5, which characterize the large limit of the total fraction of individuals still susceptible at the end of an SIR or SEIR outbreak on the locally-tree like graph sequences we consider. Recall the standing assumptions made at the beginning of Section 4. We start by introducing some notation to simplify the exposition. First, define
(4.44) |
and recalling that is the moment generating function of , set
(4.45) |
For all we have . Furthermore, for , , where the interchange of the sum and derivative is justified because and has finite mean. We start with an elementary lemma.
Lemma 4.15.
is continuous and satisfies the following properties:
-
(i)
;
-
(ii)
;
-
(iii)
is non-increasing in , and strictly decreasing if for every , .
Proof.
The property (i) follows immediately from the relation .
The stated continuity of follows from the dominated convergence theorem and the fact that has finite mean, which follows from (2.2) and Assumption B. In turn, by the dominated convergence theorem, the latter implies that . If then , and by (4.45) it follows that . On the other hand, if , then
(4.46) |
This proves (ii).
Next, observe that
Since the moment generating function of any measure in is log-convex (which follows from an application of Hölder’s inequality), and strictly log-convex unless the measure is equal to for , (iii) follows. ∎
We now prove Theorem 3.1.
Proof of Theorem 3.1.
Let and be as in (4.12) and set . By (2.7), . By the dominated convergence theorem, is continuous on .
We now turn to the study of the large-time limit of .
By Theorem 2.10, satisfy the ODE system (2.4). For any and , the point is a fixed point of the system. We claim that as , converges to one such point, and then identify the corresponding as the solution of an equation. Near any such that , is strictly increasing, and thus it is invertible. Let , which exists since is non-decreasing. We can change variables for and write and . We write (resp. ) for the composition of (resp. ) with . Recalling the definition of in (4.45), we rewrite the first two equations in (2.4) as
(4.47) |
Since , and , we can solve the first equation to obtain , which is equivalent to
(4.48) |
Substituting this into the second equation in (4.47), we obtain a linear ODE for . Recalling that and that , we solve this equation to obtain
(4.49) |
where in the second line we used the fact that , and in the first and third line we applied (4.48).
We now claim that (4.49) shows that . Since and satisfies Assumption A, this implies that . First, observe that, if there exists such that , then, by (2.4), for all . Next, suppose for the sake of contradiction that . Then, for all , . By Assumption A, it then follows that for all . By definition, , and so for all . In particular, . But letting , (4.49) then implies that , which is a contradiction. Therefore, we conclude that and, thus, .
If there exists such that for all , then the integral in the rightmost expression in (3.1) is equal to , and thus (3.1) reduces to (3.2). Let be given by (3.4). Using the fact that moment generating functions are log-convex, it follows that is convex. Furthermore, is continuous on , and . Therefore, (3.2) has a unique positive solution. This concludes the proof. ∎
We conclude this section by providing a similar characterization of the outbreak size for the SEIR process.
Proof of Theorem 3.5.
Let be as in (4.41), and set for . Note that by (2.13), and by the dominated convergence theorem, (the moment generating function of ) is continuous on .
We now study the large-time limit of . By Theorem 4.13, satisfy the system of ODEs (2.11). Near any such that , is strictly increasing, and, therefore invertible. Let , which exists since is non-decreasing. We can change variables for , write , and . We write (resp. , ) for the composition of (resp. , ) with . By (2.11), letting apostrophe denote differentiation with respect to , we have
(4.51) |
For the sake of completeness, we also include here the special case of the -regular tree (i.e., the infinite line graph), with constant and , where we can obtain an explicit expression for for all .
Proposition 4.16.
Let UGW, and suppose that there exist such that for all , and . Then, for all ,
(4.53) |
and, hence,
(4.54) |
Proof.
Let , and be as in (4.12). By Theorem 4.12, , and therefore
(4.55) |
Setting and, thus, , the first equation in (2.4) reduces to . Since and , the second equation in (2.4) reduces to
(4.56) |
This is a Bernoulli equation that can be solved explicitly. The constant function is a solution.
For the rest of this proof, we assume that . Let , so that (4.56) is . Let . For , we can divide both sides of the ODE by .
(4.57) |
If we set , for , then and the ODE in (4.57) takes the form
This is a linear equation whose explicit solution is
(4.58) |
which does not blow up in finite time, and therefore . Since , (4.58) implies
which can be integrated to conclude that
This, combined with (4.55), yields (4.53). Since , letting , we obtain (4.54). ∎
5. Proof of the Conditional Independence Property
In Section 5.2, we prove the conditional independence property stated in Proposition 4.7 and the symmetry property stated in Proposition 4.8. The proof relies on a certain change of measure result established in [Ganguly2022interacting], which we first summarize in Section 5.1. Throughout, has finite third moment, is a UGW() tree, is an interpolation parameter, the rates , and satisfy Assumption C, and is the hybrid S(E)IR process solving (4.4), with initial states satisfying Assumption D.
5.1. A Radon–Nikodym derivative
We let and for . Given and , let be the set of càdlàg functions . We start with two technical definitions.
Definition 5.1.
Given and we let . We say that is proper if for every and , .
Definition 5.2.
Fix finite, and suppose that is proper and can be ordered as a strictly increasing sequence . Then the jump characteristics of are the elements where for each with , is a vertex in such that is discontinuous at time , and is the size of the jump .
Given and , we also define a function from the set of functions into by
(5.1) |
We also recall that .
We now state a change of measure result that is established, for general interacting jump processes, in [Ganguly2022interacting]. In the sequel, the exact definition of the reference processes presented below will not be important, and so we state the following proposition to summarize some key properties we use.
Proposition 5.3.
Proof.
An explicit definition of the processes as a solution of a SDE related to (4.4) is given in [Ganguly2022interacting, (4.3)] by substituting the rate function to the rate functions used therein. Assumption 4.1 in [Ganguly2022interacting], i.e., the well-posedness of , follows from an application of [Ganguly2022hydrodynamic, Theorem C.2] on observing that [Ganguly2022hydrodynamic, Assumption C.1] holds by Assumption B, the definition of in (4.3), and the form of the driving noises in (4.4). Assumption C implies that [Ganguly2022interacting, Assumption 3.1, Assumption 3.4] holds with in place of .
Given , and we define
(5.4) |
5.2. Proof of Proposition 4.7
We start by establishing a factorization result for the Radon-Nikodym derivative established in 5.1. We recall that denote the neighborhood in of . We also set .
Lemma 5.4.
Let and fix with and such that and form a partition of . Let and be as in Proposition 5.3. Then there exist measurable functions and such that for every
(5.5) |
Proof.
Fix as in the statement of the lemma, and . Set , where the latter is defined in (5.4). For and proper define
(5.6) |
where are the jump characteristics of . When is not proper, set . Also, for , , and , define
(5.7) |
By Proposition 5.3, the jump characteristics of are almost surely well-defined. On the event that they exist, the jump characteristics of are a disjoint union of those of for . We can then rewrite (5.3) as
Since and forms a partition of , we can further decompose the right-hand side as
(5.8) |
where for ease of notation in the sequel, we set , which we can be done in (5.8) since does not depend on . The product in the inner bracket is a function of when , and a function of when . Thus, to prove (5.5) it suffices to show that for each , there exist measurable functions and such that almost surely on
(5.9) |
By the monotonicity of the S(E)IR dynamics given in (4.2), on the set of times given by the jump characteristics of is empty. Hence, almost surely,
(5.10) |
Recalling the identification of the states with and the definition in (4.3), for and , on the event we have
(5.11) |
For convenience of notation, set . Then for , using first (5.6) and (5.10), and then (5.11) and the fact that ,
(5.12) |
which shows that each term in (5.9) admits the desired factorization. It only remains to show that the same holds for the term in (5.9). To this end, note that for , by (5.7),
(5.13) |
where is the product of the first and last term in the penultimate line of the display, and , , is the -th term of the penultimate line of the display. Since and is a tree, either or . Hence, the last line of (5.13) factors as desired. Similarly, if , by (5.7) we have
(5.14) |
where is the product of the first and last term in the penultimate line of the display, and with is the -th term of the penultimate line of the display. Together (5.12), (5.14) and (5.13) prove (5.9) and, hence, admits the factorization stated in (5.5). ∎
We conclude this section by proving Proposition 4.7.
Proof of Proposition 4.7.
Throughout the proof we fix , and ), and we omit the dependence of on them. Let be a partition of with being finite. Pick such that . We define by . We observe that , where the latter is defined in (5.4). Let be a bounded, -measurable random variable. Adopting the convention , and using Lemma 5.4 and Bayes’s theorem in the first line, and the property (5.2) in the last line, we have
The last quotient is -measurable. As this holds for every bounded -measurable random variable we conclude that
Since , if follows that
(5.15) |
which proves the first assertion of the proposition.
Next, let and . Set . The event is clearly the same as the event . In the sequel, we condition on the event . If , the set of children of in is empty, and if , the set of children of in is a singleton. In either case, the stated conditional independence holds trivially. Suppose that and for , we fix . For , let denote the subtree of rooted at . By the definition of the jump rate in (4.3), and the SDE characterization (4.4) from Lemma 4.2, if and only for all with and for all with . Using first this fact, and then applying (5.15) with , and , we have
(5.16) |
For each , another application of (5.15), with , and yields
It follows that for and ,
(5.17) |
By iteratively applying (5.17), we obtain
which along with (5.16) establishes the second assertion of the theorem and concludes the proof. ∎
We conclude this section by using Proposition 4.7 and properties of the SDE (4.4) to derive Proposition 4.8.
Proof of Proposition 4.8.
Fix and, on the event , let be the subtree of rooted at , i.e., where . By Assumption D, is a Galton-Watson tree with offspring distribution on the event . Recall that satisfies the SDE (4.4), and define the modified process on by ,
(5.18) |
Fix , and let . By (4.4) and Assumption D, implies and hence, that
(5.19) |
where the second equality follows from the monotonicity property of the S(E)IR process, see (4.2). Applying Proposition 4.7 with , and B=, it follows that is conditionally independent of given . Thus, by (5.18) and (5.19),
(5.20) |
Next, fix , and define a map given by and for , , and for all , recalling that represent concatenation of . Then defines an isomorphism of the rooted graphs and . It follows from (5.18) and the form of the SDE (4.4) that
and in particular,
(5.21) |
which follows from the independence of from the driving Poisson processes in the SDE (4.4) for and the fact that implies . By the well-posedness of the SDE (4.4) established in Lemma 4.2, it follows that the left-hand side of (5.21) does not depend on the choice of and , thus proving the proposition. ∎
Appendix A Proofs of intermediate SEIR dynamics Results
In this section, we prove Theorem 4.14 and Theorem 4.13, thus completing the proof of Theorem 2.10. Throughout, , is the size-biased version of , as defined in (2.2), and is a UGW() tree. We assume that has finite third moment and, as everywhere else in the paper, we assume that the rates satisfy Assumption C. We assume that Assumption D hold.
We start by proving the ODE characterization of and .
Proof of Theorem 4.13.
Throughout the proof in order to simplify notation we write in lieu of , the SEIR process on , and in lieu of , the rate function defined in (4.3). By Assumption D, , and . Clearly, . Therefore, the initial conditions (2.12) hold. By the fundamental theorem of calculus, , which is the fourth equation in (2.11).
We now turn to the derivation of the evolution of and . This requires keeping track of two states simultaneously since , and are conditional probabilities associated with the joint law of and . To start, we apply Proposition 4.6 with and to conclude that has the same law as the jump process on the state space with jump rates , , , which satisfy, for every , almost surely
(A.1) |
Next, we use the specific form of , as defined in (4.3) and Propositions 4.7 and 4.8 to obtain a more explicit description of , . Since the probabilities , are conditioned on and (and using the fact that an individual that is in state remains in that state for all subsequent times), we only need to consider the jumps , on the events , and .
For with , define . By the definition of the SEIR jump rates in (4.3), is the conditional cumulative rate at which the neighbors of other that infect the individual at at time . By Proposition 4.7,
(A.2) |
Using (4.3), (A.1) and Proposition 4.6, and proceeding similarly as in the proof of Theorem 4.10, we can treat as a two particle jump process driven by Poisson noises with intensity measure equal to Lebesgue measure, whose jumps and jump rates from the states , and can be summarized as follows.
Jump: | Rate at time : | |||
with all other rates being equal to zero. Next we fix and and obtain expressions for , and in terms of , , , , , and . We first consider , defined in (4.41). Using monotonicity of the SEIR dynamics, we can write
(A.3) |
By an application of Lemma 4.9 with , , , we obtain
(A.4) |
Since is the rate at which leaves the state , the numerator on the right-hand side of (A.4) is equal to . For the denominator, observe that the rate on the event is equal to
where the first equality follows from (4.3) with , and the second follows from the definition of in (4.41) and by (A.2) (on observing that the event is -measurable). Therefore, it follows that
Which implies
In turn, this implies
(A.5) |
Similarly, recalling that from (4.41), and using the monotonicity property (4.2) with , by a similar derivation as (A.3)-(A.5),
and, hence,
It follows that
(A.6) |
Next, we see that
by the monotonicity property (4.2) with and by the fact that the probability that two jumps occur in an interval of length is , since the driving noises as in Proposition 4.6 are independent Poisson point processes with intensity measure equal to Lebesgue measure. We then have
which implies the third equation in (2.11).
Proof of Theorem 4.14.
Throughout the proof, we simplify the notation and write in lieu of . By Assumption C, the fact that is continuous (which follows from Theorem 4.13), and the fact that the ODE (4.42) is linear, the initial value problem (4.42)-(4.43) has a unique solution. Clearly by (4.41) the initial conditions (4.43) hold.
To prove (4.42) we proceed similarly as in the proof of Theorem 4.12. We start by considering . Fix , and in the support of . Then, using the monotonicity of the SEIR process (see (4.2)) in the second quality, and the fact that implies that ,
(A.7) |
where . Since by (4.3) the jump rate of a susceptible individual with neighbors is equal to , it follows that
(A.8) |
The right-hand side does not depend on the exact states of the neighbors of the root that are not in state . Thus, substituting the expression in (A.8) into the last line of (A.7) and rewriting the sum to be over the number of infected neighbors of ,
(A.9) |
Letting in Proposition 4.7, it follows that are conditionally i.i.d. given and . For each , by Proposition 4.8 and an Application of Proposition 4.7 with , the subtree rooted at , and , observing that , we have that
where is defined in (4.41). It follows that, conditional on and , has binomial distribution with parameters , . Letting be a binomial random variable with parameters , it follows from (A.9) that
(A.10) |
and, thus,
which proves the first equation in (4.42). The derivation of the ODEs for and is similar and outlined below. As in the last line of (A.7) write,
(A.11) |
where, for ,
Recalling the definition of the rates in (4.3) and using arguments similar to what used to derive (A.8)-(A.10), and
Therefore, which implies the second equation in (4.42). Proceeding similarly, we obtain the relation
and
which imply the third and fifth equations in (4.42). Setting , and , for we see that
which proves the fourth and sixth equations in (4.42), thus concluding the proof.
∎
Appendix B Proof of Proposition 2.4
In this section we prove the well-posedness of the ODE system (2.4)-(2.5). We start with the following elementary result.
Lemma B.1.
Suppose that has a finite third moment. Then , defined in (4.45), is Lipschitz continuous on .
Proof.
It is easy to see that under the assumption that has a finite third moment, the size-biased distribution , defined in (2.2), has a finite second moment. Indeed, let and be random variables with laws and , respectively. By (2.2), it is easy to see that
which is finite since has finite third moment.
For note that , and so by the dominated convergence theorem . Since has finite second moment, again by the dominated convergence theorem , is continuous on and . Thus, it follows from the limits established above that
(B.1) |
Now, setting for conciseness, it follows that
(B.2) |
By Lemma 4.15, is bounded on . Furthermore, . Recall the quantity introduced in (4.44). Using (B.1) for the case (which is equivalent to ), and a similar argument as (4.46) in Lemma 4.15 for the case , we have
(B.3) |
Together with (B.2), the continuity of on and the continuity of and on , this implies that is uniformly bounded on . This completes the proof. ∎
Proof of Proposition 2.4.
By Assumption A, and are continuous in . By Lemma 4.15, is continuous in . Therefore, the right-hand side of the ODE (2.4) is continuous and so by Peano’s existence theorem, there exists and a solution ,, to (2.4)-(2.5) on .
Next, fix . We claim that ,,. Since and and the right-hand side of the first (respectively, second) equation in (2.4) is equal to whenever (respectively, ), it follows that (respectively, ). In turn, this implies that , and therefore that (since and ). Now, by summing the first two equations in (2.4), we obtain
(B.4) |
Since , it follows that is strictly decreasing in , and in particular .