Skip to main content
Advertisement
Browse Subject Areas
?

Click through the PLOS taxonomy to find articles in your field.

For more information about PLOS Subject Areas, click here.

  • Loading metrics

Stability Analysis of SIR Model with Distributed Delay on Complex Networks

  • Chuangxia Huang,

    Affiliations School of Mathematics and Statistics, Changsha University of Science and Technology, Changsha, Hunan 410114, China, Academy of Mathematics and Systems Science, Chinese Academy of Science, Beijing 10090, China

  • Jie Cao,

    Affiliation School of Mathematics and Statistics, Changsha University of Science and Technology, Changsha, Hunan 410114, China

  • Fenghua Wen ,

    mailtowfh@126.com

    Affiliation School of Business, Central South University, Changsha, Hunan 410083, China

  • Xiaoguang Yang

    Affiliation Academy of Mathematics and Systems Science, Chinese Academy of Science, Beijing 10090, China

Abstract

In this paper, by taking full consideration of distributed delay, demographics and contact heterogeneity of the individuals, we present a detailed analytical study of the Susceptible-Infected-Removed (SIR) epidemic model on complex population networks. The basic reproduction number of the model is dominated by the topology of the underlying network, the properties of individuals which include birth rate, death rate, removed rate and infected rate, and continuously distributed time delay. By constructing suitable Lyapunov functional and employing Kirchhoff’s matrix tree theorem, we investigate the globally asymptotical stability of the disease-free and endemic equilibrium points. Specifically, the system shows threshold behaviors: if , then the disease-free equilibrium is globally asymptotically stable, otherwise the endemic equilibrium is globally asymptotically stable. Furthermore, the obtained results show that SIR models with different types of delays have different converge time in the process of contagion: if , then the system with distributed time delay stabilizes fastest; while , the system with distributed time delay converges most slowly. The validness and effectiveness of these results are demonstrated through numerical simulations.

Introduction

The mathematical modeling of infectious disease propagation has been extensively studied by both medical practice and the academia for a long time (see, for instance, [17]). Such mathematical models focus on understanding the observed mechanisms of infectious diseases as well as predicting the consequences of the introduction of public health interventions to control the spreading of diseases [8]. In depicting the transmission of an infectious disease, the total population is commonly divided into susceptible, infectious and recovered individuals [9]. If the immunity is permanent, then we obtain an SIR model [7, 9]. The basic SIR model is formulated by Kermack and McKendrick [10] as the following: (1) where S(t), I(t), R(t) represent the density of the susceptible, infected and removed (recovered) individuals, respectively; β is the transmission coefficient between susceptible and infected individuals, and λ is the recovery rate of infected individuals, the incidence at time t is denoted by βS(t)I(t). The SIR model (1) is built on the assumption that the individuals recover with immunity, which is appropriate for viral-agent-diseases such as measles, mumps, and smallpox. If the recovery does not give immunity, then the SIR model can be modified as the so called SIS model, which is applicable to diseases such as encephalitis and gonorrhea that caused by a bacterium. If individuals do not recover, then the SIS model can be changed into SI model [11]. For more details about these basic epidemiological models, we refer the interested reader to Refs. [7, 9, 11, 12]. In this paper, we mainly concentrate on the SIR epidemic model.

One of the key parameters is the basic reproduction number (sometimes called the basic reproductive ratio) in epidemiological investigations, which represents the expected number of secondary cases generated by one primary case of infection in a totally susceptible and sufficiently large population [1315]. The basic reproduction number characterizes the transmission intensity of a particular disease in population and it is interpreted as a threshold criterion. For example, in model (1), if the initial number of susceptible individuals at the beginning of a disease is S0, then the basic reproduction number is , if , then the number of infected individuals declines monotonically, the epidemic eventually disappears; while , the number of infected individuals increases first due to the infection and then decreases due to the recovery of infected individuals, there occurs outbreak and/or persistence of the disease [16].

Just as reported in [17], although model (1) provides an approximation for some observed disease data, the population in the system is under the assumption of both homogeneous infectivity and homogeneous connectivity of each individual, which is too oversimplified and ignores many structures of the real population. Different individuals may have varied number of acquaintances, and the transmission of many epidemic diseases exhibits heterogeneity [18, 19]. Nowadays, understanding the effects of the topological structures of population on the propagation of epidemics has attracted widespread attention [20]. One way to proceed would be to add contact heterogeneity to the population and see how much this alters the model behavior [17]. Many real world systems, such as social networks(stock financial network), biological systems (protein interactions), and technological systems (WWW, Internet) can be properly described as scale-free networks where nodes represent individuals or organizations and links mimic the interactions or connections among them [2022]. A scale-free network is characterized by a power-law behavior P(k)∼kγ, where P(k) is the probability that a node is connected to k other nodes and γ is a characteristic exponent whose value is usually in the range 2 < γ ≤ 3 [2325]. Under this framework, each node of the network represents an individual in its corresponding state (susceptible, infected, or removed), possible contacts between two individuals are linked by an edge, and these two nodes are called neighbors of each other [17, 20]. Each edge is a connection along which the infection can spread, thus a node can acquire infection only from one of its neighbors, in other words, the contact rate is proportional to the number of neighbors, i.e. the degree of a node [17, 20].

