Abstract
In this work we develop a study of positive periodic solutions for a mathematical model of the dynamics of computer virus propagation. We propose a generalized compartment model of SEIR-KS type, since we consider that the population is partitioned in five classes: susceptible (S); exposed (E); infected (I); recovered (R); and kill signals (K), and assume that the rates of virus propagation are time dependent functions. Then, we introduce a sufficient condition for the existence of positive periodic solutions of the generalized SEIR-KS model. The proof of the main results are based on a priori estimates of the SEIR-KS system solutions and the application of coincidence degree theory. Moreover, we present an example of a generalized system satisfying the sufficient condition.
MSC:
34K13; 34D23
1. Introduction
1.1. Scope
In the last decades, due to its theoretical and practical importance and significance, the mathematical models for dynamics of propagation for epidemics have been extensively studied, see for instance [1,2,3,4,5,6,7,8,9,10] and references in those works. In particular, mathematical models are powerful tools since it permits to explain, estimate and simulate the spread of infectious disease propagation, and consequently help to design and test control strategies like an optimal time of vaccination.
From the historical point of view, the earliest mathematical models in epidemiology were introduced in 1927 [11]. Following the presentation given in [12], we have that the basic idea considered in [11], in order to describe the dynamics of a virus, was the partition of the total population N in three classes: the susceptible class S formed for those individuals capable of contracting the disease and becoming themselves infectives; the infective class I formed for those individuals capable of transmitting the disease to susceptibles; the removed or recovered class R formed for those individuals which having contracted the disease, have died or, are permanently immune, or have been isolated, thus being unable to further transmit the disease. Moreover, they consider the three assumptions: the period of the epidemic is too short such that N is constant, the transfer process from S to I is modeled by the mass action law and the transfer process from I to R is of exponential decay type. Then, the called SIR model is given by the following system
where k and are some positive constants. A particular case of SIR model is the well known SIS model, which is deduced by considering the partition of the population in two classes of individuals: susceptible and infected. Afterwards, numerous generalizations are given by several authors, who have improved the SIR mathematical model by incorporating for instance the vital dynamics, a generalized transmission forces, other classes of individuals and vaccination.
It is well known that the outbreaks of parasite population, which generate the epidemics occur around the same time of each year. Then becomes natural to study the periodicity or model these diseases by incorporating periodic functions into the epidemic models. For instance, in the case of the SIR model the periodic models are introduced by considering the facts that k and are time dependent periodic functions.
On the other hand, the compartmental models were introduced for biological epidemics. However, by the newest observation that the diffusion of biological virus is analogous to several processes in other areas, the ideas have been widely adapted and used to describe other phenomenon. For instance, the computer virus propagation in a network [13,14,15,16,17,18]. In particular, in this paper our aim is to study the periodicity of the mathematical model for virus propagation introduced in [18].
1.2. The Generalized SEIR-KS Mathematical Model
In [18] the authors construct a compartmental model for computer virus propagation. They consider that the population of individuals is given by computers or nodes in a network which are in corresponding communications all the time. The population is partitioned in five classes: the susceptible class S formed by the nodes which are virus-free uninfected; the exposed class E formed by the nodes which are infected, but the virus is latent; the infected class I formed by the nodes which are infected and the virus is breaking out; the recovered class R formed by the nodes which have recovered from virus infection and acquired immunization; and the kill signals class K formed by special nodes, which are a sort of anti-virus epidemic riding on the back of the virus propagation and all of them constitute a new compartment, which is generated among the infectious nodes then they can spontaneously transmit it to their neighboring nodes. The dynamic of computer virus transmission is studied by considering the following list of assumptions:
- (A1)
- The network at time t is formed by a total of nodes. Then, we have the following relation at each time t.
- (A2)
- There is a behavior similar to vital dynamics of biological virus. More specifically, related with births and deaths, there is two characteristics in the process: (i) the new nodes are connected to the network at constant rate b and a fraction p are of susceptible type and the remaining fraction are of exposed type; and (ii) each node, by system crash or network interruption, are disconnected from the network at constant rate .
- (A3)
- The dynamics of exposed nodes are characterized by three facts: (i) the susceptible nodes are transformed in exposed nodes with probability per unit time with a constant; (ii) the exposed nodes are converted into infected ones at constant rate ; and (iii) the exposed nodes are converted into kill signals ones at constant rate .
- (A4)
- The infected nodes are converted into kill signals nodes or recovered ones at constant rates and , respectively.
- (A5)
- The kill signal nodes satisfy two additional premises: (i) the susceptible nodes receive the kill signal and converted into recovered ones with probability ; and (ii) the infected nodes receives and relays the kill signal nodes with probability . Here and are constants.
Then, the following ordinary differential equation system
is introduced as the mathematical model for computer virus propagation.
In this work, with the purpose to study the existence of periodic solutions for systems of Equation (1), we consider a more general model by assuming that constants on the assumptions (A2)–(A5) are time dependent real functions, i.e., the parameters b, p, p, , , , , , , and are time dependent real functions. More precisely, we are motivated by the analysis of the following generalized model:
We observe that the system in Equation (2) can be uncoupled in the study of the system in Equation (2)a–e. Indeed, it is the strategy considered in [18] to analyze the stability. However, to study the existence of periodic solutions is more convenient to consider the full system, since it is not straightforward the fact that the existence of positive periodic solutions for Equation (2)a–d implies the existence of positive periodic solution for Equation (2)e.
1.3. Reformulation of System in Equation (2) as Operator Equation
Firstly, we introduce a change of variable such that the system in Equation (2) is replaced by an equivalent system. Then, we reformulate the new system as seen in Equation (4) as an operator equation which will be analyzed by the topological degree theory.
For and R satisfying the system in Equation (2), we consider the new functions and defined explicitly by the relation
Then, by differentiation in Equation (3) and using the fact that satisfy the mathematical model in Equation (2), we deduce that is a solution of the system
Thus, our aim is to study the positive periodic solutions of Equation (2) equivalently replaced by the analysis of positive periodic solution of the new system (4).
Theorem 1.
Consider the sets of functions and are related by Equation (3). Then, the functions and R are a solution of the system in Equation (2) if and only if the functions and are a solution of the system in Equation (4). In particular, we have that the following two assertions are valid: (a) If and satisfying the system in Equation (4) are ω-periodic functions, then the functions and R satisfying the system in Equation (2) are ω-periodic; and (b) The existence of a solution for the system in Equation (4) imply the existence of a positive solution for the system in Equation (2).
Proof.
The proof fact that is a solution of the system in Equation (2) if and only if is straightforward by the change of variable (3), differentiation and algebraic rearrangements. Now, we get the proof of item (a) by using the change of variable (3), for illustration, we consider the case of function S and we have that The item (b) is a straightforward consequence of the definition of the functions and given in Equation (3). ☐
In order to define the operator equation, we consider the normed vector spaces X and Y and introduce the operators and explicitly defined by the relations
where
The operator notation implies that the system in Equation (4) can be rewritten as the following operator equation
where the appropriate Banach spaces X and Y are defined by
Hereinafter we use the bold notation . We notice that the spaces in Equation (13) are the more convenient, since we are concerned with the analysis of -periodic solutions. However, if the interest is to analyze other properties we should be consider a suitable definition of X and Y.
1.4. Main Results
By convenience of presentation, we introduce the notation
for any positive real valued bounded function f defined on .
Let us consider the following assumption
Then, the main result of the paper are given by the following three theorems.
Theorem 2.
Let X and Y the spaces defined on Equation (13); defined by and the operators and defined on Equations (5) and (6), respectively. Moreover, assume that the hypothesis in Equation (15) is satisfied. Then, there are the positive constants and , such that the following two assertions are valid
- (a)
- If and are such that , the following inequalitiesholds for all
- (b)
- If are such that , the following inequalitiesholds for all
Theorem 3.
If the hypothesis in Equation (15) is satisfied, there exists at least one ω-periodic solution of Equation (4).
Theorem 4.
Consider that the hypothesis in Equation (15) is satisfied. Then, the system in Equation (2) has at least one positive ω-periodic solution.
1.5. Related Works
There are several works where the study of positive periodic solutions is developed, for instance in [13,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33]. In particular, recently in [13] was proved the existence of at one positive periodic solution of the following system modeling the dynamics of a computer virus
by assuming that and are strictly positive and the functions and are positive, continuous, -periodic on and
We observe that and A denotes the susceptible computers, the latent computers and the infectious computers, respectively.
1.6. Outline of the Paper
The paper is organized as follows. In Section 2, we introduce some terminology related to the coincidence degree theory and some useful results. In Section 3, Section 4 and Section 5 we develop the proof of Theorems 2–4, respectively. Finally, in Section 6, we present an examples of a system with coefficients satisfying Equation (15).
2. Preliminaries
In this paper, we utilize the standard notation and terminology of topological degree theory. However, for self-contained presentation, we recall some notation, concepts and results related to the statement of of Mawhin’s theorem, [34]. Moreover, we prove some properties for the operators L and N defining on the operator Equation (12).
2.1. The Mawhin’s Continuation Theorem
Definition 1.
Let X and Y be normed vector spaces and a linear operator. Then, L is called a Fredholm operator of index zero, if the following assertions
are valid.
Proposition 1.
Let X and Y be normed vector spaces and a linear operator. If L is a Fredholm mapping of index zero, then
- (i)
- There are two continuous projectors and such that and .
- (ii)
- is invertible and its inverse is denoted by .
- (iii)
- There is an isomorphism .
Definition 2.
Let X and Y be normed vector spaces and a Fredholm mapping of index zero. Let and be two continuous projectors such that and . Let us consider a continuous operator and an open bounded set. Then, N is called compact on if is a bounded set and the operator is compact on .
Definition 3.
Let be an open bounded set, and , i.e., y is a regular value of f. Here, the critical set of f and the Jacobian of f at x. Then, the degree is defined by with the agreement that .
Theorem 5.
Assume that and are two Banach spaces and Ω is an open bounded set. Consider that be a Fredholm mapping of index zero and be L-compact on . If the following hypotheses
- (C1)
- for each .
- (C2)
- for each
- (C3)
- .
are valid. Then the operator equation has at least one solution in
2.2. L Is a Fredholm Operator of Index Zero
Lemma 1.
Proof.
In order to prove the Lemma we apply the Definition 1 or more precisely we prove that L satisfy Equation (20).
The left condition in Equation (20) is proved as follows. Let such that , we observe that is equivalent to for all . Then, we have that Now, if we select arbitrarily , we have that there is such that . Then, from Equation (5) and -periodic behavior of , we deduce that for each or equivalently Now, by linear algebra results, we recall the existence of isomorphisms and . Thus, we have that and we get that .
To prove the left condition in Equation (20) we introduce the linear continuous mapping defined by and observe that . Thus, clearly is a closed set of the space Y. ☐
2.3. Construction of the Projectors and the Operator
We remark that the existence of three abstract projectors and associated to L, is guaranteed by Proposition 1. However, by convenience of some calculus in the following sections we introduce explicitly the definitions of P and Q given by
and notice that satisfy the relations in Proposition 1. More precisely, we have that
- (a)
- . We prove that as follows: from the isomorphism given on Lemma 1, we observe that is equivalent to the fact that is constant for all which at the same time implies that , since for constant we have that Conversely, the proof of the inclusion is deduced by the following facts: for there is such that and from Equation (21) we obtain that which implies by differentiation the fact that or
- (b)
- . From the definition of Q given in Equation (21) we have that is equivalent to and from the characterization of given on Lemma 1 is at the same time equivalent to
- (c)
- . Let , then there is such that , which implies thatand, from the characterization of given on Lemma 1, we get that Thus, we obtain that . By analogous arguments, we can prove the inclusion .
- (d)
- Operators and The notation is is introduced for the restriction of L to i.e., is the operator defined from to and on . The symbol is used to denote the inverse of , and is precisely defined as the operator such thatWe notice that, we can prove that the operator is the inverse of the operator by application of the following identitywhich is valid only for all
Thus, the projectors P and Q defined on Equation (21) satisfy the Proposition 1, since we can follow and are satisfied from (a)–(c) and (d), respectively.
2.4. N Defined on Equation (6) Is a Continuous Operator
Lemma 2.
Proof.
Let us choose arbitrarily the sequence which converges to in the norm induced topology of X. By the definition of N given on Equation (6) and applying componentwise the inequality
we get the existence of depending only on and such that Thus, the sequence converges to in the topology of X induced by the norm. Hence, we can deduce that N is a continuous operator. ☐
2.5. N Defined on Equation (6) Is L-Compact on any Ball of X Centered at .
Lemma 3.
Proof.
The proof is focused in the verification of the fact that L satisfy the two requirements of Definition 2: is a bounded set and is a compact operator on , since is an open bounded set by the its definition given on Equation (23) and L is a Fredholm operator of index zero by application of Lemma 1.
To prove that is bounded we proceed as follows. We observe that
Then, for we have that which implies that is bounded.
In order to prove that is a compact operator on , we observe that from Equations (6), (21) and (22) we get
Then, we deduce that as a result we have that is a bounded, since the operator N is bounded on . Moreover, we can prove the bound
i.e., is an equicontinuous operator. Hence, by Arzela Ascoli’s theorem we get that is a compact operator on . ☐
2.6. A Useful Auxiliary Result
Proposition 2.
[13] Let be an absolutely continuous function satisfying the differential inequality
with such that for all and for some positive constants and . Then, if we have that for all
3. Proof of Theorem 2
3.1. Four Useful Lemmata
We introduce four Lemmmata related with some estimates for the operator equation , which is equivalent to the following system
and also can be rewritten as the system
We notice that to deduce Equation (27) we multiply the i-th equation of the system in Equation (26) by . Thus, the proof of estimates for is focused in to get the estimates of the solutions of Equation (26) (or equivalently of Equation (27)).
Lemma 4.
Proof.
By the continuity of the coefficient functions and the fact that , we have that and , for any . Then, we can prove Equations (28)–(30), by straightforward application of Proposition 2 to Equations (27)b,d,e, respectively, since we have that
for any Now, to prove Equations (31) and (32), for , we introduce the notation for the points where has a minimum. Then, using the notation in Equation (14), from Equations (27)a,c, and (28) we get
for any ☐
Lemma 5.
Assume that hypotheses of Lemma 4. Then, the solution of the operator equation with satisfy the integral inequalities
Proof.
We integrate the equations of the system in Equation (27) on and using the -periodicity of we deduce the following identities
Then, adding Equation (38)a,b, using the -periodicity of and , and the fact that , we deduce that
which implies Equations (33), (34) and (36), since, by the positivity of and and the notation in Equation (14), we get the inequalities
The inequality in Equation (35) is a consequence of Equations (38)c and (34), since
Now, from Equations (38)e, (36) and (32), we deduce the following estimate
which implies Equation (37). ☐
Lemma 6.
Assume that hypotheses of Lemma 4. Then, the solution of the operator equation with satisfy the integral inequalities
Proof.
We integrate the system in Equation (26) on and by using the -periodicity behavior of , we have that
Then, taking the modulus of the each equations defining the system in Equation (26); integrating each resulting equations on ; using the information that ; employing the relations of Equation (44); and applying the inequalities on Lemmas 4 and 5, we obtain the following estimates
which conclude the proof of lemma. ☐
Lemma 7.
Assume that hypotheses of Lemma 4. Moreover consider that the hypotheses (15) and is the solution of the operator equation with the following estimates
are satisfied. In particular, and for and
Proof.
We get the proof by application of Lemmas 4, 5 and 6, and the hypotheses in Equation (15). We notice that we can prove some relations in Equations (45)–(47) by a straightforward consequence of Lemmas 4, 5 and 6. More precisely, we can deduce
from Equations (28)–(30); (33)–(36); and (40)–(42); respectively. Meanwhile, to prove the remaining inequalities we proceed as follows:
- (i)
- we prove that for
- (ii)
- we prove Equation (45) for
- (iii)
- we prove Equation (47) for
- (iv)
- we prove Equation (46) for
- (v)
- we prove Equation (47) for
Proof of (i). From Equation (49) and the intermediate value for integrals we can deduce that there exist satisfying the inequality for Then, by the fundamental theorem of calculus and Equation (50), we deduce that
for any , which clearly implies (i).
Proof of (ii). We notice that the assertion proved in (i) for and Equation (31) imply that
for any By hypotheses in Equation (15) we have that , then Equation (51) implies Equation (45) for with Now, from the assertion proved in (i) for and Equation (32) we can deduce Equation (45) for with
Proof of (iii). From Equation (48) and Lemma 6, we can follow that Equation (47) for is satisfied with
Proof of (iv). Form similar arguments and notation to the proof of step (i), Equation (47) and Equation (47) for , we can deduce that
for some and any . Then, Now, from Equation (37) and the assertion proved in (i) for we deduce that
Then, Equation (47) for is satisfied.
Summarizing we have that Equation (45) is followed by Equation (48) and (ii); Equation (46) is a consequence of Equation (49) and (iv); and Equation (47) is proved from Equation (50), and (iii) and (v). Moreover, we observe that a sequence of similar arguments and notation to the proof of step (i), Equations (47) and (47) for , implies that
for some and any . Then, . Then, we get the additional and particular inequalities are followed from (i) and (iv). ☐
3.2. Proof of (a)
We can prove the estimate in Equation (17) by application of Lemma (7).
3.3. Proof of (b)
If , then by the results of Section 2.3, we have that is constant for any . By notational convenience we consider that . Then, from Equation (24) the condition implies that
Then, from Equation (55) and following similar arguments to the proof of Lemma 7, we can deduce that in this case an inequality of the type in Equation (46) is also valid, i.e.,
which implies Equation (18). Moreover, from Lemma 7 and the fact that , we can deduce that
Thus, the inequality in Equation (19) is also satisfied.
4. Proof of Theorem 3
4.1. A Previous Lemma
Lemma 8.
Let X and Y be the spaces defined on Equation (13); the open ball centered at with radius
where and are defined in the proof of Lemma 7; and and Q the operators defined on Equations (5), (6) and (21), respectively. If Equation (15) is satisfied, the operators L and N satisfy the properties (C1)–(C3) of Theorem 5.
Proof.
We prove (C1) and (C2) by contradiction argument and we prove (C3) by application of invariance property of the topological degree. Indeed, we have that
- (C1)
- Let us assume that there are and such that Then, by application of Theorem 2-(a) we deduce that which is a contradiction to the assumption that
- (C2)
- Let us assume that there is such that Then, by application of Theorem 2-(b) we deduce that which is a contradiction to the assumption that
- (C3)
- Let us define the mapping by the following relationWe prove that when and . From Lemma 1 we recall that is a constant. Let us consider that the conclusion is false, then the constant vector with satisfies , that is,Then, by following similar reasoning steps to the proof of Theorem 2-(a) we get that , which contradicts to the assumption that .Let us consider such that , then by applying the Homotopy Invariance Theorem of Topology Degree, using the fact that the systemhas a unique solution noticing that the determinant of the Jacobian of at is given bywith and the positive functionsand by Definition 3, we have thatHence, we get that and prove that (C3) is valid.
Therefore, the assertions on items (C1)–(C3) of the Theorem 5 are valid for the given operators. ☐
4.2. Proof of Theorem 3
By Lemmata 7 and 8, we notice that the assumptions of the Theorem 5 are satisfied. Thus, there exist at least one solution of operator equation in Equation (12) belong , which implies the existence of at least one periodic solution of the system in Equation (4).
5. Proof of Theorem 4
The proof of Theorem 4 is a consequence of Theorems 3 and 1. Indeed, from Theorem 3 we deduce that there exists at least one periodic solution of Equation (4). Then, we get the proof of Theorem 4 by application of Theorem 1.
6. An Example
Let us consider that
which are 2-periodic functions. We notice that
and we have that the hypothesis in Equation (15) is satisfied by selecting and . Thus, by application of Theorem 4, we deduce that the system in Equation (2) with coefficients defined by Equation (57) has at least one positive 2-periodic solution.
Author Contributions
Conceptualization, A.C. and F.H.; methodology, A.C.; investigation, all authors; writing—original draft preparation, F.N.-M. and E.L.; writing—review and editing, E.L.; funding acquisition, I.H. and F.N.-M. All authors have read and agreed to the published version of the manuscript.
Funding
A.C. and F.N.-M. thanks the support of research by projects DIUBB GI 172409/C, DIUBB 183309 4/R and DIUBB 192408 2/R at Universidad del Bío-Bío, Chile.
Acknowledgments
A.C. and E.L. thank the suggestions of colleges at Ciencias Básicas of Universidad del Bío-Bío. I.H. thanks to the grants program “Becas de doctorado” of ANID-Chile, 2017-Fol. 21171196.
Conflicts of Interest
The authors declare that they have no competing interests.
References
- Anderson, R.M.; May, R.M. Population biology of infectious diseases I. Nature 1979, 280, 361–367. [Google Scholar] [CrossRef]
- Hethcote, H. Qualitative analyses of communicable disease models. Math. Biosci. 1976, 28, 335–356. [Google Scholar] [CrossRef]
- Hethcote, H.W. The mathematics of infectious diseases. SIAM Rev. 2000, 42, 599–653. [Google Scholar] [CrossRef]
- Kuznetsov, Y.A.; Piccardi, C. Bifurcation analysis of periodic SEIR and SIR epidemic models. J. Math. Biol. 1994, 32, 109–121. [Google Scholar] [CrossRef] [PubMed]
- Li, F.; Zhao, X.Q. A periodic SEIRS epidemic model with a time-dependent latent period. J. Math. Biol. 2019, 78, 1553–1579. [Google Scholar] [CrossRef]
- Ma, W.; Song, M.; Takeuchi, Y. Global stability of an SIR epidemic model with time delay. Appl. Math. Lett. 2004, 17, 1141–1145. [Google Scholar] [CrossRef]
- Martcheva, M. An Introduction to Mathematical Epidemiology; Texts in Applied Mathematics, 61; Springer: New York, NY, USA, 2015. [Google Scholar]
- Smith, R. (Ed.) Mathematical Modelling of Zombies; University of Ottawa Press: Ottawa, ON, Canada, 2014. [Google Scholar]
- Smith, R. Modelling Disease Ecology with Mathematics, 2nd ed.; AIMS Series on Differential Equations & Dynamical Systems, 5; American Institute of Mathematical Sciences (AIMS): Springfield, MO, USA, 2017. [Google Scholar]
- Brauer, F.; Castillo-Chavez, C. Mathematical Models in Population Biology and Epidemiology, 2nd ed.; Texts in Applied Mathematics, 40; Springer: New York, NY, USA, 2012. [Google Scholar]
- Kermack, W.O.; McKendrick, A.G. Contributions to the mathematical theory of epidemics: Part I. Proc. R. Soc. A. 1927, 115, 700–721. [Google Scholar]
- Capasso, V. Mathematical Structures of Epidemic Systems; Lecture Notes in Biomathematics, 97; Springer: Berlin, Germany, 2008. [Google Scholar]
- Coronel, A.; Huancas, F.; Pinto, M. Sufficient conditions for the existence of positive periodic solutions of a generalized nonresident computer virus model. Quaest. Math. 2019. [Google Scholar] [CrossRef]
- Muroya, Y.; Enatsu, Y.; Li, H. Global stability of a delayed SIRS computer virus propagation model. Int. J. Comput. Math. 2014, 91, 347–367. [Google Scholar] [CrossRef]
- Muroya, Y.; Kuniya, T. Global stability of nonresident computer virus models. Math. Methods Appl. Sci. 2015, 38, 281–295. [Google Scholar] [CrossRef]
- Muroya, Y.; Li, H.; Kuniya, T. On global stability of a nonresident computer virus model. Acta Math. Sci. Ser. B Engl. Ed. 2014, 34, 1427–1445. [Google Scholar] [CrossRef]
- Murray, W.H. The application of epidemiology to computer viruses. Comput. Secur. 1988, 7, 130–150. [Google Scholar] [CrossRef]
- Ren, J.; Yang, X.; Zhu, Q.; Yang, L.-X.; Zhang, C. A novel computer virus model and its dynamics. Nonlinear Anal. Real World Appl. 2012, 13, 376–384. [Google Scholar] [CrossRef]
- Alonso-Quesada, S.; De la Sen, M.; Ibeas, A. On the discretization and control of an SEIR epidemic model with a periodic impulsive vaccination. Commun. Nonlinear Sci. Numer. Simul. 2017, 42, 247–274. [Google Scholar] [CrossRef]
- Ávila-Vales, E.; Rivero-Esquivel, E.; García-Almeida, G.E. Global dynamics of a periodic SEIRS model with general incidence rate. Int. J. Differ. Equ. 2017. [Google Scholar] [CrossRef]
- Bai, Z.; Zhou, Y. Global dynamics of an SEIRS epidemic model with periodic vaccination and seasonal contact rate. Nonlinear Anal. Real World Appl. 2012, 13, 1060–1068. [Google Scholar] [CrossRef]
- Cooke, K.L.; van den Driessche, P. Analysis of an SEIRS epidemic model with two delays. J. Math. Biol. 1996, 35, 240–260. [Google Scholar] [CrossRef]
- Du, Y.; Guo, Y.; Xiao, P. Freely-moving delay induces periodic oscillations in a structured SEIR model. Internat. J. Bifur. Chaos Appl. Sci. Engrg. 2017, 27, 1750122. [Google Scholar] [CrossRef]
- Fang, H.; Wang, M.; Zhou, T. Existence of positive periodic solution of a hepatitis B virus infection model. Math. Meth. Appl. Sci. 2014, 38, 188–196. [Google Scholar] [CrossRef]
- Gao, L.Q.; Mena-Lorca, J.; Hethcote, H.W. Four SEI endemic models with periodicity and separatrices. Math. Biosci. 1995, 128, 157–184. [Google Scholar] [CrossRef]
- Huang, G.; Takeuchi, Y.; Maw, W.D. Global stability for delay SIR and SEIR epidemic models with nonlinear incidence rate. Bull. Math. Biol. 2010, 72, 1192–1207. [Google Scholar] [CrossRef] [PubMed]
- Mateus, J.P.; Silva, C.M. Existence of periodic solutions of a periodic SEIRS model with general incidence. Nonlinear Anal. Real World Appl. 2017, 34, 379–402. [Google Scholar] [CrossRef]
- Nakata, Y.; Kuniya, T. Global dynamics of a class of SEIRS epidemic models in a periodic environment. J. Math. Anal. Appl. 2010, 363, 230–237. [Google Scholar] [CrossRef]
- Nistal, R.; de la Sen, M.; Alonso-Quesada, S.; Ibeas, A. Limit periodic solutions of a SEIR mathematical model for non-lethal infectious disease. Appl. Math. Sci. 2013, 7, 773–789. [Google Scholar] [CrossRef]
- Yan, M.; Xiang, Z. Dynamic behaviors of an SEIR epidemic model in a periodic environment with impulse vaccination. Discrete Dyn. Nat. Soc. 2014. [Google Scholar] [CrossRef][Green Version]
- Zhang, T.; Liu, J.; Teng, Z. Existence of positive periodic solutions of an SEIR model with periodic coefficients. Appl. Math. 2012, 57, 601–616. [Google Scholar] [CrossRef]
- Zhang, Y.; Zhu, J. Dynamic behavior of an I2S2R rumor propagation model on weighted contract networks. Phys. A 2019, 536, 120981. [Google Scholar] [CrossRef]
- Zhu, L.; Liu, M.; Li, Y. The dynamics analysis of a rumor propagation model in online social networks. Phys. A 2019, 520, 118–137. [Google Scholar] [CrossRef]
- Gaines, R.; Mawhin, J. Coincidence Degree and Nonlinear Diffrential Equations; Springer: Berlin, Germany, 1977. [Google Scholar]
© 2020 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).