Research Article | Open Access
SEIR Epidemic Dynamics in Random Networks
Predicting disease transmission on complex networks has attracted considerable recent attention in the epidemiology community. In this paper, we develop a low-dimensional system of nonlinear ordinary differential equations to model the susceptible-exposed-infectious-recovered (SEIR) epidemics on random network with arbitrary degree distributions. Both the final size of epidemics and the time-dependent behaviors are derived within our simple framework. The underlying network is represented by the configuration model, which appropriately accounts for the heterogeneity and finiteness of the degree observed in a variety of real contact networks. Moreover, a generalized model where the infectious state of individual can be skipped is treated in brief.
Infectious diseases spread over networks of contacts between susceptible and infectious individuals. Typical mathematical representation of an epidemic assumes that the host populations are fully mixed (mass-action approximation) [1, 2], that is, every individual has an equal opportunity to infect others and the underlying network topology is modelled as a fully connected graph. However, in the real world, the contact patterns are characterized by high levels of heterogeneity and each individual only has contact with a small fraction of the population [3–5].
In recent years, a number of researches have addressed the contact patterns among individuals as random networks [6–14], which allow for more realistic and accurate capture of heterogeneities in the number of contacts compared with classical fully mixed models. Network epidemic models make use of network topology of potential contacts instead of assuming that contact is possible with the total population. Some quantities of interest such as epidemic probability and mean final size of epidemics have been precisely solved in random networks with specified degree distributions (configuration models) using ideas drawn from percolation theory [9, 10, 15].
The heterogeneity introduced in the network framework, nevertheless, makes it rather difficult to analytically describe the time-dependent properties and the dynamical course of an epidemic. Some researchers made it by using high-dimensional pair-approximation methods (or moment closure methods) [4, 16, 17], which typically neglect the correlations between the states of nodes some steps away from each other, while others adopted approximate approaches that assume all nodes of the same degree having the same infection probability at any given time [3, 18, 19]. In addition, a good deal of effort has been devoted to simulation-based studies of epidemic dynamics [20–22].
Recently, Volz  and Miller  manage to introduce a low-dimensional system of nonlinear ordinary differential equations to model susceptible-infected-recovered (SIR) epidemics on random networks assuming infection and recovery occur at constant rates. A variant SIR model is also developed in . Their calculations account for the effects induced by heterogeneous connectivity and finiteness of degree that are missed in standard well-mixed SIR equations. In contrast to the prior moment closure methods, the number of equations in the resulting system does not grow with the number of different degrees.
In the present paper, we move a further step beyond this framework by considering more complex susceptible-exposed-infectious-recovered (SEIR) epidemics in random networks, where an exposed period exists during which the individual has been infected but cannot transmit infection. We show that it is possible to analyze the dynamics of SEIR epidemics spread on configuration models  using a coupled system of only three ordinary differential equations. The epidemic growth at any given time as well as its final size are investigated in this relatively simple framework, which is less computationally demanding and amenable to the analytical derivations. We also consider a situation where a host can be recovered directly after it is exposed. If a disease, for example, is detected and treated in the exposed status, no secondary infection will occur. Still, we will see that three differential equations suffice in this scenario.
The rest of the paper is organized as follows. In Section 2, we develop the theoretical framework and present some preliminaries. The network SEIR dynamics and its generation are then developed in Sections 3 and 4, respectively. Finally, we discuss the applicability and limitations in Section 5 with several open problems.
2. Definitions and Notations
Let the population of interest consist of individuals represented by a network with nodes. The population is modeled by the configuration model , in which the degree distribution is specified, but the graph is in other respects random. To define a configuration model network, one specifies the degree distribution by giving the properly normalized probability that a randomly chosen node has degree . To each node assign an i.i.d. degree drawn from the distribution . If the sum of degrees is odd, all degrees are reassigned until the sum is even. Then generate a set of half-edges with copies of node for all nodes. A pair of these stubs is then chosen uniformly at random and connected together to form a complete edge while is not empty. This procedure generates a uniform choice from the set of all networks with the specified degree distribution. The resulting network has negligible loops and multiple edges in the limit of large network size for degree distributions with finite mean .
The probability generating function  of the degree distribution is defined as where the dummy variable serves as a placeholder. The mean degree of the network is then given by .
Nodes in the network fall into one of four exclusive states: susceptible, exposed, infectious, or recovered. In many infectious diseases, there is a period of time after the transmission of infection from susceptibles to potentially infective members but before these potential infectives develop symptoms and become infectious. This latent period is usually called exposed one . We denote the fraction of the population in each state at time by , and , respectively.
The dynamics of the disease propagation can be described as follows. An infectious node transmit infection to each of its neighbors independently at a constant rate . A susceptible node becomes infected and hence assigned to the exposed state, at rate where is the number of infectious neighbors it has. Exposed nodes become infectious at a constant rate . Once infectious, a node recovers (becomes immune) at a constant rate , whereupon it will never infect any neighbors. By definition, we have . A flow chart is shown in Figure 1.
Similarly, as in [23–25], we define an “infectious contact” from an infected node to its neighbor to be a contact that would cause infection of if were susceptible. Now, we choose a node in the network uniformly at random and modify the spread of the disease by disallowing infectious contacts from to its neighbors. Denote a neighbor of by . Let be the probability that there has not been infectious contact from to at time . It is noteworthy that, by doing so, disease transmission along different edges to node is independent. Moreover, disallowing infection originated from does not modify the probability that has become infected (more precisely, exposed), although it does influence the dynamics after is infected (more precisely, infectious). Hence, if has neighbors (i.e., ), then the probability that is still susceptible at time is . In what follows, we refer to as a base node while as a target node. will be a critical quantity in our latter derivation.
3. Network SEIR Dynamics
In the limit as population size goes to infinity, the epidemic spread can be viewed effectively as a deterministic behavior in terms of expected fractions () of the entire population size . In this section, we aim to derive a low-dimensional system of ordinary differential equations to characterize exactly the epidemic dynamics.
To derive the dynamics of , we need to introduce two augmented variables. Let be the probability that the base node of an edge from to is exposed, and the edge has not transmitted an infectious contact at time . Similarly, let be the probability that the base node of an edge is infectious, but the edge has not transmitted an infectious contact at time . Note that those edges which satisfy the definitions for or are subsets of those which satisfy the definition for .
Since the rate of change in the probability, a random edge that has not transmitted infection is equal to the rate at which infection crosses edges, we have An edge from to begins to satisfy the definition of if the base node becomes exposed. The rate at which neighbors of target node become exposed matches the rate at which neighbors stop being susceptible. On the other hand, an edge no longer satisfies the definition for when infection crosses the edge or when the base node becomes infectious. Set to be the probability that a neighbor is susceptible. Hence, we obtain Likewise, an edge from to begins to satisfy the definition of if the base node becomes infectious. An edge no longer satisfies the definition for when infection crosses the edge or when the base node recovers. Recall that only infectious state can transmit disease. Then we have
Now we need to calculate . The probability that a neighbor reached following a randomly chosen edge has degree is expressed by the excess degree distribution . By our assumption, the neighbor can only be infected by an edge other than the one starting from the target node . Therefore, by virtue of Definition (1). Thus, we obtain using (3). Substituting (7) into (4) and (5), we have
Finally, we can calculate the fraction of susceptible nodes directly by solving the coupled system of (3), (8), and (9). Furthermore, the values of , , and can be derived in light of and the appropriate normalization . The complete system of equations is summarized in Table 1.
Note that we can reproduce the network SIR dynamics by letting go to infinity. In fact, by definition tends to 0 as approaches infinity. Hence, (8) breaks down while (9) asymptotically becomes which is equivalent to the dynamics describe by [24, equation (3)] for the SIR model.
3.1. Final Epidemic Size
The expected final size of network SEIR epidemics in the limit of infinite networks can be derived easily within our framework. By letting , or equivalently , we arrive at . It follows from (11) that , which yields . Consequently, the final size of an epidemic is simply given by
3.2. Initial Conditions
In order to solve our equations, we need to find initial conditions. The initial conditions for the model can be chosen in many ways, but the most typical is to assume that a single node or a small fraction of nodes in the network are selected at random and initially infected.
The quantity can be viewed as the fraction of nodes remaining susceptible. We then have with . The initial values of and can be set to and , respectively, with in the limit of large population size .
4. A Generalization
In this section, we consider a generalization of the SEIR model discussed above. A disease may not become infectious if treated in time once an individual is exposed. Hence, we denote by a probability that an exposed node will become infectious (at a rate ). With probability , an exposed node will recover (at a rate ). The corresponding flow chart can be shown as Figure 2.
Although most of the derivation in Section 3 still applies, we need to make some modifications to incorporate the new situation. Equation (4) should be replaced by since only a fraction of exposed nodes will develop to infectious period. Similarly, (10) and (11) will be reformulated as respectively. It is clear that the system reproduces the SEIR model when .
In this paper, we proposed a low-dimensional system of nonlinear ordinary equations to model SEIR epidemics in random networks. The calculations for the dynamic time-dependent behavior as well as the final size of the epidemic are placed in a common framework extending the prior work [23–25] on SIR epidemic models. A modification of the SEIR model where the state may be skipped is also addressed.
The network used in the present study is a static configuration model. It would be highly desirable to extend the static random networks to dynamic ones . Future research could be enhanced by invoking time-varying rates of infection and recovery, and more elaborated (realistic) models of epidemics may be considered. For example, epidemic spreading on random clustered networks are explored in . Optimal strategies for various applications such as cyber security  and vaccination  are also valuable. Validation in a real-world setting is needed to establish the statistical models so that it can be in fact used to predict disease transmission.
Immunization strategies may also be taken into account. In , the authors proposed a distributive immunization where a recovered node can create an immunization agent with some given probabilities. The agent then spreads to all neighbors and immunizes the susceptible ones among them. Therefore, its dynamics can be viewed as a competition between two types of diffusion processes on a network: one transmits disease while the other transmits immune. It is hoped that the methodology described in the paper can be helpful in capturing this distributive immunization mechanism.
- R. M. Anderson and R. M. May, Infectious Diseases of Humans: Dynamics and Control, Oxford University Press, New York, NY, USA, 1991.
- H. W. Hethcote, “The mathematics of infectious diseases,” SIAM Review, vol. 42, no. 4, pp. 599–653, 2000.
- M. Barthélemy, A. Barrat, R. Pastor-Satorras, and A. Vespignani, “Dynamical patterns of epidemic outbreaks in complex heterogeneous networks,” Journal of Theoretical Biology, vol. 235, no. 2, pp. 275–288, 2005.
- K. T. D. Eames and M. J. Keeling, “Modeling dynamic and network heterogeneities in the spread of sexually transmitted disease,” Proceedings of the National Academy of Sciences United States of America, vol. 99, no. 20, pp. 13330–13335, 2002.
- Y. Shang, “Likelihood estimation for stochastic epidemics with heterogeneous mixing populations,” International Journal of Computational and Mathematical Sciences, vol. 6, pp. 34–38, 2012.
- Y. Shang, “Multi-agent coordination in directed moving neighborhood random networks,” Chinese Physics B, vol. 19, no. 7, Article ID 070201, 2010.
- E. Kenah and J. M. Robins, “Second look at the spread of epidemics on networks,” Physical Review E, vol. 76, no. 3, Article ID 036113, 2007.
- F. Liljeros, C. R. Edling, L. A. N. Amaral, H. E. Stanley, and Y. Åberg, “The web of human sexual contacts,” Nature, vol. 411, pp. 907–908, 2001.
- L. A. Meyers, B. Pourbohloul, M. E. J. Newman, D. M. Skowronski, and R. C. Brunham, “Network theory and SARS: predicting outbreak diversity,” Journal of Theoretical Biology, vol. 232, no. 1, pp. 71–81, 2005.
- M. E. J. Newman, “Spread of epidemic disease on networks,” Physical Review E, vol. 66, no. 1, Article ID 016128, 11 pages, 2002.
- M. E. J. Newman, Networks: An Introduction, Oxford University Press, New York, NY, USA, 2010.
- M. E. J. Newman, A.-L. Barabási, and D. J. Watts, The Structure and Dynamics of Networks, Princeton University Press, New Jersey, NJ, USA, 2006.
- Y. Shang, “Distribution dynamics for SIS model on random networks,” Journal of Biological System, vol. 20, no. 2, pp. 213–220, 2012.
- C. P. Warren, L. M. Sander, I. Sokolov, C. Simon, and J. Koopman, “Percolation on disordered networks as a model for epidemics,” Mathematical Biosciences, vol. 180, no. 1-2, pp. 293–305, 2002.
- D. S. Callaway, M. E. J. Newman, S. H. Strogatz, and D. J. Watts, “Network robustness and fragility: percolation on random graphs,” Physical Review Letters, vol. 85, no. 25, pp. 5468–5471, 2000.
- M. Altmann, “Susceptible-infected-removed epidemic models with dynamic partnerships,” Journal of Mathematical Biology, vol. 33, no. 6, pp. 661–675, 1995.
- C. T. Bauch, “A versatile ODE approximation to a network model for the spread of sexually transmitted diseases,” Journal of Mathematical Biology, vol. 45, no. 5, pp. 375–395, 2002.
- M. Barthélemy, A. Barrat, R. Pastor-Satorras, and A. Vespignani, “Velocity and hierarchical spread of epidemic outbreaks in scale-free networks,” Physical Review Letters, vol. 92, no. 17, Article ID 178701, 4 pages, 2004.
- R. Pastor-Satorras and A. Vespignani, “Epidemic spreading in scale-free networks,” Physical Review Letters, vol. 86, no. 14, pp. 3200–3203, 2001.
- S. E. Chick, A. L. Adams, and J. S. Koopman, “Analysis and simulation of a stochastic, discrete-individual model of STD transmission with partnership concurrency,” Mathematical Biosciences, vol. 166, no. 1, pp. 45–68, 2000.
- I. A. Doherty, S. Shiboski, J. M. Ellen, A. A. Adimora, and N. S. Padian, “Sexual bridging socially and over time: a simulation model exploring the relative effects of mixing and concurrency on viral sexually transmitted infection transmission,” Sexually Transmitted Diseases, vol. 33, no. 6, pp. 368–373, 2006.
- S. Eubank, H. Guclu, V. S. Anil-Kunar et al., “Modelling disease outbreaks in realistic urban social networks,” Nature, vol. 429, no. 6988, pp. 180–184, 2004.
- E. Volz, “SIR dynamics in random networks with heterogeneous connectivity,” Journal of Mathematical Biology, vol. 56, no. 3, pp. 293–310, 2008.
- J. C. Miller, “A note on a paper by Erik Volz: SIR dynamics in random networks,” Journal of Mathematical Biology, vol. 62, no. 3, pp. 349–358, 2011.
- Y. Shang, “Mixed SI(R) epidemic dynamics in random graphs with general degree distributions,” Applied Mathematics and Computation, vol. 219, no. 10, pp. 5042–5048, 2013.
- H. S. Wilf, Generatingfunctionology, Academic Press, Boston, Mass, USA, 1994.
- J. L. Aron and I. B. Schwartz, “Seasonality and period-doubling bifurcations in an epidemic model,” Journal of Theoretical Biology, vol. 110, no. 4, pp. 665–679, 1984.
- E. Volz and L. A. Meyers, “Susceptible-infected-recovered epidemics in dynamic contact networks,” Proceedings of the Royal Society B, vol. 274, no. 1628, pp. 2925–2933, 2007.
- J. C. Miller, “Spread of infectious disease through clustered populations,” Journal of the Royal Society Interface, vol. 6, no. 41, pp. 1121–1134, 2009.
- Y. Shang, “Optimal attack strategies in a dynamic botnet defense model,” Applied Mathematics & Information Sciences, vol. 6, pp. 29–33, 2012.
- G. Zaman, Y. H. Kang, and I. H. Jung, “Stability analysis and optimal vaccination of an SIR epidemic model,” Biosystems, vol. 93, no. 3, pp. 240–249, 2008.
- J. Goldenberg, Y. Shavit, E. Shir, and S. Solomon, “Distributive immunization of networks against viruses using the “honey-pot” architecture,” Nature Physics, vol. 1, pp. 184–188, 2005.
Copyright © 2013 Yilun Shang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.