Considering the contact heterogeneity in population, then model (1) can be generalized as below: (2) where Sk(t), Ik(t) and Rk(t) are the densities of susceptible, infected and recovered individuals with degree k (k = 1, 2, ⋯, n) at time t, respectively, n is the maximum degree of the network. β represents the transmission rate from susceptible individuals to infected individuals by contact to the infected individual in its neighbors. The term θ(t) denotes the probability that any given link points to an infected node [20]. Under the assumption of uncorrelated networks, the probability that a randomly chosen edge points to an infected node is , where P(k) is the degree distribution of the network [17, 20]. The term βkSk θ(t) in system Eq (2) represents the incidence at the present time t. Model (2) offers a cognition of the propagation of epidemics, information and financial risk in complex systems. Since many real applications, such as infectious disease [19], information propagation [21], computer virus [26] and financial risks transmission [27] are all correlated with the epidemic dynamics on networks, more detailed justifications for epidemiology on networks have been carried out by some researchers, among which are J. Zhang et al. [3] and Y. Wang et al. [8], M. Small [18, 19], M. Newman [28], A. Cui et al. [29].

In traditional results, transmission on networks is dominated by the topology structure of the underlying network and the infection scheme, such as properties of disease, infection pattern, individual differences etc. [2933]. In fact, during the propagation of epidemic, time delays do exist because an individual may not be infectious until some time after becoming infected [9, 34], some time (τ) is required before the infective organism develops in the vector to the level that is sufficient to pass the infection further [57]. When consider the influence of delay on disease spreading on networks, the models take a form of delay differential equation [25, 33, 35, 36]. In previous papers, time delay is assumed to be single-valued. As is well known, a constant delay may be applied if the movement time (e.g., time until recovery or time until to be contagious) is known precisely, which is not very realistic for physical situation. For example, according to Anderson and May, measles virus has an infectious period of 5 − 7 days [15]. This variation may be due to variable environmental factors or the fact that healthy individuals recover faster. Allowing the infectivity to be varied in the interval since infection, up to some maximum duration, gives a model with a distributed delay [7, 9]. Therefore, it is more reasonable to introduce continuously distributed delays in epidemiology modeling. Unfortunately, to the best of the authors’ knowledge, few works have been done to study the transmission process that consider both the topological structures of the contact networks and distributed time delay. Analyzing the dynamics of the SIR model associated with distributed time delay on complex networks still remains a challenging open problem, which may deliver new insight of understanding the process of the propagation of the disease, information and financial risk, which motivates our study in this paper.

Generally speaking, in order to investigate the stability of time delayed SIR model, an efficient way is to use the Lyapunov’s second method, conditions in this method concern the long-time global dynamics. Of course, constructing suitable Lyapunov functional is usually not an easy task. By virtue of Kirchhoff’s matrix tree theorem, a novel Lyapunov functional is established in this paper. Our results make several contributions differing from the existing literature as follows. First of all, the disease-free equilibrium point is proven to be globally asymptotically stable when , and the endemic equilibrium point is globally asymptotically stable if . Secondly, when the disease is permanence in the population, the densities of the infected individuals ascend if the degree of the node rises. What’s more, if f is larger, then the final density of the infected nodes will rise. Finally, we compare the propagation processes of disease with different types of delay through numerical simulations. By analyzing the final densities of infected individuals and the converge time of the propagation processes with distributed delay, discrete delay or without delay, we find that time delays accelerate the propagation of disease: when , the system with distributed delay spreads fastest, the system without delay has slowest convergence rate, and the system without time delay performs between these two kinds of systems. Whereas , disease process under distributed delay lasts longest and the disease process without delay stabilizes fastest.

The remainder of this article is organized as follows. In section 2, based on some preliminaries and the assumptions, the model of epidemic associated with continuously distributed delay and complex networks are proposed. In section 3, by analyzing the corresponding characteristic equations and constructing suitable Lyapunov functional, the stability of disease-free equilibrium is studied. After then, by using Lyapunov functional and Kirchhoff’s matrix tree theorem, we investigate the stability of the endemic equilibrium. In Section 4, numerical examples are provided to demonstrate the validness and effectiveness of the obtained main results. The paper concludes with some remarks in Section 5.

Epidemic model on networks

In order to address the effects of contact heterogeneity in epidemic spreading, the complex dispersal network with N vertices is constructed as follows: each vertex represents an individual in its corresponding state (susceptible, infected, or removed), an undirected edge (i, j) is connected along which the infection can spread. We suppose that the adjacency matrix of the contact network is irreducible, so that disease can disperse on the networks. Furthermore, in order to take account of the heterogeneity induced by the presence of nodes with different connectivities, we consider the time evolution of the magnitudes Sk(t), Ik(t) and Rk(t), which denotes the densities of susceptible, infected and recovered individuals with degree k (k ∈ {1, 2, ⋯, n}, where n is the maximum degree of ) at time t, respectively, therefore, Sk(t) + Ik(t) + Rk(t) = 1. To establish the propagation model on networks, throughout this paper, the following basic assumptions are imposed:

  1. Suppose that the birth rate of the new individuals with degree k is μ, also, the death rate for each class is μ. The total number of the nodes with degree k in the network remains unchanged with time.
  2. A healthy node can be infected at rate β if it is connected to infected individual.
  3. The recovery rate of infected individuals is denoted by λ.
  4. The probability that any randomly chosen edge points to an infected node at time t is denoted by θ(t). We assume that the contact network is uncorrelated, then .
  5. Infectiousness varies over time, which is described by a integrable function f(τ) ≥ 0, τ ∈ [0, ∞) and . The incidence at the present time t is , in which the term e−(μ + λ)τ accounts for the probability of survival as infectious individual during latent period. According to [7, 9, 37], if , then the integrable function f is defined as the probability density function of transmission delay.

