The role of vaccine success is introduced into an epidemic spreading model consisting of three states: susceptible, infectious, and vaccinated. Moreover, the effect of three types, namely, contact, local, and global, of infection awareness and immunization awareness is also taken into consideration. The model generalizes those considered in Pastor-Satorras and Vespignani [Phys. Rev. E 63, 066117 (2001)], Pastor-Satorras and Vespignani [Phys. Rev. E 65, 036104 (2002)], Moreno et al. [Eur. Phys. J. B 26, 521–529 (2002)], Wu et al. [Chaos 22, 013101 (2012)], and Wu et al. [Chaos 24, 023108 (2014)]. Our main results contain the following. First, the epidemic threshold is explicitly obtained. In particular, we show that, for any initial conditions, the epidemic eventually dies out regardless of what other factors are whenever some type of immunization awareness is considered, and vaccination has a perfect success. Moreover, the threshold is independent of the global type of awareness. Second, we compare the effect of contact and local types of awareness on the epidemic thresholds between heterogeneous networks and homogeneous networks. Specifically, we find that the epidemic threshold for the homogeneous network can be lower than that of the heterogeneous network in an intermediate regime for intensity of contact infection awareness while it is higher otherwise. In summary, our results highlight the important and crucial roles of both vaccine success and contact infection awareness on epidemic dynamics.
In this work, we study the effect of vaccine success and the impact of awareness on a general epidemic spreading model consisting of three states: susceptible, infectious, and vaccinated. We obtain two unexpected results. First, if people are aware of the importance of immunization and vaccination is always successful, then, for any initial conditions, the epidemic can be under control even if the spreading rate of the disease is extremely high. Second, it is shown that, although the epidemic threshold is smaller for the heterogeneous network in low and high intensity of contact infection awareness, there is an intermediate regime where the epidemic threshold is in contrast higher for the homogeneous network.
I. INTRODUCTION
The vaccination is proved to be an effective method to control the spread of epidemic diseases. However, not many theoretical results are done to discuss the impact of vaccine failure, which may go as high as 50%6 on epidemic spreading. It is reported6 that, although vaccine success has usually been about 85%, success as low as 44% has also been observed. To the best of our knowledge, the first theoretical work to discuss the role of vaccine failure was given in Ref. 7.
In the study of epidemiology, finding ways to prevent the outbreak of an epidemic disease is always an important issue. In the past few decades, several effective immunization strategies have been proposed to minimize the risk of the outbreak of epidemic diseases on complex networks.2,5,8–16 Recently, the study of aspects of human responses towards the spread of epidemic diseases has drawn much attention4,7,17–28 due to the fact that the change of individual behaviors has an effect on the epidemic dynamics. In the literature,4,18,29,30 according to the source of information, awareness is classified into three types, which are termed contact awareness, local awareness, and global awareness. For the first type, it is assumed4,29 that individuals with larger contact number in a network are more willing to change their behavior in order to reduce the risk of being infected. The second one is based on personal local information or local infection density.4,18 The third one is based on the global infection density in a whole community.4,31 The information relating to that may come from national media, e.g., public health authorities. In this work, we shall further differentiate each of the three types of awareness into two cases: infection awareness and immunization awareness. People with infection awareness are more likely to take extra steps to avoid infection, while people with immunization awareness increase likelihood for getting vaccinated. It should also be noted that in heterogeneous networks such as scale-free (SF) ones, the effect of these three types of awareness cannot be separated completely. Such combined effect is also addressed in Ref. 4.
In this work, we consider an epidemic spreading model consisting of three states: susceptible (S), infectious (I), and vaccinated (V), for which the changes of states between S and I or S and V take into account the impact of individual awareness and the role of vaccine success. Our main results contain the following. First, the epidemic threshold is explicitly obtained. In particular, if immunization awareness is considered and vaccination has a perfect success, then the epidemic dies out eventually regardless of what other factors are or what initial conditions are. Furthermore, such threshold depends on the contact type of awareness and local infection awareness, and is independent of all the other types of awareness. Such result indeed suggests that the effect of these three types of awareness against the outbreak of an epidemic disease in decreasing order in terms of their importance is contact awareness, local awareness, and global awareness. Second, we compare the epidemic threshold for the homogeneous network, where individuals have roughly the same degree (contact number), and the heterogeneous network, where individuals' degree distribution has a heavy tail. We show that the epidemic threshold for the homogeneous network can be lower than that of the heterogeneous network in an interval J of intensity of contact infection awareness, while it is higher otherwise. In certain extreme cases, the interval J is empty or infinite.
The organization of the paper is as follows. We introduce our discrete-time epidemic spreading model and its continuous-time version in Section II. The study of the epidemic threshold and the stability of the disease free equilibrium (DFE) on the continuous-time epidemic spreading model are given in Section III. In Section IV, we discuss the effect of heterogeneity of networks on the epidemic threshold. Numerical simulations to support our theoretical results and their other implications are given in Section V. In Section VI, we discuss some of the works related to ours. The summary of our obtained results and the future work is provided in Section VII. In Appendix A, we give the detailed derivation of the continuous-time epidemic spreading model from the discrete-time one. All the proofs of our results are recorded in Appendix B.
II. EPIDEMIC SPREADING MODEL
In this section, we shall depict the epidemic spreading model under consideration. We begin with the formulation based on probabilistic discrete-time Markov chains. It is assumed that each individual, at each time t, is in one of the following three discrete states: infectious (I), vaccinated (V), and susceptible (S), and each could transfer its state at time t to a new one at time t + 1 through one of the following four different ways: (i) , (ii) , (iii) , and (iv) . Letting (respectively, ), , be the probability that a node i is infectious (respectively, vaccinated) at time t, our model under consideration reads as follows:
Here ki denotes the degree of a node i (i.e., the number of neighbors of a node i); si, ranging from 0 to ki, denotes the number of infectious neighbors of a node i; and p(t) denotes the fraction of infectious nodes in the network. For other parameters and terms in (1a)–(1c), their epidemic meanings are explained in the following list.
The parameter in (1a) denotes the recovering probability for infectious individuals for the whole time period.
The parameter in (1a) denotes the probability of vaccine failure for vaccinated individuals.
The term , defined in (1b), gives the probability that a node i changes its state from S to I. The quantity denotes the spreading rate for which an infectious node would actually transmit a disease through an edge connecting to a susceptible node.32,33
The term in (1b) describes the contact awareness to avoid infection for a node i,4,29 which is to be termed as the contact infection awareness in short. Similar usage of the term is to be followed. We assume that a node with a higher degree is aware of the higher risk to be infected and, consequently, it increases its protection and hence reduces the probability of getting infected. Thus, it is assumed that function is decreasing in the degree k. In Ref. 4, is chosen to be for some nonnegative constant b. The larger the quantity b is, the smaller the and the term defined in (1b) is, and hence the less likely a susceptible individual would get infected. The constant b is to be termed as the intensity of contact infection awareness. Note that, if is independent of k (i.e., b = 0), then there is no contact infection awareness in the epidemic spreading.
The term in (1b) is a decreasing function of p(t) and β. Thus, this term indicates that, as the infectious density p(t) in the population increases, one increases its protection and hence reduces the probability of getting infected. And so, this term represents the global infection awareness.30,34 Clearly, such setup indicates that people are made aware of the epidemic disease through national media. Moreover, describes the strength of the average risk assessment from global awareness and hence β is to be termed as the intensity of global infection awareness. For β = 0, this means that global infection awareness is not considered in the epidemic spreading.
The term in (1b) is a decreasing function of and α. Thus, this term indicates that as the local infectious density of a node i increases, one increases its protection and hence reduces the probability of getting infected. And so, this term represents the local infection awareness.5,30,34 The parameter indicates the strength of the average risk assessment from local awareness, and hence α is to be termed as the intensity of local infection awareness. Note that α = 0 means that there is no local infection awareness in the epidemic spreading.
- The termrepresents the probability that a susceptible node i will not get infected when it makes a contact with exactly one infectious individual. Thus
is the probability that a node i will not change its state from susceptible to infectious when it makes contacts with si infectious individuals. Thus, , defined in (1b), gives the probability that a node i changes its state from susceptible to infectious.
The term , defined in (1c), gives the probability that a node i changes its state from S to V when the epidemic disease is spreading.5
Similarly, the term in (1c) describes the contact awareness to get immunized, which is to be termed as the contact immunization awareness in short. Similar usage of the term is to be followed. We assume that a node with a higher degree is aware of the higher risk to be infected, and it is more likely to get vaccinated to reduce the probability of getting infected. Thus, it is assumed that function is decreasing in k. We also set for some nonnegative constant , where the parameter is to be termed as the intensity of contact immunization awareness. That is, for higher , a susceptible individual tends to have a higher probability of getting vaccinated.
The terms and in (1c) describe the global immunization awareness and the intensity of global immunization awareness, respectively. Note that is increasing in . Consequently, for higher , a susceptible individual is more likely to get vaccinated.
The term in (1c) represents the probability that a node i changes its state from susceptible to vaccinated due to its local awareness. Note that is increasing in . Likewise, and the constant are called local immunization awareness and the intensity of local immunization awareness, respectively.
The depiction of each parameter and function in epidemic spreading model (1). Note that a node is less (respectively, more) likely to get infected (respectively, immunized) with the increase of intensity α, β, or b (respectively, , or ).
Description . | Parameters . | . |
---|---|---|
Spreading rate | λ | |
Recovering probability | γ | |
Probability of vaccine failure | δ | |
Awareness | Infection | Immunization |
Intensity of local awareness | α | |
Intensity of global awareness | β | |
Contact awareness | ||
Intensity of contact awareness | b |
Description . | Parameters . | . |
---|---|---|
Spreading rate | λ | |
Recovering probability | γ | |
Probability of vaccine failure | δ | |
Awareness | Infection | Immunization |
Intensity of local awareness | α | |
Intensity of global awareness | β | |
Contact awareness | ||
Intensity of contact awareness | b |
To investigate the effect of the heterogeneity of networks on the epidemic dynamics, we next make a coarse-graining approximation on (1) to derive a continuous-time degree-based mean-field model1–3,35,36 by assuming that (i) individuals with the same degree have the same property of dynamical behaviors, (ii) the variable si could be approximated by its expected value, (iii) the underlying network is uncorrelated, and (iv) the high order terms in (1b)–(1c) are negligible. To begin with, we divide individuals into several distinct groups depending on their degrees k. The fraction of the number of individuals with degree k is denoted by P(k) and the corresponding infectious and vaccinated densities among nodes with degree k are denoted by and , respectively. The model then reads as follows:
The detailed derivation of the above formula is provided in Appendix A due to its similarity to those in Refs. 4 and 5 and the tediousness.
We end the section by claiming that the epidemic spreading model (2) is well-defined in the sense that if initial conditions and satisfy , and , for all k, then and also satisfy , and , for all k and t > 0. The proof of Proposition 1 is given in Appendix B.
Proposition 1. Define
Then is positively an invariant for (2).
III. STABILITY ANALYSIS AND THE EPIDEMIC THRESHOLD
In this section, we study the epidemic spreading model (2) and compute the threshold for effective spreading rate .1,37 Our derived results are summarized in the following theorem and the proof is to be provided in Appendix B.
Theorem 1 (see, e.g., Table II and Fig. 1). Consider the epidemic spreading model (2). Then the following two assertions hold. (i) In the case that δ = 0 and either or , the epidemic dies out. In particular, every solution of (2) converges to a disease free equilibrium (DFE) for some in . (ii) In other cases, there exists an epidemic threshold , as given in the following:
where
such that the epidemic dies out when the effective spreading rate is smaller than ; otherwise, the disease breaks out.
The table lists the parameters chosen for simulation in Fig. 1. We also record the corresponding epidemic thresholds and final epidemic sizes . The simulation is evaluated for (2) under the degree distribution , , where , m = 2, M = 1000, and , and with the recovering probability . In the table, the dashed line means that the values of corresponding parameters are chosen to be the same as those given in No. 1.
No. . | . | α . | b . | . | δ . | β . | . | . | . | . |
---|---|---|---|---|---|---|---|---|---|---|
1 | 1.93 | 0.6 | 0.8 | 0.25 | 0.25 | 0.1 | 0.1 | 0.1 | 1.90 | 0.71% |
2 | … | … | … | … | … | 0.6 | … | … | … | 0.56% |
3 | … | … | … | … | … | … | 0.6 | … | … | 0.53% |
4 | … | … | … | … | … | … | … | 0.6 | … | 0.52% |
5 | 1.87 | … | … | … | … | … | … | … | … | 0 |
6 | … | 0.7 | … | … | … | … | … | … | 1.98 | 0 |
7 | … | … | 0.85 | … | … | … | … | … | 2.07 | 0 |
8 | … | … | … | 0.3 | … | … | … | … | 2.05 | 0 |
9 | … | … | … | … | 0.2 | … | … | … | 2.15 | 0 |
10 | … | 0 | 0 | 0 | 0 | 0.1 | 0 | 0 | Nonexistence | 0 |
No. . | . | α . | b . | . | δ . | β . | . | . | . | . |
---|---|---|---|---|---|---|---|---|---|---|
1 | 1.93 | 0.6 | 0.8 | 0.25 | 0.25 | 0.1 | 0.1 | 0.1 | 1.90 | 0.71% |
2 | … | … | … | … | … | 0.6 | … | … | … | 0.56% |
3 | … | … | … | … | … | … | 0.6 | … | … | 0.53% |
4 | … | … | … | … | … | … | … | 0.6 | … | 0.52% |
5 | 1.87 | … | … | … | … | … | … | … | … | 0 |
6 | … | 0.7 | … | … | … | … | … | … | 1.98 | 0 |
7 | … | … | 0.85 | … | … | … | … | … | 2.07 | 0 |
8 | … | … | … | 0.3 | … | … | … | … | 2.05 | 0 |
9 | … | … | … | … | 0.2 | … | … | … | 2.15 | 0 |
10 | … | 0 | 0 | 0 | 0 | 0.1 | 0 | 0 | Nonexistence | 0 |
Simulation results in model (2) for the ten cases given in Table II. For case Nos. 1–4, their corresponding time series , are plotted with the bold lines and the values of p(t) are labeled on the right vertical axis of the log scale ranging from to . For other cases Nos. 5–10, their corresponding time series , are plotted with the fine lines and the values of p(t) are labeled on the left vertical axis of the log scale, where p(t) are less than when .
Simulation results in model (2) for the ten cases given in Table II. For case Nos. 1–4, their corresponding time series , are plotted with the bold lines and the values of p(t) are labeled on the right vertical axis of the log scale ranging from to . For other cases Nos. 5–10, their corresponding time series , are plotted with the fine lines and the values of p(t) are labeled on the left vertical axis of the log scale, where p(t) are less than when .
Remark 1. (i) The implication of the first assertion of the theorem is that if people are aware of the importance of immunization and vaccination has a perfect success, then the epidemic is to die out eventually regardless of what other factors are. (ii) We see clearly, via (3) and (4), that, when
which depends on the contact type of awareness (ψ and ), local infection awareness (α) and is independent of local immunization awareness () and global type of awareness (β and ). It should also be noted, though, that , β, and play the role on decreasing the final epidemic size () when the disease breaks out (see, e.g., Table II and Fig. 1 in Section V).
IV. EFFECT OF THE DEGREE DISTRIBUTION ON THE EPIDEMIC THRESHOLD
In this section, we consider the impact of awareness on the epidemic threshold as given in (5). Specifically, we assume the contact type of awareness to be given as follows:4
It means that individuals with quite a large degree have negligible probability of being infected. Such assumption is also consistent with the strategy of the targeted immunization for the susceptible individuals in the epidemic spreading model,2 where individuals with a degree larger than some constant k0 are much more inclined to take immunization.
A. Heterogeneous networks
Complex networks describe a wide range of systems in nature and society such as the World Wide Web links, biological networks, and the contact network of individuals.1 SF networks,38 which are heterogeneous, have frequently been introduced into the epidemic spreading models. Their degree distributions follow a power law and, typically, the exponent and where m and M are, respectively, the minimum and maximum of degrees among nodes in SF networks. In this setting, the average of connections is finite but the variance is infinite as M approaches to infinity. Here . Remark that, throughout the paper, we denote by for any f(k).
For a SF network, if neither type of awareness is considered, that is, and , then we have, via (5), that and hence . It implies that the epidemic disease is bound to spread in a SF network with large M. However, by increasing the intensity b of contact infection awareness, we shall prove in the following theorem that the epidemic can be under control.
Theorem 2. Suppose that the probability δ of vaccine failure is positive. Then the epidemic threshold for a SF network with the exponent and tends to be 0 as M approaches to if and only if .
The above theorem indicates that the intensity b of contact infection awareness plays a critical role in determining the outbreak of the epidemic disease in SF networks. When the vaccine success is not perfect and the intensity b of contact infection awareness is low, the epidemic threshold becomes zero in the limit. As a result, even for extremely low effective spreading rates, the disease would be able to diffuse through the population and prevail in the SF networks. However, by sufficiently increasing the intensity b of contact infection awareness, the epidemic threshold then in the limit becomes a positive finite value.
B. Homogeneous networks
In this subsection, we consider the epidemic disease spreading in the homogeneous network and compare its epidemic threshold with that of the heterogeneous network (specifically, the SF network) under the assumption that two networks have the same average degree number . Contrary to the heterogeneous network that owns a long-tail degree distribution, another wide class of networks has exponentially bounded degree fluctuations and each node in the network has roughly the same number of links, . Networks of this property are called the homogeneous networks. Paradigmatic homogenous networks are the Erdös-Rényi random graphs and the Watts-Strogatz (WS) small-world models. For simplicity, we assume herein that all nodes in the homogeneous network have exactly the same degree. Then, via (5), we have that the corresponding epidemic threshold is
Note that, when neither type of awareness is considered, that is, , we have, via (7), that . Consequently
which implies that the epidemic disease is easier to break out in the heterogeneous network than in the homogeneous network. However, when awareness is taken into account, some more complicated and interesting results concerning the epidemic threshold can be observed. We will state our finding in the following theorems. The detailed proofs of these results, making use of Jesen's inequality and some properties of log-convex functions, are recorded in Appendix B.
Theorem 3. Suppose and . Then, for any , there exists some such that
Moreover, is strictly increasing in α and satisfies .
The theorem is essentially amount to saying that, for , there exists a nonempty and finite interval for which the epidemic disease is easier to break out in the homogeneous network than in the SF network provided that the intensity b of contact infection awareness lies in J. On the other hand, if , then the epidemic disease is easier to break out in the SF network.
In the next theorem, we show that, if the intensity of contact immunization awareness is nonzero, then the corresponding interval J could be empty, nonempty and finite, or infinite.
Theorem 4. Suppose and . Then, for any , there exists at most one open and connected interval such that
Moreover, if and only if b satisfies
Note that could be either of the form (a, b), , or of the form , or the empty set.
For m, the minimum degree among nodes in the SF network, sufficiently large and , we are able to show that must be an open, connected, nonempty, and finite interval. In particular, we prove that, given any set of parameters , its corresponding sign of can be determined as long as m is sufficiently large and . The above mentioned result is recorded in the following theorem.
Theorem 5. Consider and let A be the union of the sets Ai, , where , , , , , and . Here . Then the following holds.
For any set of parameters , there exists some positive integer m0 such that whenever the minimum degree m in the SF network is greater than or equal to m0. In particular, when , we have that .
For any set of parameters , .
For any set of parameters , there exists some positive integer m0 such that whenever the minimum degree m in the SF network is greater than or equal to m0. In particular, when b = 1 or 2, and , we have that .
Above theorem implies that, for any given and , the interval is open, connected, nonempty, and finite whenever m is sufficiently large. Indeed, for any (respectively, ), there exists some integer m0 such that (respectively, ) whenever since (respectively, ).
V. SIMULATIONS
In the first part of this section, we illustrate some numerical simulations for (coarse-graining) epidemic spreading model (2) to verify that the observations made in Remark 1 (ii) are indeed true. To see this, we set, in (2), , where r = 2.85, m = 2, M = 1000, and , while all other parameters are treated as testing variables. The simulation results in model (2) are provided in Table II and Fig. 1. In Table II, we record the parameters used for simulation, epidemic thresholds computed by (5) and the finial epidemic sizes from the simulation. It can be observed that, for epidemic spreading model (2), if the parameters are chosen as those in No. 1 (respectively, No. 5) in Table II, then (respectively, ). Consequently, we have that the epidemic disease breaks out (respectively, dies out) and its corresponding . Meanwhile, if we increase the intensity , b, or α of awareness or decrease the probability δ of vaccine failure, then the outbreak of the epidemic disease can be prevented (see Nos. 6–9 in Table II). However, if we increase the intensity β, , or of awareness, then it cannot prevent the epidemic outbreak but helps to reduce the final epidemic size (see Nos. 2–4 in Table II). We also point out that, if the vaccine success is perfect and immunization awareness is introduced, then the epidemic would eventually die out (see No. 10 in Table II). The time series simulation for the cases in Table II are given in Fig. 1.
We next aim to compare the size of and claimed in Theorems 4 and 5. To this end, we fix and . In addition, to compute , we set , where r = 2.85, M = 1000, and in (5), and, to compute , we set in (7). Here, the parameters m and b are treated as the testing ones, and their choices and their corresponding epidemic thresholds are given in Table III. In Table III, we see that the sign of changes twice from case 1 to 3 as b varies from b = 0.1 to b = 0.8 to b = 2.8. This indicates the existence of the interval as claimed in Theorem 4. On the other hand, the computed epidemic thresholds for cases 2, 4, and 5 seem to suggest that whenever as claimed in Theorem 5(i).
The table gives the values of epidemic thresholds and with fixed parameters and and varying parameters m and b.
Case . | m . | b . | . |
---|---|---|---|
1 | 1 | 0.1 | |
2 | 1 | 0.8 | |
3 | 1 | 2.8 | |
4 | 2 | 0.8 | |
5 | 3 | 0.8 |
Case . | m . | b . | . |
---|---|---|---|
1 | 1 | 0.1 | |
2 | 1 | 0.8 | |
3 | 1 | 2.8 | |
4 | 2 | 0.8 | |
5 | 3 | 0.8 |
For clarity, we summarize the results of Theorems 3–5 and our observations from the simulations in the following Table IV. Let be the set of the parameters b so that . The table gives the range of the parameters for which their corresponding is finite, infinite, or empty. The assertions made in the second row in Table IV is rigorous. The assertions in the third and fourth rows are based on numerical simulations. It is clear then that being nonempty and finite is generic. Consequently, the epidemic disease is easier (respectively, harder) to break out in the homogeneous network than in the heterogeneous network whenever the intensity of contact infection awareness is neither too low nor too high (respectively, intermediate).
VI. RELATED MODELS
In this section, we demonstrate that our model (2) is a generalized model for those considered in Refs. 1–5. Indeed, (i) if there is no immunization awareness, i.e., and the vaccine success is perfect, i.e., δ = 0, and if, in addition, we let , then the model becomes the one considered in Ref. 4. Moreover, in (3) is reduced to the following:
which is the one obtained in [Eq. (11), Ref. 4]. (ii) For model without considering infection awareness, i.e., , we have that
which is the model considered in Refs. 1–3. The corresponding epidemic thresholds and are computed as in (8). They are in agreement with those given in Refs. 1–3 and 39. (iii) If only local immunization awareness is considered, i.e., and , then our discrete-time version of the epidemic spreading model given in (A6) with h = 1 agrees with that considered in Ref. 5.
VII. CONCLUSION
We proposed an epidemic spreading model including the element of vaccine failure and three types of infection awareness and immunization awareness. Our results generalize the established results on reduced forms of the model presented here. We also find that the epidemic threshold for the homogeneous network can be lower than that of the heterogeneous network provided that the intensity of contact infection awareness lies in an intermediate regime. It is of interest to study the effect of vaccine failure and awareness on cooperative40–42 or competitive43,44 disease dynamics.
ACKNOWLEDGMENTS
The authors would like to thank the referees for their valuable comments which help to improve the quality of the paper. This research was supported by the Ministry of Science and Technology of Taiwan under Grant No. Most 105-2115-M-009-002-MY2.
APPENDIX A: THE DERIVATION OF THE EPIDEMIC SPREADING MODEL (2)
In this section, we give the detailed derivation of the epidemic spreading model (2) from (1). We first make some coarse-graining approximations on (1) to get the discrete-time heterogeneous mean-field model of it. To this end, we divide the individuals into several distinct groups depending on their degrees k. Denote by P(k), the fraction of the number of individuals with degree k, and and by the corresponding infectious and vaccinated densities among nodes with degree k, respectively. Then it is assumed that each individual with the same degree has the same property of dynamical behaviors. To be more precise, we assume that, for each node i in the subgroup with degree k
where . Then we use the expected value of variable s to get an approximation of it. That is, we assume that
Here B(s, k) is the probability that a node with degree k has exactly s infectious neighbors, and it is assumed to satisfy the binomial distribution.45 That is
where is the probability of a randomly selected link pointing to an infectious individual, and it is assumed to be1,37
as defined in (2d). Herein, we assume that the underlying network is uncorrelated.
since and . Similarly
Next, to derive the continuous version of the epidemic spreading model (2), we first shorten the time interval for the iterations from to . In the time interval , we assume that the probability of recovering and vaccine failure to be γh and δh, respectively. Similarly, we assume that and , which means that the probability that an individual changes its state depends linearly on the length of exposure. Then, by (1a) and letting and , we have that the discrete-time heterogeneous mean-field model of (1) reads as follows:
APPENDIX B: PROOFS IN THE MAIN TEXT
In this section, we give detailed proofs of Proposition 1, and Theorems 1–5.
Proof of Proposition 1. To show that is positively invariant for (2), it suffices to claim that the vector field defined by (2) is tangent or points into on the boundary of . Clearly, if and either or for some k0. Note, via (2), that we have (respectively, ) whenever (respectively, ). Similarly, provided that . The proof of the proposition is just completed. □
Proof of Theorem 1. Let be a DFE of (2), where and . Then some direct computation from (2) yields that satisfies . Hence, (i) if δ = 0 and , then can be any arbitrary value in , while (ii) if or , then , as defined in the first equation of (4).
To see the first assertion of the theorem, let and . Consider the Lyapunov candidate function . Then since, as can been seen in Eq. (2), when δ = 0, and by Proposition 1. By LaSalle's invariant principle, all solutions of (2) approach the largest invariant S of . Clearly, when δ = 0, if and only if or by (2) and the definitions of p and Θ since either or . However, when and the equality holds if and only if pk = 0. It implies that pk = 0 for points in S. Thus, for every solution of (2), converges to 0 for each k. Moreover, since is increasing and bounded above, also converges to some fixed point in .
We next prove the second assertion of the theorem. From (2), it can be easily seen that
Hence the Jacobian matrix of (2) at the DFE is
where with
if , otherwise , and
and I, 0, are the identity and zero matrices of size n × n, respectively. Clearly, where takes the maximum real parts of the eigenvalues of a matrix. Define and with and . Then, by (B3), we have that . And so, . On the other hand, since , we have that . Hence the DFE of model (2) is stable if and only if , or equivalently, , where is defined as in (3). Moreover, since the epidemic disease breaks out when the stability of DFE of model (2) is lost, is indeed the threshold for the outbreak of epidemic disease.
To complete the proof, we note that, in the case of δ = 0, and , we have that, by (2)
Hence, . The proof is complete. □
Proof of Theorem 2. In the case that , where , and functions ψ and are defined as in (6), we compute, via (5), that
Since the numerator of the above equation is finite for any and the denominator goes to as M tends to if and only if , the proof of theorem is complete. □
In Theorems 3–5, we aim to compare the size of and . To this end, we need to apply some well-known results, which are stated in the following two lemmas for ease of the references.
Lemma B.1 (Jesen's inequality). Let P(k) be a discrete probability distribution and f be a continuous function defined on . If f is convex (respectively, concave) in , then (respectively, ) . Moreover, both of the above equalities hold if and only if xk are all equal or f is linear.
Lemma B.2 (Theorem F in p. 19 of Ref. 46). Let f be a positive function defined in an interval I. Then f is said to be a log-convex function in I if is convex in I. The class of log-convex functions in I is closed under addition, multiplication, and taking the limits, provided that the limits exist and are positive.
Proposition B.2. Define
Then
, whenever is convex in ,
, whenever is concave in .
Moreover, both of the above equalities hold if and only if equals to , (2, 0, 0) or where .
where , and
respectively. Then by applying Lemma B.1 to function and letting xk = k, the proof of the theorem is complete. □
Lemma B.3. Suppose . Then the following assertions hold.
If , then ;
If b = 1, then ;
If , then ;
If b = 2, then and the equality holds only when α = 0.
If b > 2 and , then .
Proof. In the case of , we compute directly by (B5) that
It follows that (respectively, < 0) in if b < 1 (respectively, ). Hence, statements (i) and (iii) in the lemma hold true by Proposition B.2.
For b > 2, since and is increasing in x, has the same sign in if and only if , or equivalently, . Hence, statement (v) holds true. The remaining statements (ii), (iv), and (v) in the lemma can be shown similarly and thus are omitted. □
We are now in the position to prove Theorems 3–5.
Proof of Theorem 3. In the following, we only give the proof for the case that . When , the proof can be obtained similarly.
For any and , define function g(b) in by
Then by Theorem 2 and Eq. (7), g is well defined for all . Moreover, when , since and , we have that . We now show that g is convex. Since, by (B4)
we compute hat . It implies that is a log-convex function. Consequently, is also a log-convex function of b by Lemma B.2. On the other hand, since, by (7)
we compute that . From the above, we conclude that on . That is, g is convex on .
We next show the existence of for and in the case that . From Lemma B.3, it is easy to see that, for any , g(b) > 0 when , while g(b) < 0 when . Then the convex property of g implies that it has exactly two zeros at b = 1 and some . In fact, g(b) > 0 when and g(b) < 0 when . Then by the definition of g, the inequalities stated in the theorem hold true.
Now, we show that is strictly increasing in . Suppose not, then there exist such that . By the definition of function , and as claimed above. For each fixed , define in by
Then clearly, if and only if . Hence, . Note that in the case that , function hb becomes
Since, by Lemma B.1, for and the equality holds if and only if b = 2, we have that . It follows that has exactly one zero, which is a contradiction to the fact that . Moreover, it is clear to see that, since , we have that:
Hence, the proof is complete. □
Proof of Theorem 4. Note that the facts that the function g(b), defined in (B6), is convex on and are proved for all and . Moreover, by Theorem 2 and Eq. (7), g(b) > 0 for b on or there exists some nonempty open interval J such that g(b) < 0 if and only if . These two scenarios correspond to and , respectively.
On the other hand, consider the function defined in (B7). Then if and only if or equivalently, b satisfies
Hence, the proof is complete. □
Proof of Theorem 5. For , we compute directly that
where
Then . Clearly, when , we have that , which implies that there exists some positive integer m0 such that for . Hence, by Proposition B.2, whenever the minimum degree in the SF network is greater than m0. On the other hand, when , since , whenever the minimum degree in the SF network is greater than some positive integer m0. The remaining cases stated in the Theorem can be proved similarly. □