Global behavior of epidemic transmission on heterogeneous networks via two distinct routes
- 4.9k Downloads
In the study of epidemic spreading two natural questions are: whether the spreading of epidemics on heterogenous networks have multiple routes, and whether the spreading of an epidemic is a local or global behavior? In this paper, we answer the above two questions by studying the SIS model on heterogenous networks, and give the global conditions for the endemic state when two distinct routes with uniform rate of infection are considered. The analytical results are also verified by numerical simulations.
KeywordsComplex Network Infected Individual Degree Distribution Heterogenous Network Multiple Route
The dynamical behaviors of epidemic diseases have been studied for quite a long time, SIS and SIR are the two important and fundamental epidemic models . For the SIS epidemic model, each individual can exist in two states: S-susceptible and I-infected. At each time, the susceptible individual which is connected to an infected neighbor will be infected with rate λ. Meanwhile, the infected individuals may be recovered and become susceptible individuals at a rate γ. For the SIR model, there are two different aspects from the SIS model: on one hand, individuals can exist in another state: R-recovered/removed; on the other hand, once an infected individual becomes recovered then the individual cannot be infected again.
In order to explore the mechanism of the evolution of complex networks, in 1999, Barabási and Albert addressed a new model of complex networks: scale-free networks (BA) . In a scale-free network the probability P(k) for any node with k links to other nodes is distributed according to the power law P(k) ~ k-γ. Then researchers found that many real complex systems are scale-free networks, such as the WWW (World Wide Web), the Internet, and so on. These types of networks are considered as heterogenous networks (with a degree distribution exhibiting large fluctuations). Because many epidemic diseases occur in communities exhibiting characteristics consistent with heterogenous networks, many researchers studied the mechanism of the spreading of epidemics on heterogenous networks [3, 4, 5, 6, 7, 8, 9, 10] (see also Zhang HF, Fu XC: The spread of epidemics on scale-free networks with nonlinear infectivity. Nonl Anal, Series A, in press, and d'Onofrio A: A note on the global behaviour of the network-based SIS epidemic model. Nonl Anal Real World Appl, in press).
For the mechanism of the spreading of epidemic on complex networks, different researcher gave different explanations [3, 6, 10]. For instance, Pastor-Satorras et al. concluded that the epidemic threshold λ c = 0 for heterogenous networks with sufficiently large size , and Zhou et al suggested that the threshold λ c is a constant value, regardless of the size of networks and the degree distribution . Both of the results were obtained just by considering one route of spreading epidemic, and the corresponding results are too special to completely reflect the mechanism of spreading of epidemics. Contrary to the above assumptions, many diseases can be spread in many ways, and they have positive thresholds which are relevant to the degree distribution and the size of networks, e.g, people transmit HIV by having unprotected sex, by receiving infected blood transfusions or, through birth. Furthermore, some epidemics just can prevail in a local place, and some kind of epidemics will globally prevail. In order to better explain the mechanism of the spreading of epidemic on complex networks, and answer whether the spreading of an epidemic is a local or global behavior, we consider two distinct routes of spreading of epidemics on heterogenous networks, and obtain some new results which are not given previously.
The rest of this paper is organized as follows: In Section 2, we study two routes of spreading epidemics on complex networks by a method  (and see d'Onofrio A: A note on the global behaviour of the network-based SIS epidemic model. Nonl Anal Real World Appl, in press) which answers explicitly whether the spreading of an epidemic is a local or global behavior. Though the threshold can also be obtained by solving a self-consistency equation [3, 4, 5], however, such method did not answer whether the endemic state is locally or globally stable. In order to demonstrate the advantage of the method we used  (also d'Onofrio A: A note on the global behaviour of the network-based SIS epidemic model. Nonl Anal Real World Appl, in press), another two routes of spreading epidemics is considered in Section 3, here the threshold cannot be obtained by solving a self-consistency equation. In Section 4, we present numerical simulations to verify our analytical results. And finally, conclusions are given in Section 5.
When the threshold can be obtained by solving a self-consistency equation
As for the mechanism of the spreading of epidemics on heterogeneous networks, R. Pastor-Satorras et al considered that the infective capability of infected individuals is proportional to their degrees, and the factor (here P (k'|k) denotes the conditional probability that a node with degree k is connected to a node with degree k', k max is the maximal degree of the networks, and I k' is the density of infected individuals with degree k') was used to stand for the probability that an edge emanating from a node of degree k points to an infected nodes. As a result, the epidemic threshold λ c = 0 for heterogenous networks with sufficiently large size [3, 4, 5]. However, in , Zhou et al argue that Θ may have another form, they let , just because every infected individual may have the same infective capability U to infect other individuals. And they obtained the epidemic threshold , no matter the individuals' degree and the size of scale-free networks.
Just as we mentioned in above section, both of them have limitations, so we consider that both of these mechanisms are concurrent on complex networks.
For the heterogeneous networks, we also classify individuals into groups according to their degrees, then S k and I k are the density of susceptible individuals and the density of infected individuals with degree k respectively, so S k + I k = 1.
(k = 1, 2, ..., k max ). By some computation, we can find that, for the matrix A, there are (k max - 1) eigenvalues equal to -1.
In order to find the last eigenvalue of A, we let
V = [λ, 2λ, ..., Nλ] T
and write matrix A as
If the solution I = 0 of the Eq(3) is stable, all eigenvalues of the matrix A must be non-positive, that is, u ≤ 0.
So we have the following conclusion:
then the solution I = 0 of the Eq(3) is globally asymptotically stable, otherwise the unique endemic solution ( 0 is a zero vector) is globally asymptotically stable, except when there are no infected individuals in the networks at the initial time.
From the inequality (11), we can find the thresholds for the outbreak of epidemics on complex networks with the two routes of spreading epidemic mentioned above, and at the same time we can answer whether the endemic state is globally stable.
When p = 0, then we obtain the threshold for , the same as the result given in .
When 0 <p < 1, i.e., there are two routes of spreading of epidemic on complex networks, our result suggest that the threshold for the outbreak of epidemic is positive, which is relevant to the ratio of two routes of spreading of epidemic, the degree distribution, and the size of the networks. So the threshold we obtain is neither zero nor just a constant given by previous authors.
When threshold cannot be obtained by solving a self-consistency equation
In the above section, the threshold for the case we considered can also be obtained by solving a self-consistency equation, although this does not explicitly determine whether the equilibrium is globally stable. In this section, in order to demonstrate the advantage of the method we used in the above section, we consider another case where the threshold cannot be obtained by solving a self-consistency equation. Moreover, such case may exist in the real networks.
We suppose that there are also two routes of the spreading epidemics on complex networks, one route is given by Θ1, another route of the spreading of epidemic is the standard SIS model .
(k = 1, ..., k max ). Here, we should distinguish the second term of the right-hand side of Eq(12) from the second term of the right-hand side of Eq(3). In Eq(3), Zhou et al considered that the susceptible individuals which may be infected are proportional to their degrees k though they are irrelevant to the infected individuals, however, in Eq(12) we suppose that all of the susceptible individuals which may be infected are proportional to a constant rate, i.e. (k).
(k, k' = 1, 2, ..., k max ).
In order to obtain both of the negative eigenvalues, by solving Eq(18) we have
then the solution I = 0 of the Eq(15) is globally asymptotically stable, otherwise the unique endemic solution ( 0 is a zero vector) is globally asymptotically stable. Except when there are no infected individuals in the networks at the initial time.
If 0 <p < 1, we can find the threshold for this two routes of spreading epidemic is not just the linear combination of threshold λ and β as shown in inequality (11), which manifest that some complex behaviors may come forth.
We remark here that we can also consider more routes' spreading of epidemics on complex networks, by using the similar method, although here in this paper we have only considered two routes of spreading epidemics.
In this section, we present numerical simulations to support the results obtained in previous sections. Our simulations are based on the BA network with P(k) = k-γ, γ = 3, N = 2000, and ⟨k⟩ = 6, ⟨k2⟩ = 98.
In order to explain the mechanism of the spreading of epidemic, many results were proposed by researchers. These results were often based on that the spreading of epidemics on complex networks via a single mechanism, hence, these results were often not so realistic. Moreover, many results just gave the threshold for the outbreak of epidemics, which can not explicitly answer whether the epidemic will prevail locally or globally.
Because many diseases can spread in different ways, e.g., HIV virus, the avian flu, and so on, in this paper we consider that the spreading of epidemics on complex networks via multiple routes. Under such assumption, we get positive thresholds, neither a constant value nor a zero value, which are more realistic. Furthermore, we answer that the epidemic will prevail globally once some conditions are satisfied.
In Section 3, the results can be obtained by solving a self-consistency equation, and the threshold is the linear combination of λ and β. However, when we consider the case as in Section 4, the results can not be obtained by solving a self-consistency equation, moreover, the threshold is not the linear combination of λ and β, which suggest that the threshold for the multiple routes of spreading epidemic is not just the addition of the respective way of spreading epidemic, sometimes, some complex behavior can happen. Finally, in Section 4, we present numerical simulations to support our analytical results.
The research was supported jointly by the Foundation of Anhui Education Bureau (Grant KJ2007A003), Natural Science Foundation of Anhui, China (Grant 070416225), a grant from the Health, Welfare and Food Bureau of the Hong Kong SAR Government, and by NSFC Grant 10672146.
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.