On the basis of the above assumptions, the population dynamics with degree k is written as follows

Since the variable Rk(t) does not appear in the equations of and , furthermore, Rk(t) = 1 − Ik(t) − Sk(t), which implies that it is sufficient to analyze the dynamic behaviours of (3) The initial conditions for Eq (3) are represented as (4) where k ∈ {1, 2, ⋯, n} is the degree of the node, , , is the positive cone of the Banach space of continuous functions mapping the interval (−∞, 0] into equipped with the norm ‖ϕ‖ = supu ∈ (−∞, 0]|ϕ(u)|.

Remark 1. We should point out that the assumptions (i), (ii), (iii), (iv), (v) are reasonable. Links between individuals would be cut off or new-established due to birth and death of individuals in population, so the demographics is considered in model (3). The propagation of disease on the network is described in an effective way: at each time step, a susceptible node is infected with probability β, if it is connected to one or more infected nodes, at the same time, an infected individual becomes removed with probability λ [20].

Remark 2. Although the time delayed epidemiology model on complex networks are studied in some papers [33, 36], the delays in all above-mentioned papers have been largely restricted to be discrete. In fact, for a biological reason, the epidemic propagation is not instantaneous and cannot be modeled with discrete delays, and a more appropriate way is to incorporate continuously distributed delays. Moreover, when the delay kernel f is chosen as a δ function at a certain time, then the distributed delay turns out to be discrete delay [38].

Remark 3. In this paper, we consider the heterogeneous contact network . In fact, if the contact network is assumed to be homogeneous, such as Erdos-Reny network and WS small-world network, in which each individuals has same number of contacts, i.e., k ≈ 〈k〉, then system Eq (3) degrades into (5) where S(t), I(t) represents the density of susceptible individuals and the infected individuals, respectively. 〈k〉 is the number of contacts per unit time that is supposed to be constant for the whole population. Furthermore, if we treat βk〉 as a unitary coefficient, then the system Eq (5) can be dealt similarly as in [7, 9, 37].

The stability of the equilibrium

Spreading threshold and existence of the equilibriums

In order to find the equilibrium points of model (3), we denote (6) where , 〈k〉 and 〈k2〉 are the first and second moment of the degree respectively, i.e., , . As usual, can be regarded as the index of heterogeneity of contact network . We establish the following theorem.

Theorem 1. Consider the system Eq (3), we have the following assertions.

  1. There always exists a disease-free equilibrium , where , for each k ∈ {1, 2, ⋯n}.
  2. There is no endemic equilibrium if .
  3. There is an unique endemic equilibrium if , moreover, (7) where θ* is the unique positive root of the equation: (8)

Proof. It is obviously that E0 is always an equilibrium of systems Eq (3). Now let be the positive equilibrium of system Eq (3). For 1 ≤ kn, solve the equations then therefore Eq (7) is obtained.

Since , substituting into θ* yields (9) Because , then θ* > 0 is a positive root of Eq (8).

Furthermore, define (10) we have If g′(0) ≤ 1, which implies , then θ = 0 is the single root of g(x) = x, thus the assertion (ii) of Theorem 1 holds. If g′(0)>1, which means , function g(x) = x has a unique positive root, hence, the assertion (iii) of Theorem 1 holds as well, this completes the proof.

Remark 4. is called the basic reproduction number of system Eq (3). From Theorem 1, it is easy to see that exhibits threshold behaviors: if , the disease will be extinct gradually, otherwise, the disease will spread on networks. On one hand, according to [1, 20], is the parameter defining the level of heterogeneity of the network, then if the heterogeneity of network rises, will be higher, the risk of disease outbreak becomes larger. Comparing to the Erdos-Renyi network and the small-world network, scale-free networks are very weak in face of infections [20]. On the other hand, gets larger if the function f(τ) is chosen larger in [0, ∞).

Remark 5. The unbounded distributed delay implies that the distant past has influence on the state of individual. What’s more, the unbounded distributed delay includes the bounded case by just choosing the function value equal to zero except for some bounded interval [38].

Remark 6. From Eq (7), it is obvious that , increases respect to k, i.e., , which implies the nodes with higher degree have higher infected densities densities eventually. Similarly, when f is chosen larger, then gets larger.

Let us define the set (11) where .

In the following, we will investigate positively invariant set for system Eq (3).

Lemma 1. The set Ω defined by Eq (11) is the positively invariant for system Eq (3).

Proof. From Eq (11), the set Ω can be rewritten as (12) where xi = Si and xi+n = Ii for 1 ≤ in. The boundary of Ω, which is denoted by ∂Ω, consists of 3n flat sets and the corresponding outer normal vectors are According to [39], Ω is positively invariant for system Eq (3), if for any point X in ∂Ω, is tangent or pointing into the set. For ∀i ∈ {1, 2, ⋯, n}, we have Therefore, Ω is positively invariant for system Eq (3), this completes the proof.

Stability of the disease-free equilibrium

Theorem 2. The disease-free equilibrium E0 of system Eq (3) is locally stable if , and unstable if .

Proof. Consider the disease-free equilibrium E0. Firstly, for each k ∈ {1, 2, ⋯, n}, set , then the linearized system of system Eq (5) can be transformed into: (13) To study the stability of this linear system, we suppose the solutions for system Eq (13) with the exponential form as follows: (14) where , Ik0, Rk0 represent the initial value. Substituting Eq (14) into Eq (13) yields (15) Let , where ρ is the eigenvalue of the matrix of system Eq (13), therefore, It is easy to see that the matrix A has n eigenvalues that equal to −μ. In order to obtain other eigenvalues of A, define Carry out similarity transformation to the matrix F: first of all, the second column multiplied by is added to the first column, followed by analogy; secondly, the first row multiplied by is added to the second row, and followed by analogy, then we have It is obvious that the matrix F* has n − 1 eigenvalues that equal to −μ − λ, and the nth eigenvalue of F* is Suppose that Λ = a+bi, then we have which implies that (16) Consider Eq (16), when , if a ≥ 0, then the right side of Eq (16) is negative, which is a contradiction to a ≥ 0. Let , we have which means φ(x) is always monotonically increasing, what’s more If , then ϕ(0)<0, the formula ϕ(x) = 0 has positive real root, the disease-free equilibrium E0 of system is unstable. If , then ϕ(0)>0, therefore, all the root of ϕ(x) = 0 is negative, so the disease-free equilibrium E0 is locally asymptotically stable, this completes the proof.

Theorem 3. If , the disease-free equilibrium E0 is the unique equilibrium of system Eq (3), and it is globally asymptotically stable.

Proof. Choose the following Lyapunov function (17) the time derivative of V(t) along the trajectories of system Eq (3) is given as Since , then (18) Therefore, if , . Furthermore, only if Sk(t) = 1, Ik(t) = 0. Thus the system is globally asymptotically stable in Ω, this completes the proof.

Stability of the endemic equilibrium

In order to investigate the stability of the endemic equilibrium, we shall demonstrate the Kirchhoff’s matrix tree theorem at first. Considering the matrix Q = (qij)m×m, where qij ≥ 0, 1 ≤ i, jm, the directed graph G(Q) associated with Q = (qij)m×m has vertices {1, 2, ⋯, m} with a directed arc (i, j) from i to j iff qij ≠ 0. It is strongly connected if any two distinct vertices are joined by an oriented path. Matrix Q is irreducible if and only if G(Q) is strongly connected [40]. The Laplacian matrix of the directed graph G(Q) is defined as Let Cij denote the cofactor of the (i, j) entry of L, then for the linear system (19) the following results holds.

Lemma 2. (Kirchhoff’s matrix tree theorem, see [41, 42]) Assume that m ≥ 2 and Q = (qij)m×m is irreducible, then following results hold:

  1. The solution space of system Eq (19) has dimension 1, with a basis (v1, v2, ⋯, vm) = (C11, C22, ⋯, Cmm).
  2. For 1 ≤ km, where is the set of all directed spanning subtrees of G(Q) that are rooted at vertex k, w(T) is the weight of a directed tree T, and E(T) denotes the set of directed arcs in T.

Theorem 4. If , then the endemic equilibrium E+ is globally asymptotically stable in Ω∖{E0}.

Proof. When , then from Theorem 1, we have (20) Denoted by (21) (22) (23) where (24) We note that V1k(t) ≥ 0, V2k(t) ≥ 0 with equality if and only if . Also, ψ(x) has the strict global minimum ψ(1) = 0 for all x > 0, therefore V3k(t) ≥ 0 with equality if and only if for all τ ∈ [0, h]. We will study the behavior of the Lyapunov functional as following (25)

The derivative of V1k(t) along system Eq (3) is given by Similarly, Therefore, we have (26) where .

Furthermore, the derivative of V3k(t) along Eq (3) is given by Using integration by parts, we obtain (27) It follows from Eq (23) that and , therefore, (28)

From Eqs (26) and (28), we have (29)

Since (30) denoted by and , then (31)

Consider the following two matrices and set . Since , the digraph G(B) associated with B is strongly connected, then matrix B is irreducible, thus the Laplacian matrix of G(B) is irreducible. Let Ckj denote the cofactor of the (k, j) entry of , from Lemma 2, we know that system has a positive solution c = (c1, c2, ⋯, cn), where ck = Ckk > 0 for any k = 1, 2, ⋯, n.

Choose the Lyapunov functional as from Eq (31), we have (32)

Next, we will show that . In fact, since Bc = 0, we have , therefore, which implies that H ≡ 0 for all I1(t), I2(t), ⋯, In(t). Then holds for all .

Furthermore, since Δk = 0, then , moreover, when . Therefore, if and only if (33) Substituting Eq (33) into the first equation of system Eq (3), we have (34) From Eq (7), we know that Eq (34) holds when σ = 1, namely at E+. Therefore, the only compact invariant subset of the set where is {E+}, thus the endemic equilibrium E+ is globally asymptotically stable.

Remark 7. By using Lyapunov functional and Kirchhoff’s matrix tree theorem [41, 42], the global stability of the endemic points is proved. We note that the Kirchhoff’s matrix tree theorem has been already employed in some previous papers, such as [4043], unfortunately, these articles mainly concentrate on the time delay, and the influences of contact heterogeneity of the system are ignored. In this paper, the dynamical behaviors of the propagation model that influenced by both distributed time delay and heterogeneity topology are investigated. Therefore, our results complement the relative investigations in [4043].

Remark 8. The results in this paper show clearly that the basic reproduction number of the contagion model not only depends on the epidemic properties, but also depends on the topology structure of the population networks and time delay. According to Eq (6), it is obvious that is proportional to the connectivity fluctuations 〈k2〉 and infected rate. Therefore, for the sake of preventing the disease from breaking out, in practice, taking quarantine measures contrary to some specific populations (such as hub nodes and so on) to reduce the heterogeneity of the network is an efficient option.

Numerical examples

In this section, three examples are presented to demonstrate the correctness and effectiveness of the main obtained results in this paper.

We start with a graph with 5 vertexes, in each time step, a node with one edge is added into the graph and by using preferential attachment mechanism in [24], a BA scale-free network with 800 nodes is obtained (see S1 Fig). The following simulations are implemented based on . The minimal degree in is 1 and the maximum degree is 70, the corresponding degree distribution is shown in S2 Fig. By simply computing, the first moment of degree is 〈k〉 = 3.9733 and the second moment of degree is 〈k2〉 = 44.8200.

Example 1 Based on , for k ∈ {1, 2, ⋯, 70}, consider the following SIR epidemic model (35) with the initial conditions It is obvious that β = 0.06, λ = 0.4, μ = 0.4, f(τ) = 0.5e−0.5τ, 0 ≤ τ ≤ ∞ and the assumptions (i), (ii), (iii), (iv), (v) are satisfied.

To show the dynamical behaviors of propagation process, we perform Monte Carlo simulations in this paper. In a time step, every infected individual tries to infect each of its susceptible neighbors with infection rate 0.06, and it cures itself with rate 0.4, the time delay is distributed from 0 to ∞. By simply computing, one can get that the positive invariant set of system Eq (35) is and the basic reproduction number is , thus the conditions for Theorem 3 are all satisfied. Furthermore, by using Monte Carlo simulations, the dynamical behaviors of susceptible nodes and the infected nodes are presented in S3 and S4 Figs. Two properties of the propagation process are shown in S3 Fig: for each k ∈ {1, 2, ⋯70}, the time series and the densities of susceptible nodes Sk(t) are presented in S3 Fig, and Sk(t) converges to 1 eventually; similarly in S4 Fig, the densities of infected nodes Ik(t) are shown, which converges to zero gradually. The simulations in S3 Fig imply that the orbit of the system Eq (35) converges to the disease-free equilibrium E0 = (S1, S2, ⋯, S70, I1, I2, ⋯, I70), where Sk = 1, Ik = 0, 1 ≤ k ≤ 70, therefore, E0 is globally asymptotically stable in region , which agrees with Theorem 3.

Example 2 For k ∈ {1, 2, ⋯, 70}, consider the following SIR epidemic model on (36) with the initial function where β = 0.2, λ = 0.3, μ = 0.4, f(τ) = 0.5e−0.5τ, 0 ≤ τ ≤ ∞, the initial condition Eq (4) and the assumptions (i), (ii), (iii), (iv), (v) are satisfied.

We present Monte Carlo simulations of the propagation process to show the validness of the results in this paper. In each step, a susceptible can become infected at the rate of 0.2 and an infected node would become recovery at the rate of 0.3, the time delay is distributed from 0 to ∞. By simply computing, one can obtain that , and the invariant set of system Eq (35) is , where , and Sk = 1, Ik = 0, 1 ≤ k ≤ 70, thus all the conditions for Theorem 4 are satisfied. With the help of Monte Carlo simulations, the dynamical behaviors of susceptible nodes and infected nodes are shown in S5 and S6 Figs, which depict the propagation process clearly. In S5 Fig, the time series and the densities of susceptible nodes (Sk(t), k ∈ {1, 2, ⋯70}) are shown, for each k ∈ {1, 2, ⋯70}, Sk(t) converges to eventually; while in S6 Fig, the densities of infected nodes Ik(t) are presented, which converge to positive steady levels . S5 and S6 Figs show that the orbits of system Eq (36) converge to the endemic equilibrium eventually, therefore, E+ is globally asymptotically stable in region , which agrees with Theorem 4. Furthermore, S6 Fig shows that those nodes with higher degree have higher infected densities, which is consistent with Remark 5.

Example 3 In order to figure out the influences of delay, basing on , several cases are arranged here.

Case 1. Consider the SIR model (3) with a distributed delay: (37) and the initial conditions are supposed as the following (38) i.e, β = 0.06, λ = 0.45, μ = 0.5, and f(τ) = 0.5e−0.5τ. To show the differences of delays clearly, we consider the total density of the infected nodes I(t), which is expressed by an average over the various connectivity classes, i.e., [20]. From Eq (6), the basic reproductive number is . The total density I(t) converges to 0, which agrees with Theorem 3, i.e., the disease-free equilibrium of system Eq (37) is globally asymptotically stable. The trajectory of I(t) of system Eq (37) when is shown in S5 Fig.

Case 2. Consider the following SIR model with a discrete delay (39) with initial conditions Eq (38), and the discrete delay is chosen as h = 300. According to [35, 36], one can obtain that the reproduction number of Eq (39) is . The total density I(t) converges to 0, which implies that the disease-free equilibrium of the system is globally asymptotically stable. The corresponding trajectory of I(t) of systems Eq (39) is shown in S7 Fig.

Case 3. Consider the following SIR model without time delay, i.e., an SIR model in an ODE type: (40) with identical initial conditions Eq (38). According to [3], the reproduction number of Eq (40) is . I(t) converges to 0 eventually. When , the corresponding trajectory of I(t) of system Eq (40) is shown in S5 Fig.

All the system trajectories in S5 Fig show that the total densities of the infected nodes converge to zero eventually when . More specially, the system Eq (40) without delay converges fastest, the system Eq (37) with distributed time delay stabilizes the most slowly, and the system Eq (39) with discrete delay performs between systems Eqs (40) and (37). In fact, by simple computation, one can obtain that the convergence time of system Eq (37) is 18.6200, while the convergence time of system Eq (39) is 11.8800 and for system Eq (40), the convergence time is 9.3100 (if ‖I(t)‖2 ≤ 0.0001 for all tt*, then we call t* as the convergence time). The convergence time of the SIR systems are listed in Table 1.

thumbnail
Table 1. System, convergence time, and the final density of infected individuals when .

https://doi.org/10.1371/journal.pone.0158813.t001

Furthermore, when , let us consider the following cases.

Case 4. Consider the following SIR model with a distributed delay: (41) with the initial conditions Eq (38), therefore, β = 0.5, λ = 0.3, μ = 0.3, and f(τ) = 0.5e−0.5τ. By using Eq (6), the basic reproductive number . The total density I(t) converges to I* = 0.3450, which agrees with Theorem 4 and implies that the endemic equilibrium of system Eq (41) is globally stable. The trajectory of I(t) of system Eq (41) is shown in S6 Fig.

Case 5. Consider the following SIR model with a discrete delay (42) with initial conditions Eq (38), similarly, we choose h = 300. According to [35, 36], the reproduction number of Eq (42) is . I(t) converges to I* = 0.3155 eventually, therefore, the endemic equilibrium of system Eq (42) globally asymptotically stable, the corresponding trajectory is shown in S6 Fig.

Case 6. Consider the following SIR model without time delay, i.e., an SIR model in an ODE type: (43) the initial conditions are chosen as Eq (38). According to [3], the reproduction number of Eq (40) is . The total density I(t) converges to I* = 0.3155, which means that the endemic equilibrium of system Eq (43) is stable. The corresponding trajectory of I(t) of system Eq (43) is shown in S8 Fig.

Similarly, we define as the convergence time, if ‖I(t) − I*‖2 ≤ 0.0001 for all , where I* is the final density of the infected individuals. The convergence time of the SIR models and the final densities of systems Eqs (41)–(43) are listed in Table 2. From Table 2, one can see that the convergence time of system Eq (41) is 4.0100, the convergence time of system Eq (42) is 8.9400, and for system Eq (43), the convergence time is 9.6100. The system Eq (41) with distributed time stabilizes fastest, and the system Eq (43) without time delay converges the most slowly.

thumbnail
Table 2. System, the convergence time and the final density of infected individuals when .

https://doi.org/10.1371/journal.pone.0158813.t002

From above results, it is obvious that time delay has significant effects on the spreading of epidemic. As is indicated in S5 and S6 Figs, when , time delays slow down the extinction of disease, while , time delays accelerate the spreading of disease. More specifically, by comparing the convergence time of each system, the results show that the differences of delays influence the propagation: when the distributed delay is incorporated, if , then the disease lasts longest, while , then the disease spreads fastest.

Conclusion

In this paper, by considering distributed delay, demographics and contact heterogeneity of the individuals, we study SIR model on complex population networks in detail. We prove that there exists the basic reproduction number of the epidemic which determines not only the existence of the endemic equilibrium E+ but also the stability of E+ and the disease-free equilibrium E0. Specifically, the epidemic will be extinct gradually if ; while if , the disease becomes permanence and the endemic equilibrium point is globally asymptotically stable. A series of numerical experiments are presented to confirm the correctness of the theoretical analysis as well. Furthermore, the numerical simulations show that the distributed delay slows down the extinction of disease when ; while , time delay accelerates the spreading of disease. Our theoretical studies deliver some new insights for understanding the propagation of diseases and information in biological and social networks.

Supporting Information

S1 Fig. The BA network with 800 vertexes.

https://doi.org/10.1371/journal.pone.0158813.s001

(PDF)

S2 Fig. The degree distribution of the network.

https://doi.org/10.1371/journal.pone.0158813.s002

(PDF)

S3 Fig. The dynamical behaviors of the susceptible nodes when .

https://doi.org/10.1371/journal.pone.0158813.s003

(PDF)

S4 Fig. The dynamical behaviors of the infected nodes when .

https://doi.org/10.1371/journal.pone.0158813.s004

(PDF)

S5 Fig. The dynamical behaviors of the susceptible nodes when .

https://doi.org/10.1371/journal.pone.0158813.s005

(PDF)

S6 Fig. The dynamical behaviors of the infected nodes when .

https://doi.org/10.1371/journal.pone.0158813.s006

(PDF)

S7 Fig. The trajectories of I(t) of systems Eqs (37), (39) and (40) when .

https://doi.org/10.1371/journal.pone.0158813.s007

(PDF)

S8 Fig. The trajectories of I(t) of systems Eqs (41), (42) and (43) when .

https://doi.org/10.1371/journal.pone.0158813.s008

(PDF)

Acknowledgments

The work is partially supported by the National Natural Science Foundation of China (Nos. 11101053, 71371195, 71431008, 71471020, 71532013), China Postdoctoral Science Foundation (Nos. 2014M550097, 2015T80144), Hunan Provincial Natural Science Foundation of China (No. PLOS 17/20, 2016JJ1001), Scientific Research Fund of Hunan Provincial Education Department (No. 15A003) and Hunan Provincial Innovation Foundation for Postgraduate (No. CX2015B373)

Author Contributions

  1. Conceived and designed the experiments: CH FW XY.
  2. Performed the experiments: CH JC.
  3. Analyzed the data: CH JC.
  4. Contributed reagents/materials/analysis tools: CH XY JC.
  5. Wrote the paper: CH JC FW XY.

References

  1. 1. Barthélemy M, Barrat A, Pastor-Satorras R, Vespignani A. Velocity and hierarchical spread of epidemic outbreaks in scale-free networks. Physical Review Letters. 2004; 92(17): 178701. pmid:15169200
  2. 2. Zhu G, Chen G, Zhang H, and Fu X.. Propagation dynamics of an epidemic model with infective media connecting two separated networks of populations. Communications in Nonlinear Science and Numerical Simulation. 2015; 20(1): 240–249.
  3. 3. Zhang J, Jin Z. The analysis of an epidemic model on networks. Applied Mathematics and Computation. 2011; 217(17): 7053–7064.
  4. 4. Strickland C, Dangelmayr G, Shipman P D, Kumar S, Stohlgren T J. Network spread of invasive species and infectious diseases. Ecological Modelling. 2015; 309: 1–9.
  5. 5. Ma W, Takeuchi Y, Hara T, Beretta E. Permanence of an SIR epidemic model with distributed time delays. Tohoku Mathematical Journal. 2002; 54(4): 581–591.
  6. 6. Muroya Y, Kuniya T, Wang J. Stability analysis of a delayed multi-group SIS epidemic model with nonlinear incidence rates and patch structure. Journal of Mathematical Analysis and Applications. 2015; 425(1): 415–439.
  7. 7. McCluskey C C. Global stability of an SIR epidemic model with delay and general nonlinear incidence. Mathematics Biosciences and Engineering. 2010; 7(4): 837–850.
  8. 8. Wang Y, Jin Z, Yang Z, Zhang Z K, Zhou T, Sun G Q. Global analysis of an SIS model with an infective vector on complex networks. Nonlinear Analysis: Real World Applications, 2012; 13(2): 543–557.
  9. 9. McCluskey C C. Complete global stability for an SIR epidemic model with delaydistributed or discrete. Nonlinear Analysis: Real World Applications, 2010; 11(1): 55–59.
  10. 10. Kermack W O, McKendrick A G. A contribution to the mathematical theory of epidemics. Proceedings of the Royal Society of London A: mathematical, physical and engineering sciences. The Royal Society, 1927; 115(772): 700–721.
  11. 11. Hethcote H W. The mathematics of infectious diseases. SIAM review. 2000; 42(4): 599–653.
  12. 12. Cooke K L. Stability analysis for a vector disease model. Journal of Mathematics. 1979; 9(1): 31–42.
  13. 13. Yang H M. The basic reproduction number obtained from Jacobian and next generation matrices-A case study of dengue transmission modelling. Biosystems. 2014; 126: 52–75. pmid:25305542
  14. 14. Anderson R M, May R M, Anderson B. Infectious diseases of humans: dynamics and control. Oxford: Oxford university press; 1992.
  15. 15. May R M, Anderson R M. Population biology of infectious diseases: Part II. Nature. 1979; 280(5722): 455–461. pmid:460424
  16. 16. Schimit P H T, Monteiro L H A. On the basic reproduction number and the topological properties of the contact network: an epidemiological study in mainly locally connected cellular automata. Ecological Modelling, 2009; 220(7): 1034–1042.
  17. 17. Wang Y, Cao J, Alofi A, Abdullah A M, Elaiw A. Revisiting node-based SIR models in complex networks with degree correlations. Physica A: Statistical Mechanics and its Applications. 2015; 437: 75–88.
  18. 18. Small M, Tse C K. Small world and scale free model of transmission of SARS. International Journal of Bifurcation and Chaos. 2005; 15(5): 1745–1755.
  19. 19. Small M, Walker D M, Tse C K. Scale-free distribution of avian influenza outbreaks. Physical review letters. 2007; 99(18): 188702. pmid:17995445
  20. 20. Moreno Y, Pastor-Satorras R, Vespignani A. Epidemic outbreaks in complex heterogeneous networks. The European Physical Journal B-Condensed Matter and Complex Systems. 2002; 26(4): 521–529.
  21. 21. Clauset A, Shalizi C R, Newman M E J. Power-law distributions in empirical data. SIAM review. 2009, 51(4): 661–703.
  22. 22. Pastor-Satorras R, Vespignani A. Epidemic dynamics and endemic states in complex networks. Physical Review E. 2001; 63(6): 066117.
  23. 23. Newman M E J. The structure and function of complex networks. SIAM review. 2003, 45(2): 167–256.
  24. 24. Barabási A L, Albert R. Emergence of scaling in random networks. Science. 1999; 286(5439): 509–512. pmid:10521342
  25. 25. Kang H, Fu X. Epidemic spreading and global stability of an SIS model with an infective vector on complex networks. Communications in Nonlinear Science and Numerical Simulation. 2015 Oct; 27(1): 30–39.
  26. 26. Mei S, Zarrabi N, Lees M, Sloot P M. Complex agent networks: An emerging approach for modeling complex systems. Applied Soft Computing. 2015; 37: 311–321.
  27. 27. Castrén O, Rancan M. Macro-Networks: An application to euro area financial accounts. Journal of banking & finance. 2014; 46: 43–58.
  28. 28. Newman M E J. Spread of epidemic disease on networks. Physical review E. 2002; 66(1): 016128.
  29. 29. Cui A X, Wang W, Tang M, Fu Y, Liang X, Do Y. Efficient allocation of heterogeneous response times in information spreading process. Chaos�� An Interdisciplinary Journal of Nonlinear Science. 2014; 24(3):5880–5885.
  30. 30. Zhao Z D, Liu Y, Tang M. Epidemic variability in hierarchical geographical networks with human activity patterns. Chaos: An Interdisciplinary Journal of Nonlinear Science. 2012; 22(2): 023150.
  31. 31. Eubank S, Guclu H, Kumar V S A, Marathe M V, Srinivasan A, Toroczkai Z, et al. Modelling disease outbreaks in realistic urban social networks. Nature. 2004; 429(6988): 180–184. pmid:15141212
  32. 32. Xia C Y, Liu Z X, Chen Z Q, Yuan Z Z. Spreading behavior of SIS model with non-uniform transmission on scale-free networks. The Journal of China Universities of Posts and Telecommunications. 2009; 16(1): 27–31.
  33. 33. Liu Q M, Deng C S, Sun M C. The analysis of an epidemic model with time delay on scale-free networks. Physica A: Statistical Mechanics and Its Applications. 2014; 410: 79–87.
  34. 34. Huang C, Yang Z, Yi T, Zou X. On the basins of attraction for a class of delay differential equations with non-monotone bistable nonlinearities. Journal of Differential Equations. 2014; 256(7): 2101–2114.
  35. 35. Wang J, Wang J, Liu M, Li Y. Global stability analysis of an SIR epidemic model with demographics and time delay on networks. Physica A: Statistical Mechanics and its Applications. 2014; 410: 268–275.
  36. 36. Zhang R, Li D, Jin Z. Dynamic analysis of a delayed model for vector-borne diseases on bipartite networks. Applied Mathematics and Computation. 2015; 263: 342–352.
  37. 37. Beretta E, Takeuchi Y. Global stability of an SIR epidemic model with time delays. Journal of mathematical biology. 1995; 33(3): 250–260. pmid:7897328
  38. 38. Huang C, Cao J. Convergence dynamics of stochastic Cohen-Grossberg neural networks with unbounded distributed delays. IEEE Transaction on neural networks. 2011; 22(4): 561–572.
  39. 39. Yorke J A. Invariance for ordinary differential equations. Theory of Computing Systems. 1967; 1(4): 353–372.
  40. 40. Li M Y, Shuai Z. Global-stability problem for coupled systems of differential equations on networks. Journal of Differential Equations. 2010; 248(1): 1–20.
  41. 41. Li M Y, Shuai Z, Wang C. Global stability of multi-group epidemic models with distributed delays. Journal of Mathematical Analysis and Applications. 2010; 361(1): 38–47.
  42. 42. Moon J W. Counting labelled trees. Canadian Mathematical Congress. Montreal; 1970.
  43. 43. Guo H, Li M, Shuai Z. A graph-theoretic approach to the method of global Lyapunov functions. Proceedings of the American Mathematical Society. 2008r; 136(8): 2793–2802.