Hopf Bifurcation of Nonresident Computer Virus Model with Age Structure and Two Delays Effects

Abstract

This paper constructed and studied a nonresident computer virus model with age structure and two delays effects. The non-negativity and boundedness of the solution of the model have been discussed, and then gave the basic regeneration number, and obtained the conditions for the existence and the stability of the virus-free equilibrium and the computer virus equilibrium. Theoretical analysis shows the conditions under which the model undergoes Hopf bifurcation in three different cases. The numerical examples are provided to demonstrate the theoretical results.

Share and Cite:

Dang, Y. , Tan, H. and Cao, H. (2023) Hopf Bifurcation of Nonresident Computer Virus Model with Age Structure and Two Delays Effects. Journal of Applied Mathematics and Physics, 11, 2318-2342. doi: 10.4236/jamp.2023.118149.

1. Introduction

With the rapid development of computer network technology, computer risks such as hackers, viruses, phishing emails, and other threats to information security are becoming increasingly serious. Computer viruses may damage computer data, occupy computer space and memory resources, damage computer hardware and software, and are known as the “biggest hidden danger of the 21st century”. Understand the essence and characteristics of computer virus transmission, strengthen research on network risk prevention strategies, and ensure information security. Therefore, understanding the nature and characteristics of the spread of computer viruses and strengthening research on network risk prevention strategies can help ensure network information security.

There is a high similarity between the transmission process of viruses in the network and the spread of diseases within the population [1] . It leads to more and more scholars constructing computer virus transmission dynamics models based on epidemic compartment models such as SIR models [2] , SIRS models [3] [4] [5] [6] , SLBS models [7] [8] , and then meanwhile a variety of computer virus models have also been built [9] - [15] . In recent years, more experts and scholars have begun to focus their attention on nonresident computer viruses that do not execute themselves from or in computer memory [16] [17] [18] . In [16] , the authors constructed the following nonresident computer virus SLAS epidemiological model in the network:

{ d S ( t ) d t = b μ 1 S ( t ) β 1 S ( t ) L ( t ) β 2 S ( t ) A ( t ) + γ 1 L ( t ) + γ 2 A ( t ) , d L ( t ) d t = β 1 S ( t ) L ( t ) + β 2 S ( t ) A ( t ) + α 2 A ( t ) ( μ 2 + α 1 + γ 1 ) L ( t ) , d A ( t ) d t = α 1 L ( t ) ( μ 3 + α 2 + γ 2 ) A ( t ) . (1)

where S ( t ) represents the numbers of the uninfected computer having no immunity in S class at time t, L ( t ) represents the numbers of infected computers in which viruses are not yet loaded in their memory (latent computers, for short) in L class at time t, A ( t ) represents the numbers of infected computers in which viruses are located in memory (infectious computers, for short) in A class at time t, and μ 1 is the rate of the uninfected computers disconnects from the network. And then, give the following assumptions. First, all newly accessed computers are virus-free. Second, all viruses staying in computers are nonresident. Third, users of latent computers cannot perceive the existence of virus, so latent computers cannot get cured.

The model (1) divides the overall process of virus transmission in a computer into three stages. However, combined with the actual situation, we found that the virus in the latent class into the memory at different times, will lead to its transformation into the infection rate is also different. At the same time, the time of virus infection is different, and the time of computer cure is different. Therefore, based on the above analysis, we make improvements to the model and carry out a specific analysis of the model below.

In fact, nonresident viruses in the latent class of computers are loaded into memory after a period of time before they become infected. Therefore, we use the piecewise function α 1 ( a ) to characterize the rate at which a nonresident virus in a latent computer is loaded into memory to become an infection class computer, that is,

α 1 ( a ) = { α 1 , a > τ 1 , 0 , a τ 1 , (2)

where α 1 ( a ) L + ( ( 0, + ) , ) , α 1 > 0 , a is the length of time the computer stays in the latent compartment, and τ 1 is the minimum time when the latent computers in L class enters in A class. Correspondingly, the outflow of the latent computers in Equation (1) can be rewritten by the partial differential equation as

L ( t , a ) t + L ( t , a ) a = ( μ 2 + α 1 ( a ) + γ 1 ) L ( t , a ) , t 0 , a 0 , (3)

with L ( t , a ) is the density of the latent computers with the latent age a at time t, μ 2 is the rate of the latent computers disconnects from the network, and γ 1 is the recovery rate of latent computers returns to S class.

In addition, it takes time for the infected computers in A class to be cured and become the uninfected computers in S class. Therefore, we use the piecewise function γ 2 ( b ) to characterize the recovery rate of the infected computers, that is,

γ 2 ( b ) = { γ 2 , b > τ 2 , 0 , b τ 2 , (4)

where γ 2 ( b ) L + ( ( 0, + ) , ) , γ 2 > 0 , b refers to the length of time the nonresident virus is in the infection compartment, and τ 2 the maximum time for an infected computer in A class to be cured of being the uninfected computers in S class. Correspondingly, the outflow of the infected computers in the Equation (1) also can be rewritten by the partial differential equation as

A ( t , b ) t + A ( t , b ) b = ( μ 3 + α 2 + γ 2 ( b ) ) A ( t , b ) , t 0 , b 0 , (5)

where A ( t , b ) is the density of the infected computers with the immunity age b at time t, μ 3 is the rate of the infected computers disconnects from the network, α 2 is the rate of return of infected computers in A class to latent computers in L class.

Therefore, we have constructed the computer virus epidemic model with age structure and two delays effects as follows. Where infection age and immunity age refers to the time the computer spent in the infected class compartment and the recovery class compartment, respectively, and is a class age rather than the actual age.

{ d S ( t ) d t = Λ μ 1 S ( t ) β 1 S ( t ) 0 + L ( t , a ) d a β 2 S ( t ) 0 + A ( t , b ) d b + γ 1 0 + L ( t , a ) d a + 0 + γ 2 ( b ) A ( t , b ) d b , L ( t , a ) t + L ( t , a ) a = ( μ 2 + α 1 ( a ) + γ 1 ) L ( t , a ) , A ( t , b ) t + A ( t , b ) b = ( μ 3 + α 2 + γ 2 ( b ) ) A ( t , b ) , L ( t , 0 ) = β 1 S ( t ) 0 + L ( t , a ) d a + β 2 S ( t ) 0 + A ( t , b ) d b + α 2 0 + A ( t , b ) d b , t 0 , A ( t , 0 ) = 0 + α 1 ( a ) L ( t , a ) d a , t 0 , (6)

where the initial condition

S ( 0 ) = S 0 > 0 , L ( 0 , ) = L 0 ( ) L + 1 ( 0 , + ) , A ( 0 , ) = A 0 ( ) L + 1 ( 0 , + ) .

Here, Λ is the external computers are accessed to the Internet at positive constant number, β 1 , β 2 are the nonresident virus transmission rate, It’s worth noting that μ 1 min { μ 2 , μ 3 } .

The overall construction of this paper is as follows. In section 2, we study the non-negativity and the boundedness of the solution of the system. In section 3, we investigate the existence of all the feasible equilibria, including the virus-free equilibrium P 0 and the computer virus equilibrium P * . In section 4, we explore the local stability of the virus-free equilibrium P 0 , and the local stability of the computer virus equilibrium P * when τ 1 = τ 2 = 0 . In section 5, we study the existence of Hopf bifurcation of the system under three different cases, which are 1) τ 1 > 0 and τ 2 = 0 , 2) τ 1 = 0 and τ 2 > 0 , and 3) τ 1 = τ 2 > 0 , respectively. In section 6, we present some numerical examples and conclusions.

2. Preliminaries

In this section, we focus on the non-negativity and consistent boundedness of the system(6) solution under any non-negative initial value condition.

Theorem 1 If ϕ = ( S 0 , L 0 ( ) , A 0 ( ) ) + × L + 1 ( 0, + ) × L + 1 ( 0, + ) , then the solution of the system (6) is non-negative for all t 0 , and it is ultimately bounded for t large enough.

Proof. For any S 0 , A 0 ( ) + × L + 1 , assume that S ( t ) , A ( t , b ) remains non-negative for t 0 . Suppose the assumption does not hold, then the continuity of the solution of the system (6) concerning the initial value shows that the following two cases may occur:

1) There exists a t 1 > 0 such that S ( t ) > 0 and A ( t , b ) > 0 for t [ 0, t 1 ) , A ( t 1 , b ) > 0 , S ( t 1 ) = 0 and S ( t 1 ) < 0 ;

2) There exists a t 2 > 0 such that S ( t ) > 0 and A ( t , b ) > 0 for t [ 0, t 2 ) , S ( t 2 ) > 0 , A ( t 2 , b ) = 0 and A ( t , b ) t | t = t 2 < 0 ;

For case 1), by using of the second and fourth equation of system (6), we can get

L ( t 1 , a ) = { L ( t 1 a , 0 ) e 0 a ( μ 2 + α 1 ( θ ) + γ 1 ) d θ , a t 1 , L 0 ( a t 1 ) e a t 1 a ( μ 2 + α 1 ( θ ) + γ 1 ) d θ , a > t 1 .

Since S ( t 1 a ) > 0 , and A ( t 1 a , b ) > 0 , we can obtain L ( t 1 , a ) 0 . And then, the first equation of system (6) implies that

d S ( t ) d t | t = t 1 = Λ + γ 1 0 + L ( t 1 , a ) d a + 0 + γ 2 ( b ) A ( t 1 , b ) d b > 0 ,

which contradicts with S ( t 1 ) < 0 .

Similarly, for case 2), from the third equation of the system (6) it follows that

A ( t , b ) t | t = t 2 = A ( t 2 , b ) b ( μ 3 + α 2 + γ 2 ( b ) ) A ( t 2 , b ) = 0 ,

which also contradicts with A ( t , b ) t | t = t 2 < 0 . So the assumption is valid.

Based on the above analysis, for any nonnegative initial values S 0 0 , A 0 ( ) 0 , the solution of the system (6) is guaranteed to be S ( t ) 0 , A ( t , b ) 0 , always for all t 0 . We directly integrate the second equation in system (6) along the characteristic line yields that

L ( t , a ) = { L ( t a ,0 ) e 0 a ( μ 2 + α 1 ( θ ) + γ 1 ) d θ , a t , L 0 ( a t ) e a t a ( μ 2 + α 1 ( θ ) + γ 1 ) d θ , a > t .

It is clear that L ( t , a ) remains nonnegative for any t 0 when S ( t ) 0 , A ( t , b ) 0 and L 0 ( ) L + 1 ( 0, + ) .

Next, we prove the boundedness of solution of system (6). To this end, we denote L ¯ ( t ) = 0 + L ( t , a ) d a , and A ¯ ( t ) = 0 + A ( t , b ) d b , which represents the total number of the latent computers and the infectious computers at time t, respectively. Suppose that l i m a + L ( t , a ) = 0 , and l i m b + A ( t , b ) = 0 . It is well known these assumptions are in line with practical biological significance, as the lifespan of computers is limited. Then,

d ( S ( t ) + L ¯ ( t ) + A ¯ ( t ) ) d t = Λ μ 1 S ( t ) μ 2 L ¯ ( t ) μ 3 A ¯ ( t ) β 1 S ( t ) L ¯ ( t ) β 2 S ( t ) A ¯ ( t ) α 2 A ¯ ( t ) l i m a + L ( t , a ) + L ( t , 0 ) 0 + α 1 ( a ) L ( t , a ) d a l i m b + A ( t , b ) + A ( t , 0 ) Λ μ 1 S ( t ) μ 2 L ¯ ( t ) μ 3 A ¯ ( t ) Λ μ 1 ( S ( t ) + L ¯ ( t ) + A ¯ ( t ) ) .

It implies that lim sup t + ( S ( t ) + L ¯ ( t ) + A ¯ ( t ) ) Λ μ 1 . That is, the set

Γ = { ( S , L , A ) + × L + 1 ( ( 0 , + ) , ) × L + 1 ( ( 0 , + ) , ) : S ( t ) + 0 + L ( t , a ) d a + 0 + A ( t , b ) d b Λ μ 1 }

is positively invariant with respect to system (6).

3. The Existence of the Equilibria

In this section can be divided into two main parts, in the first part, we prove the existence of the virus-free equilibrium of the system (6); in the second part, we prove the existence of the computer virus equilibrium and also give an explicit expression for the basic reproduction number of the system (6).

First, a direct calculation shows that there always exists virus-free equilibrium P 0 ( S 0 ,0,0 ) of the system (6), where S 0 = Λ μ 1 .

Next, in the second part, in order to obtain the existence of the system (6) computer virus equilibrium P * ( S * , L * ( a ) , A * ( b ) ) , we need to determine the existence of nonnegative solutions to the following system of equations.

{ Λ μ 1 S β 1 S 0 + L ( a ) d a β 2 S 0 + A ( b ) d b + γ 1 0 + L ( a ) d a + 0 + γ 2 ( b ) A ( b ) d b = 0 , d L ( a ) d a = ( μ 2 + α 1 ( a ) + γ 1 ) L ( a ) , d A ( b ) d b = ( μ 3 + α 2 + γ 2 ( b ) ) A ( b ) , L ( 0 ) = β 1 S 0 + L ( a ) d a + β 2 S 0 + A ( b ) d b + α 2 0 + A ( b ) d b , A ( 0 ) = 0 + α 1 ( a ) L ( a ) d a . (7)

The second of Equation (7) implies that

L ( a ) = L ( 0 ) e 0 a ( μ 2 + α 1 ( θ ) + γ 1 ) d θ , (8)

Further from the combination of the third and fifth equations of the system of Equation (7) we can obtain

A ( b ) = e 0 b ( μ 3 + α 2 + γ 2 ( ϑ ) ) d ϑ 0 + α 1 ( a ) L ( a ) d a = L ( 0 ) e 0 b ( μ 3 + α 2 + γ 2 ( ϑ ) ) d ϑ 0 + α 1 ( a ) e 0 a ( μ 2 + α 1 ( θ ) + γ 1 ) d θ d a . (9)

Substituting Equation (8) and Equation (9) into the forth equation in Equation (7), we get

S = M 1 ( τ 1 , τ 2 ) M 2 ( τ 1 , τ 2 ) = Λ μ 1 R 0 ( τ 1 , τ 2 ) (10)

with

M 1 ( τ 1 , τ 2 ) = 1 α 2 0 + e 0 b ( μ 3 + α 2 + γ 2 ( ϑ ) ) d ϑ d b 0 + α 1 ( a ) e 0 a ( μ 2 + α 1 ( θ ) + γ 1 ) d θ d a = 1 α 2 e γ 2 τ 2 μ 3 + α 2 + γ 2 × α 2 e ( μ 2 + γ 1 ) τ 1 μ 2 + α 1 + γ 1 ,

M 2 ( τ 1 , τ 2 ) = β 2 0 + e 0 b ( μ 3 + α 2 + γ 2 ( ϑ ) ) d ϑ d b 0 + α 1 ( a ) e 0 a ( μ 2 + α 1 ( θ ) + γ 1 ) d θ d a + β 1 0 + e 0 a ( μ 2 + α 1 ( θ ) + γ 1 ) d θ d a = β 1 × e α 1 τ 1 μ 2 + α 1 + γ 1 + β 2 × e γ 2 τ 2 μ 3 + α 2 + γ 2 × α 2 e ( μ 2 + γ 1 ) τ 1 μ 2 + α 1 + γ 1 ,

R 0 ( τ 1 , τ 2 ) = Λ μ 1 M 2 ( τ 1 , τ 2 ) M 1 ( τ 1 , τ 2 ) .

Substituting Equation (8), Equation (9) and Equation (10), into the first equation in Equation (7), we get

L ( 0 ) = Λ μ 1 S M 3 ( τ 1 , τ 2 ) = μ 1 S M 3 ( τ 1 , τ 2 ) ( R 0 ( τ 1 , τ 2 ) 1 )

with

M 3 ( τ 1 , τ 2 ) = 1 γ 1 e α 1 τ 1 μ 2 + α 1 + γ 1 α 2 e ( μ 2 + γ 1 ) τ 1 μ 2 + α 1 + γ 1 [ α 2 e γ 2 τ 2 μ 3 + α 2 + γ 2 + γ 2 e ( μ 3 + γ 2 ) τ 2 μ 3 + α 2 + γ 2 ] .

It is clear that R 0 ( τ 1 , τ 2 ) > 1 and M 3 ( τ 1 , τ 2 ) > 0 can ensure L ( 0 ) > 0 . That is, system (6) exists the computer virus equilibrium P * ( S * , L * ( a ) , A * ( b ) ) , where

S * = Λ μ 1 R 0 ( τ 1 , τ 2 ) , L * ( 0 ) = μ 1 S * M 3 ( τ 1 , τ 2 ) ( R 0 ( τ 1 , τ 2 ) 1 ) ,

L * ( a ) = L * ( 0 ) e 0 a ( μ 2 + α 1 ( θ ) + γ 1 ) d θ ,

A * ( b ) = L * ( 0 ) e 0 b ( μ 3 + α 2 + γ 2 ( ϑ ) ) d ϑ 0 + α 1 ( a ) e 0 a ( μ 2 + α 1 ( θ ) + γ 1 ) d θ d a .

Theorem 2. For the system (6), there always exists the virus-free equilibrium P 0 , and when R 0 ( τ 1 , τ 2 ) > 1 and M 3 ( τ 1 , τ 2 ) > 0 , it exists the computer virus equilibrium P * .

4. The Stability of the Equilibria

In this section, we focus on the stability of the virus-free equilibrium P 0 and the computer virus equilibrium P * of the system (6).

4.1. The Stability of the Virus-Free Equilibrium

Theorem 3. When R 0 ( τ 1 , τ 2 ) < 1 , the virus-free equilibrium P 0 of the system (6) is locally asymptotically stable, and P 0 is unstable when R 0 ( τ 1 , τ 2 ) > 1 .

Proof. By linearizing system (6) at virus-free equilibrium P 0 , we can obtain the characteristic equation as follows:

( λ + μ 1 ) [ 1 β 1 S 0 0 + e 0 a ( λ + μ 2 + α 1 ( θ ) + γ 1 ) d θ d a ( β 2 S 0 + α 2 ) 0 + e 0 b ( λ + μ 3 + α 2 + γ 2 ( ϑ ) ) d ϑ d b 0 + α 1 ( a ) e 0 a ( λ + μ 2 + α 1 ( θ ) + γ 1 ) d θ d a ] = 0. (11)

Obviously, λ 1 = μ 1 is a root of Equation (11). And, the remaining characteristic roots of the characteristic Equation (11) must satisfy the following equation:

Δ 1 ( λ ) = 1 β 1 S 0 0 + e 0 a ( λ + μ 2 + α 1 ( θ ) + γ 1 ) d θ d a ( β 2 S 0 + α 2 ) 0 + e 0 b ( λ + μ 3 + α 2 + γ 2 ( ϑ ) ) d ϑ d b 0 + α 1 ( a ) e 0 a ( λ + μ 2 + α 1 ( θ ) + γ 1 ) d θ d a = 0. (12)

When λ , it is clear that Δ 1 ( λ ) = 0 is a continuous strictly monotonically increasing real-valued function on λ , and satisfies

Δ 1 ( 0 ) = M 1 ( τ 1 , τ 2 ) ( 1 R 0 ( τ 1 , τ 2 ) ) , lim λ + Δ 1 ( λ ) = 1.

It implies that Δ 1 ( λ ) = 0 has at least one positive real root when R 0 ( τ 1 , τ 2 ) > 1 , that is, P 0 is unstable. Obviously, Δ 1 ( λ ) = 0 does not have a positive real root when R 0 ( τ 1 , τ 2 ) < 1 . We assert that Δ 1 ( λ ) = 0 also does not have the complex roots with the real part greater than 0. Otherwise, suppose λ ¯ = α + i β ( α 0 ) is an arbitrary complex root of Δ 1 ( λ ) = 0 . Therefore,

0 = | Δ 1 ( λ ¯ ) | = Δ 1 ( α ) Δ 1 ( 0 ) = M 1 ( τ 1 , τ 2 ) ( 1 R 0 ( τ 1 , τ 2 ) ) > 0 ,

which is clearly contradictory. That is, the real parts of the roots of Δ 1 ( λ ) = 0 all are less than 0.

In summary, when R 0 ( τ 1 , τ 2 ) < 1 , the virus-free equilibrium P 0 is locally asymptotically stable.

4.2. The Stability of the Computer Virus Equilibrium

In this subsection, we discuss stability of the computer virus equilibrium P * of system (6) in the case where R 0 ( τ 1 , τ 2 ) > 1 and M 3 ( τ 1 , τ 2 ) > 0 .

By direct calculation, we can obtain the characteristic equation of system (6) at P * as follows:

f ( λ , τ 1 , τ 2 ) = λ 3 + A 2 ( τ 1 , τ 2 ) λ 2 + A 1 ( τ 1 , τ 2 ) λ + A 0 ( τ 1 , τ 2 ) + B 0 ( τ 1 , τ 2 ) e λ ( τ 1 + τ 2 ) + ( C 1 ( τ 1 , τ 2 ) λ + C 0 ( τ 1 , τ 2 ) ) e λ τ 1 = 0 , (13)

where

A 2 ( τ 1 , τ 2 ) = μ 1 + β 1 0 + L * ( a ) d a + β 2 0 + A * ( b ) d b + μ 2 + α 1 + γ 1 β 1 S * e α 1 τ 1 + μ 3 + α 2 + γ 2 ,

A 1 ( τ 1 , τ 2 ) = ( μ 1 + β 1 0 + L * ( a ) d a + β 2 0 + A * ( b ) d b ) [ μ 2 + α 1 + γ 1 β 1 S * e α 1 τ 1 + μ 3 + α 2 + γ 2 ] + ( μ 2 + α 1 + γ 1 β 1 S * e α 1 τ 1 ) ( μ 3 + α 2 + γ 2 ) + ( β 1 0 + L * ( a ) d a + β 2 0 + A * ( b ) d b ) ( β 1 S * γ 1 ) e α 1 τ 1

A 0 ( τ 1 , τ 2 ) = ( μ 1 + β 1 0 + L * ( a ) d a + β 2 0 + A * ( b ) d b ) ( μ 2 + α 1 + γ 1 β 1 S * e α 1 τ 1 ) × ( μ 3 + α 2 + γ 2 ) + ( μ 3 + α 2 + γ 2 ) ( β 1 0 + L * ( a ) d a + β 2 0 + A * ( b ) d b ) × ( β 1 S * γ 1 ) e α 1 τ 1 ,

B 0 ( τ 1 , τ 2 ) = α 1 γ 2 e ( μ 2 + γ 1 ) τ 1 ( μ 3 + α 2 ) τ 2 ( β 1 0 + L * ( a ) d a + β 2 0 + A * ( b ) d b ) ,

C 1 ( τ 1 , τ 2 ) = α 1 ( β 2 S * + α 2 ) e γ 2 τ 2 ( μ 2 + γ 1 ) τ 1 ,

C 0 ( τ 1 , τ 2 ) = μ 1 α 1 β 2 S * e γ 2 τ 2 ( μ 2 + γ 1 ) τ 1 α 1 α 2 e γ 2 τ 2 ( μ 2 + γ 1 ) τ 1 × ( μ 1 + β 1 0 + L * ( a ) d a + β 2 0 + A * ( b ) d b ) .

Theorem 4. Suppose R 0 ( 0 , 0 ) > 1 , and M 3 ( 0 , 0 ) > 0 . Then the computer virus equilibrium P * of the system (6) is locally asymptotically stable.

Proof. When τ 1 = τ 2 = 0 , Equation (13) can be rewritten as

f ( λ , 0 , 0 ) = λ 3 + A 2 ( 0 , 0 ) λ 2 + ( A 1 ( 0 , 0 ) + C 1 ( 0 , 0 ) ) λ + A 0 ( 0 , 0 ) + B 0 ( 0 , 0 ) + C 0 ( 0 , 0 ) = 0.

At this time,

μ 2 + α 1 + γ 1 β 1 S * = μ 2 + α 1 + γ 1 β 1 μ 2 + α 1 + γ 1 α 1 α 2 μ 3 + α 2 + γ 2 β 1 + β 2 α 1 μ 3 + α 2 + γ 2 = 1 β 1 + β 2 α 1 μ 3 + α 2 + γ 2 × 1 μ 3 + α 2 + γ 2 × [ α 1 α 2 β 1 + β 2 α 1 ( μ 2 + α 1 + γ 1 ) ] > 0.

It is clear that A 2 ( 0 , 0 ) > 0 .

Next,

A 1 ( 0 , 0 ) + C 1 ( 0 , 0 ) = ( β 1 0 + L * ( a ) d a + β 2 0 + A * ( b ) d b ) ( μ 2 + α 1 + μ 3 + α 2 + γ 2 ) + μ 2 ( μ 2 + α 1 + γ 1 β 1 S * + μ 3 + α 2 + γ 2 ) > 0 ,

A 0 ( 0 , 0 ) + B 0 ( 0 , 0 ) + C 0 ( 0 , 0 ) = ( β 1 0 + L * ( a ) d a + β 2 0 + A * ( b ) d b ) [ μ 2 ( μ 3 + α 2 + γ 2 ) + α 1 μ 2 ] > 0 ,

where

0 + L * ( a ) d a = μ 1 μ 2 + α 1 μ 3 μ 3 + α 2 + γ 2 × μ 2 + α 1 + γ 1 α 1 α 2 μ 3 + α 2 + γ 2 β 1 + β 2 α 1 μ 3 + α 2 + γ 2 × ( R 0 ( 0 , 0 ) 1 ) ,

0 + A * ( b ) d b = α 1 μ 1 μ 2 ( μ 3 + α 2 + γ 2 ) + α 1 μ 3 × μ 2 + α 1 + γ 1 α 1 α 2 μ 3 + α 2 + γ 2 β 1 + β 2 α 1 μ 3 + α 2 + γ 2 × ( R 0 ( 0 , 0 ) 1 ) .

Furthermore,

( A 1 ( 0 , 0 ) + C 1 ( 0 , 0 ) ) A 2 ( 0 , 0 ) ( A 0 ( 0 , 0 ) + B 0 ( 0 , 0 ) + C 0 ( 0 , 0 ) ) = ( β 1 0 + L * ( a ) d a + β 2 0 + A * ( b ) d b ) 2 ( μ 2 + α 1 + μ 3 + α 2 + γ 2 ) + ( β 1 0 + L * ( a ) d a + β 2 0 + A * ( b ) d b ) [ ( μ 2 + α 1 + γ 1 β 1 S * + μ 3 + α 2 + γ 2 ) ( 2 μ 2 + α 1 + μ 3 + α 2 + γ 2 ) + μ 1 ( μ 2 + α 1 + μ 3 + α 2 + γ 2 )

α 1 μ 3 μ 2 ( μ 3 + α 2 + γ 2 ) ] + μ 2 ( μ 2 + α 1 + γ 1 β 1 S * + μ 3 + α 2 + γ 2 ) × ( μ 2 + α 1 + γ 1 β 1 S * + μ 3 + α 2 + γ 2 + μ 1 ) > 0.

The Rausch-Helwitz criterion implies that the real part of the roots of f ( λ ,0,0 ) = 0 are all negative. It implies that the computer virus equilibrium state P * of the system (6) is locally asymptotically stable.

5. Hopf Bifurcation

In this section, we will explore the dynamic behaviors of system (6) in three different cases, including 1) τ 1 > 0 , τ 2 = 0 ; 2) τ 1 = 0 , τ 2 > 0 ; and 3) τ 1 = τ 2 = τ > 0 , respectively. When an unstable computer virus equilibrium occurs in the system (6), at this point P * bifurcates and thus changes from unstable to stable. In other words, the system transitions from one stable state to another with periodic oscillations.

Case.1 In the case where τ 1 > 0 , and τ 2 = 0 .

We will use the method in Section 2 of [19] to discuss the existence of Hopf bifurcation. To this end, Equation (13) can be rewritten as

P ( λ , τ 1 ) + Q ( λ , τ 1 ) e λ τ 1 = 0. (14)

where

P ( λ , τ 1 ) = λ 3 + A 2 ( τ 1 , 0 ) λ 2 + A 1 ( τ 1 , 0 ) λ + A 0 ( τ 1 , 0 ) , Q ( λ , τ 1 ) = C 1 ( τ 1 , 0 ) λ + C 0 ( τ 1 , 0 ) + B 0 ( τ 1 , 0 ) ,

and the following hypotheses need to be justified:

1) P ( 0, τ 1 ) + Q ( 0, τ 1 ) 0 ;

2) P ( i ω , τ 1 ) + Q ( i ω , τ 1 ) 0 ;

3) lim sup { | Q P | : | λ | , Re λ 0 } < 1 , τ 1 R + ;

4) F ( ω , τ 1 ) = | P ( i ω , τ 1 ) | 2 | Q ( i ω , τ 1 ) | 2 ;

5) Each positive roots ω ( τ 1 ) of F ( ω , τ 1 ) = 0 is continuous and differentiable in τ 1 whenever it exists.

The rigorous calculations can help us obtain

P ( 0 , τ 1 ) + Q ( 0 , τ 1 ) = [ β 1 e α 1 τ 1 ( μ 3 + α 2 + γ 2 ) + β 2 α 1 e ( μ 2 + γ 1 ) τ 1 ] μ 1 S * ( R 0 ( τ 1 , 0 ) 1 ) > 0 ,

P ( i ω , τ 1 ) + Q ( i ω , τ 1 ) = A 2 ( τ 1 , 0 ) ω 2 + i ω [ A 1 ( τ 1 , 0 ) + C 1 ( τ 1 , 0 ) ω 2 ] + A 0 ( τ 1 , 0 ) + B 0 ( τ 1 , 0 ) + C 0 ( τ 1 , 0 ) 0 ,

l i m | λ | | Q ( λ , τ 1 ) P ( λ , τ 1 ) | = l i m | λ | | C 1 ( τ 1 , 0 ) λ + C 0 ( τ 1 , 0 ) + B 0 ( τ 1 , 0 ) λ 3 + A 2 ( τ 1 , 0 ) λ 2 + A 1 ( τ 1 , 0 ) λ + A 0 ( τ 1 , 0 ) | = 0.

It is clear that the above conditions 1), 2), and 3) are satisfied. Since

| P ( i ω , τ 1 ) | 2 = ω 6 + [ A 2 2 ( τ 1 , 0 ) 2 A 1 ( τ 1 , 0 ) ] ω 4 + [ A 1 2 ( τ 1 , 0 ) 2 A 2 ( τ 1 , 0 ) A 0 ( τ 1 , 0 ) ] ω 2 + A 0 2 ( τ 1 , 0 ) ,

| Q ( i ω , τ 1 ) | 2 = C 1 2 ( τ 1 , 0 ) ω 2 + ( B 0 ( τ 1 , 0 ) + C 0 ( τ 1 , 0 ) ) 2 ,

we can get

F ( ω , τ 1 ) = ω 6 + ( A 2 2 ( τ 1 , 0 ) 2 A 1 ( τ 1 , 0 ) ) ω 4 + ( A 1 2 ( τ 1 , 0 ) 2 A 2 ( τ 1 , 0 ) A 0 ( τ 1 , 0 ) C 1 2 ( τ 1 , 0 ) ) ω 2 + A 0 2 ( τ 1 , 0 ) ( B 0 ( τ 1 , 0 ) + C 0 ( τ 1 , 0 ) ) 2 . (15)

It means that condition 4) holds. Furthermore, since both A i ( τ 1 , 0 ) ( i = 0 , 1 , 2 ) , B 0 ( τ 1 ,0 ) and C j ( τ 1 , 0 ) ( j = 0 , 1 ) are continuous differentiable functions with respect to τ 1 the implicit function theorem ensures condition 5) also satisfied.

Let λ = i ω ( ω > 0 ) be a pure imaginary root of Equation (14), then

i ω 3 A 2 ( τ 1 ,0 ) ω 2 + A 1 ( τ 1 ,0 ) i ω + A 0 ( τ 1 ,0 ) + [ C 1 ( τ 1 ,0 ) i ω + C 0 ( τ 1 ,0 ) + B 0 ( τ 1 ,0 ) ] [ cos ω τ 1 i sin ω τ 1 ] = 0. (16)

And then, let Θ = ω 2 , then Equation (15) can be rewritten as

Q ( Θ ) : = Θ 3 + q 2 ( τ 1 ) Θ 2 + q 1 ( τ 1 ) Θ + q 0 ( τ 1 ) , (17)

where

q 2 ( τ 1 ) = A 2 2 ( τ 1 , 0 ) 2 A 1 ( τ 1 , 0 ) , q 1 ( τ 1 ) = A 1 2 ( τ 1 , 0 ) 2 A 2 ( τ 1 , 0 ) A 0 ( τ 1 , 0 ) C 1 2 ( τ 1 , 0 ) , q 0 ( τ 1 ) = A 0 2 ( τ 1 , 0 ) ( B 0 ( τ 1 , 0 ) + C 0 ( τ 1 , 0 ) ) 2 ,

and M 3 ( τ 1 , 0 ) > 0 ensures q 0 ( τ 1 ) > 0 holds. Since the existence of pure imaginary root of Equation (15) is equivalent to the existence of the positive root of Equation (17), we first discuss the existence of the positive root of Q ( Θ ) = 0 .

Let Q ( Θ ) = 3 Θ 2 + 2 q 2 ( τ 1 ) Θ + q 1 ( τ 1 ) . On the one hand, if q 2 2 ( τ 1 ) 3 q 1 ( τ 1 ) < 0 , then Q ( Θ ) = 0 has no real root; on the other hand, if q 2 2 ( τ 1 ) 3 q 1 ( τ 1 ) 0 , then Q ( Θ ) = 0 at least has one real root, in which Θ 2 is a bigger root. Therefore, the following lemma gives the existence of the positive root of Q ( Θ ) = 0 .

Lemma 5. 1) If q 2 2 ( τ 1 ) 3 q 1 ( τ 1 ) < 0 , then Q ( Θ ) = 0 has no positive root; 2) if q 2 2 ( τ 1 ) 3 q 1 ( τ 1 ) 0 , and Θ 2 0 , then Q ( Θ ) = 0 has no positive root; 3) if q 2 2 ( τ 1 ) 3 q 1 ( τ 1 ) 0 , Θ 2 > 0 , and Q ( Θ 2 ) > 0 , then Q ( Θ ) = 0 has no positive root; 4) if q 2 2 ( τ 1 ) 3 q 1 ( τ 1 ) 0 , Θ 2 > 0 , and Q ( Θ 2 ) 0 , then Q ( Θ ) = 0 has the positive roots.

If Equation (17) has no positive roots, then the stability of the computer virus equilibrium P * does not change as τ 1 increases. Conversely, if there exists the positive root in Equation (17), the stability of the computer virus equilibrium P * may change when τ 1 reaches some critical value τ 1 * . At this point, Hopf bifurcation may appear in the system. In summary, we have the following conclusions:

Theorem 6. Suppose than R 0 ( τ 1 , 0 ) > 1 , M 3 ( τ 1 , 0 ) > 0 , and τ 1 > 0 hold. 1) If q 2 2 ( τ 1 ) 3 q 1 ( τ 1 ) < 0 , then the computer virus equilibrium P * of system (6) is locally asymptotically stable; 2) if q 2 2 ( τ 1 ) 3 q 1 ( τ 1 ) 0 , and Θ 2 0 , then the computer virus equilibrium P * of system (6) is locally asymptotically stable; 3) if q 2 2 ( τ 1 ) 3 q 1 ( τ 1 ) 0 , Θ 2 > 0 , and Q ( Θ 2 ) > 0 , then the computer virus equilibrium P * of system (6) is locally asymptotically stable.

Next, we judge the Hopf bifurcation of the system. If Q ( Θ ) = 0 has a positive root, then the stability of the computer virus equilibrium P * may change when τ 1 passes through some specific values. Let us consider whether the stability of the positive equilibrium changes when Q ( Θ ) = 0 has one positive root. In the case where Q ( Θ ) = 0 has two positive roots, the analysis is similar.

Let Θ * be the positive root of Q ( Θ ) = 0 , that is, ω ( τ 1 * ) = Θ * is the positive real root of F ( ω , τ 1 ) = 0 . Then, we define a set by

Σ = { τ 1 > 0 : q 2 2 ( τ 1 ) 3 q 1 ( τ 1 ) 0 , Θ 2 > 0 , Q ( Θ 2 ) 0 } .

That is, for τ 1 Σ , there exists ω = ω ( τ 1 ) > 0 such that F ( ω , τ 1 ) = 0 .

Separating the real part and the imaginary part from Equation (16)

ω 3 + A 1 ( τ 1 , 0 ) ω = ( B 0 ( τ 1 , 0 ) + C 0 ( τ 1 , 0 ) ) sin ω τ 1 C 1 ( τ 1 , 0 ) ω cos ω τ 1 , A 2 ( τ 1 , 0 ) ω 2 A 0 ( τ 1 , 0 ) = ( B 0 ( τ 1 , 0 ) + C 0 ( τ 1 , 0 ) ) cos ω τ 1 + C 1 ( τ 1 , 0 ) ω cos ω τ 1 .

Let θ ( τ 1 ) ( 0,2 π ] ( τ 1 Σ ) be a solution of the following equations:

cos θ ( τ 1 ) = C 1 ( τ 1 , 0 ) ω 4 + [ A 2 ( τ 1 , 0 ) ( B 0 ( τ 1 , 0 ) + C 0 ( τ 1 , 0 ) ) A 1 ( τ 1 , 0 ) C 1 ( τ 1 , 0 ) ] ω 2 C 1 2 ( τ 1 , 0 ) ω 2 + ( B 0 ( τ 1 , 0 ) + C 0 ( τ 1 , 0 ) ) 2 A 0 ( τ 1 , 0 ) ( B 0 ( τ 1 , 0 ) + C 0 ( τ 1 , 0 ) ) C 1 2 ( τ 1 , 0 ) ω 2 + ( B 0 ( τ 1 , 0 ) + C 0 ( τ 1 , 0 ) ) 2 ,

sin θ ( τ 1 ) = [ A 1 ( τ 1 , 0 ) ( B 0 ( τ 1 , 0 ) + C 0 ( τ 1 , 0 ) ) A 0 ( τ 1 , 0 ) C 1 ( τ 1 , 0 ) ] ω C 1 2 ( τ 1 , 0 ) ω 2 + ( B 0 ( τ 1 , 0 ) + C 0 ( τ 1 , 0 ) ) 2 + [ A 2 ( τ 1 , 0 ) C 1 ( τ 1 , 0 ) B 0 ( τ 1 , 0 ) C 0 ( τ 1 , 0 ) ] ω 3 C 1 2 ( τ 1 , 0 ) ω 2 + ( B 0 ( τ 1 , 0 ) + C 0 ( τ 1 , 0 ) ) 2

We conclude that ω ( τ 1 ) τ 1 = θ ( τ 1 ) + 2 n π . Hence, ω * = ω ( τ 1 * ) ( ω * > 0 ) is a purely imaginary root of Equation (14) if and only if τ 1 * is a zero of C n ( τ 1 ) for some n , which is defined by

C n ( τ 1 ) = τ 1 θ ( τ 1 ) + 2 n π ω ( τ 1 ) , τ 1 Σ , n .

Theorem 2.2 in [19] implies that the following lemma is true.

Lemma 7. ( [19] ): Assume that ω ( τ 1 ) is a positive real root of F ( ω , τ 1 ) = 0 for τ 1 Σ , and at some τ 1 * Σ ,

C n ( τ 1 * ) = 0, forsome n .

Then a pair of simple conjugate pure imaginary roots λ + ( τ 1 * ) = + i ω ( τ 1 * ) , and λ ( τ 1 * ) = i ω ( τ 1 * ) of the characteristic Equation (14) exists at τ = τ 1 * which crosses the imaginary axis from left to right if H ( τ 1 * ) > 0 and crosses the imaginary axis from right to left if H ( τ 1 * ) < 0 , where

H ( τ 1 * ) = s i g n { d R e ( λ ) d τ 1 | λ = i ω ( τ 1 * ) } = s i g n { F ω ( ω ( τ 1 * ) , τ 1 * ) } s i g n { d C n ( τ 1 ) d τ 1 | τ 1 = τ 1 * } .

Therefore

H ( τ 1 * ) = s i g n { d R e ( λ ) d τ 1 | λ = i ω ( τ 1 * ) } = s i g n { Q ( Θ * ) } s i g n { d C n ( τ 1 ) d τ 1 | τ 1 = τ 1 * } ,

that means the transversality condition holds. So a Hopf bifurcation occurs when Q ( Θ * ) 0 and τ 1 = τ 1 * , and the following conclusion is obtained according to the Hopf bifurcation theorem.

Theorem 8. Suppose R 0 ( τ 1 , 0 ) > 1 , M 3 ( τ 1 , 0 ) > 0 , and Q ( Θ ) 0 . If q 2 2 ( τ 1 ) 3 q 1 ( τ 1 ) 0 , Θ 2 > 0 , and Q ( Θ 2 ) 0 , then the network virus equilibrium P * of system (6) is locally asymptotically stable for τ 2 [ 0, τ 2 * ) , and the system (6) undergoes a Hopf bifurcation at the network virus equilibrium P * when τ 2 = τ 2 * .

Case.2 In the case where τ 1 = 0 , τ 2 > 0 .

When τ 1 = 0 and τ 2 > 0 , using the same approach to prove the stability analysis of the computer virus equilibrium P * and the occurrence of Hopf bifurcation as τ 2 increases. To this end, Equation (13) can be rewritten as

P ( λ , τ 2 ) + Q ( λ , τ 2 ) e λ τ 2 = 0. (18)

where

P ( λ , τ 1 ) = λ 3 + A 2 ( 0 , τ 2 ) λ 2 + ( A 1 ( 0 , τ 2 ) + C 1 ( 0 , τ 2 ) ) λ + A 0 ( 0 , τ 2 ) + B 0 ( 0 , τ 2 ) , Q ( λ , τ 1 ) = B 0 ( 0 , τ 2 ) ,

and then

q 2 ( τ 2 ) = A 2 2 ( 0 , τ 2 ) 2 ( A 1 ( 0 , τ 2 ) + C 1 ( 0 , τ 2 ) ) , q 1 ( τ 2 ) = ( A 1 ( 0 , τ 2 ) + C 1 ( 0 , τ 2 ) ) 2 2 A 2 ( 0 , τ 2 ) ( A 0 ( 0 , τ 2 ) + C 0 ( 0 , τ 2 ) ) , q 0 ( τ 2 ) = ( A 0 ( 0 , τ 2 ) + C 0 ( 0 , τ 2 ) ) 2 B 0 2 ( 0 , τ 2 ) .

Unlike in case 1, there exists q 0 ( τ 2 ) < 0 which means that Q ( Θ ) = 0 has a positive real root, and the system (6) also generates a Hopf bifurcation. In summary, we have the following conclusions:

Theorem 9. Suppose than R 0 ( 0 , τ 2 ) > 1 , M 3 ( 0 , τ 2 ) > 0 , and τ 2 > 0 hold. 1) If q 2 2 ( τ 2 ) 3 q 1 ( τ 2 ) < 0 , then the computer virus equilibrium P * of system (6) is locally asymptotically stable; 2) if q 2 2 ( τ 2 ) 3 q 1 ( τ 2 ) 0 , and Θ 2 0 , then the computer virus equilibrium P * of system (6) is locally asymptotically stable; 3) if q 2 2 ( τ 2 ) 3 q 1 ( τ 2 ) 0 , Θ 2 > 0 , and Q ( Θ 2 ) > 0 , then the computer virus equilibrium P * of system (6) is locally asymptotically stable.

And the following conclusion is about the Hopf bifurcation.

Theorem 10. Suppose R 0 ( 0 , τ 2 ) > 1 , M 3 ( 0 , τ 2 ) > 0 and τ 2 > 0 holds. If q 0 ( τ 2 ) < 0 , or q 0 ( τ 2 ) > 0 , q 2 2 ( τ 2 ) 3 q 1 ( τ 2 ) 0 , Θ 2 > 0 , and Q ( Θ 2 ) 0 , then the computer virus equilibrium P * of system (6) is locally asymptotically stable for τ 2 [ 0, τ 2 * ) , and the system (6) undergoes a Hopf bifurcation at the computer virus equilibrium P * when τ 2 = τ 2 * .

Case.3 In the case where τ 1 = τ 2 = τ > 0 .

The characteristic Equation (13) is rewritten as the transcendental equation

D ( λ , τ ) : = P 0 ( λ , τ ) + P 1 ( λ , τ ) e λ τ + P 2 ( λ , τ ) e 2 λ τ = 0 , (19)

where τ + , and

P 0 ( λ , τ ) = λ 3 + A 2 ( τ ) λ 2 + A 1 ( τ ) λ + A 0 ( τ ) , P 1 ( λ , τ ) = C 1 ( τ ) λ + C 0 ( τ ) , P 2 ( λ , τ ) = B 0 ( τ ) .

When P l ( λ , τ ) ( l = 0 , 1 , 2 ) are independent of the delay τ . Following Section 2 in [20] , we need to justify the following hypotheses:

1) deg ( P 0 ( λ , τ ) ) max { deg ( P 1 ( λ , τ ) ) , deg ( P 2 ( λ , τ ) ) } ;

2) P 2 ( 0, τ ) + P 1 ( 0, τ ) + P 0 ( 0, τ ) 0 ;

3) The polynomials P l ( λ , τ ) , l = 0 , 1 , 2 have no common factor;

4) l i m R e λ 0 | λ | + sup ( | P 1 ( λ , τ ) P 0 ( λ , τ ) | + | P 2 ( λ , τ ) P 0 ( λ , τ ) | ) < 1 ;

5) P l ( i ω , τ ) 0 , l = 0,1,2 ;

6) For any ω + , at least one of | P l ( i ω , τ ) | , l = 0 , 1 , 2 tends to + as τ .

The conditions 1) and 3) apparently established. Through a tedious manipulation, we can derive that

P 2 ( 0 , τ ) + P 1 ( 0 , τ ) + P 0 ( 0 , τ ) = A 0 ( τ ) + B 0 ( τ ) + C 0 ( τ ) = [ ( μ 3 + α 2 + γ 2 ) ( μ 2 + α 1 + γ 1 γ 1 e α 1 τ ) α 1 e ( μ 2 + γ 1 ) τ ( α 2 e γ 2 τ + γ 2 e ( μ 3 + γ 2 ) τ ) ] ( β 1 0 + L * ( a ) d a + β 2 0 + A * ( b ) d b ) 0 ,

l i m R e λ 0 | λ | + ( | P 1 ( λ , τ ) P 0 ( λ , τ ) | + | P 2 ( λ , τ ) P 0 ( λ , τ ) | ) = l i m R e λ 0 | λ | + ( | C 1 ( τ ) λ + C 0 ( τ ) λ 3 + A 2 ( τ ) λ 2 + A 1 ( τ ) λ + A 0 ( τ ) | ) + l i m R e λ 0 | λ | + ( | B 0 ( τ ) λ 3 + A 2 ( τ ) λ 2 + A 1 ( τ ) λ + A 0 ( τ ) | ) = 0 < 1 ,

P 0 ( i ω , τ ) = i ω 3 A 2 ( τ ) ω 2 + A 1 ( τ ) i ω + A 0 ( τ ) 0 ,

P 1 ( i ω , τ ) = C 1 ( τ ) i ω + C 0 ( τ ) 0 ,

P 2 ( i ω , τ ) = B 0 ( τ ) 0 ,

which implies that the above conditions 2), 4) and 5) are satisfied. Noting that

| P 0 ( i ω , τ ) | 2 = ω 6 + ( A 2 2 ( τ ) 2 A 1 ( τ ) ) ω 4 + ( A 1 2 ( τ ) 2 A 0 ( τ ) A 2 ( τ ) ) ω 2 + A 0 2 ( τ ) ,

| P 1 ( i ω , τ ) | 2 = C 1 2 ( τ ) ω 2 + C 0 2 ( τ ) ,

| P 2 ( i ω , τ ) | 2 = B 0 2 ( τ ) = [ α 1 γ 2 e ( μ 2 + γ 1 ) τ ( μ 3 + α 2 ) τ ( β 1 0 + L * ( a ) d a + β 2 0 + A * ( b ) d b ) ] 2 .

When τ , we can get | P 2 ( i ω , τ ) | + . Obviously, 6) also satisfies.

In the following, we search the points τ + such that λ = i ω ( ω > 0 ) is a zero of Equation (19). Let

a 1 ( ω , τ ) = P 1 ( i ω , τ ) P 0 ( i ω , τ ) , a 2 ( ω , τ ) = P 2 ( i ω , τ ) P 0 ( i ω , τ ) .

Then, ( i ω , τ ) is zero of Equation (19), if and only if

D ( ω , τ ) 1 + a 1 ( ω , τ ) e i ω τ + a 2 ( ω , τ ) e i ω 2 τ = 0. (20)

Suppose that ( i ω , τ ) is the zero of Equation (19), Then the 3 parts 1, a 1 ( ω , τ ) e i ω τ , and a 2 ( ω , τ ) e i ω 2 τ on the right side of the above equation must be connected and form a triangle in the complex plane, as shown in Figure 1. Therefore, we can obtain the feasible region of ( ω , τ ) in the following lemma.

Lemma 11. For R 0 ( τ , τ ) > 1 , and M 3 ( τ , τ ) > 0 holds, the feasible region Ω for ( ω , τ ) , such that 1, | a 1 ( ω , τ ) | and | a 2 ( ω , τ ) | create a triangle, is

Ω = { ( ω , τ ) + × + : H 1 0, H 2 0 }

where

H 1 = ω 6 + F 1 ( τ ) ω 4 + F 2 ( τ ) ω 2 + F 31 ( τ ) ω + F 41 ( τ ) , H 2 = ω 6 + F 1 ( τ ) ω 4 + F 2 ( τ ) ω 2 F 32 ( τ ) ω + F 42 ( τ ) ,

at the same time

F 1 ( τ ) = A 2 2 ( τ ) 2 A 1 ( τ ) ,

F 2 ( τ ) = A 1 2 ( τ ) 2 A 0 ( τ ) A 2 ( τ ) B 0 2 ( τ ) N 1 2 ( τ ) ,

F 31 ( τ ) = 2 N 1 ( τ ) B 0 2 ( τ ) ( 1 N 2 ( τ ) ) ,

F 32 ( τ ) = 2 N 1 ( τ ) B 0 2 ( τ ) ( 1 + N 2 ( τ ) ) ,

F 41 ( τ ) = A 0 2 ( τ ) B 0 2 ( τ ) ( 1 N 2 ( τ ) ) 2 ,

F 42 ( τ ) = A 0 2 ( τ ) B 0 2 ( τ ) ( 1 + N 2 ( τ ) ) 2 ,

N 1 ( τ ) = α 1 B 0 ( τ ) ( β 2 S * + α 2 ) e ( γ 2 μ 2 γ 1 ) τ ,

N 2 ( τ ) = μ 1 N 1 ( τ ) + α 2 γ 2 e ( μ 3 + 2 γ 2 ) τ .

Proof. We let | P 1 ( i ω , τ ) | = ( N 1 ( τ ) ω + N 2 ( τ ) ) | P 2 ( i ω , τ ) | .

First, | P 0 ( λ , τ ) | + | P 1 ( λ , τ ) | | P 2 ( λ , τ ) | is equivalent to

ω 6 + F 1 ( τ ) ω 4 + F 2 ( τ ) ω 2 + F 31 ( τ ) ω + F 41 ( τ ) 0.

Figure 1. Triangle formed by 1, a 1 ( ω , τ ) e i ω τ , a 2 ( ω , τ ) e i ω 2 τ .

Second, for | P 0 ( λ , τ ) | + | P 2 ( λ , τ ) | | P 1 ( λ , τ ) | . The result of inequality is consistent with the above equation. Third, | P 1 ( λ , τ ) | + | P 2 ( λ , τ ) | | P 0 ( λ , τ ) | is equivalent to

ω 6 + F 1 ( τ ) ω 4 + F 2 ( τ ) ω 2 F 32 ( τ ) ω + F 42 ( τ ) 0.

Therefore, we can get the feasible region Ω .

Once again, we consider two possible scenarios:

1) If I m ( a 1 ( ω , τ ) e i ω τ ) > 0 , we can get

arg ( a 1 ( ω , τ ) e i ω τ ) = π θ 1 ( ω , τ ) , arg ( a 2 ( ω , τ ) e i ω 2 τ ) = θ 2 ( ω , τ ) π ,

where

θ 1 ( ω , τ ) = arccos ( 1 + | a 1 ( ω , τ ) | 2 | a 2 ( ω , τ ) | 2 2 | a 1 ( ω , τ ) | ) ,

θ 2 ( ω , τ ) = arccos ( 1 + | a 2 ( ω , τ ) | 2 | a 1 ( ω , τ ) | 2 2 | a 2 ( ω , τ ) | ) .

Then, we can get

arg ( a 1 ( ω , τ ) ) ω τ + 2 n π = π θ 1 ( ω , τ ) , n ,

and

τ = 1 ω [ arg ( a 1 ( ω , τ ) ) + θ 1 ( ω , τ ) + ( 2 n 1 ) π ] , n .

2) If I m ( a 1 ( ω , τ ) e i ω τ ) < 0 , then we can get the triangular formed by 1, a 1 ( ω , τ ) e i ω τ , and a 2 ( ω , τ ) e i ω 2 τ is the mirror image of the one in Figure 1 about the real axis. Therefore, we obtain

arg ( a 1 ( ω , τ ) ) ω τ + 2 n π = π + θ 1 ( ω , τ ) , n ,

and

τ = 1 ω [ arg ( a 1 ( ω , τ ) ) θ 1 ( ω , τ ) + ( 2 n 1 ) π ] , n .

We denote by I ω the interval of ω for the feasible region Ω . Now, for fixed ω I ω and n , we can introduce the functions of τ , say S n ± : I ω , as

S n ± ( ω , τ ) = τ 1 ω [ arg ( a 1 ( ω , τ ) ) + ( 2 n 1 ) π ± θ 1 ( ω , τ ) ] , n . (21)

For the above equation, if zero exists, it can be denoted as τ ^ i ± ( ω ) , i = 1 , 2 , . So, the corresponding value of 2 τ . When ω takes the values throughout the interval I ω , then we get the curve

C : = { ( ω , τ ^ i ± ( ω ) ) : ω I ω , S n ± ( ω , τ ^ i ± ( ω ) ) = 0 }

on Ω , which will later determine the shape of the crossing curves

T = { ( τ ^ i ± ( ω ) ,2 τ ^ i ± ( ω ) ) + × + | ω I ω }

on ( τ ,2 τ ) -plane.

Lemma 12. The characteristic Equation (19) admits a pair of conjugate roots ± i ω * , for ( τ ,2 τ ) = ( 2 τ * ,2 τ * ) T . Denote by λ ± ( τ ) = α ( τ ,2 τ ) ± i ω ( τ ,2 τ ) the pair of conjugate complex roots of (19) in some neighborhood of ( τ * ,2 τ * ) , such that α ( τ * ,2 τ * ) = 0 and ω ( τ * ,2 τ * ) = ω * . If δ ( τ * , 2 τ * ) > 0 , then λ + ( τ ,2 τ ) cross the imaginary axis from left to right, as ( τ ,2 τ ) passes through the crossing curve to the region on the right. While if δ ( τ * , 2 τ * ) < 0 , then λ ( τ ,2 τ ) cross the imaginary axis from left to right, as ( τ ,2 τ ) passes through the crossing curve to the region on the left, where

δ ( τ * ,2 τ * ) = R e { [ P 0 τ * + P 1 τ * e i ω * τ * + ( P 2 τ * i ω P 2 * ) e i ω * 2 τ * ] [ P 1 * ¯ e i ω * τ * + P 2 * ¯ e i ω * 2 τ * ] }

with P l * = P l ( i ω * , τ * ) , P l τ * = P l τ ( i ω * , τ * ) , l = 0 , 1 , 2 .

Comprehensive analysis of the above, then we have the following result.

Theorem 13. Suppose that R 0 ( τ , τ ) > 1 and M 3 ( τ , τ ) > 0 holds. If τ [ 0, τ * ) , then the computer virus equilibrium P * of the system (6) is locally asymptotically stable, and the system (6) undergoes a Hopf bifurcation at the computer virus equilibrium P * when τ = τ * .

6. The Numerical Simulations and Conclusions

A computer virus epidemic model with age structure and two delays effects are constructed and studied in this paper. In contrast to traditional computer virus models, we take into account not only the spreading ability of latent computers, but also the healing ability of infected computers. That is, the models considered in this paper are more realistic. There are fewer studies on computer virus models for time lag and age systems, and in contrast to the existing ones, this paper proposes specific defenses through basic regenerative number analysis.

Theoretical analysis shows that the solution of the system (6) is non negative and bounded, the system only has the virus-free equilibrium P 0 when R 0 ( τ 1 , τ 2 ) < 1 , which is locally asymptotically stable, and except the virus-free equilibrium, there is also an the computer virus equilibrium P * when R 0 ( τ 1 , τ 2 ) > 1 and M 3 ( τ 1 , τ 2 ) > 0 , which is locally asymptotically stable for τ 1 = τ 2 = 0 . We also have discussed the existence of Hopf bifurcation under three different cases, which are 1) τ 1 > 0 and τ 2 = 0 , 2) τ 1 = 0 and τ 2 > 0 , and 3) τ 1 = τ 2 = τ > 0 , respectively. In the following, we will use Matlab to verify the dynamic behaviors of the system (6), which includes the stability of the computer virus equilibrium P * and the Hopf bifurcations under some cases.

In the cases where τ 1 > 0 and τ 2 = 0 . Firstly, let Λ = 0.5 , β 1 = 0.1 , β 2 = 0.1 , γ 1 = 0.0001 , γ 2 = 0.1 , μ 1 = 0.0001 , μ 2 = 0.12 , μ 3 = 0.001 , α 1 = 0.01 , α 2 = 0.1 , and τ 1 = 2 . then we can obtain R 0 ( τ 1 , 0 ) = 41.8524 > 1 , M 3 ( τ 1 , 0 ) = 0.9416 > 0 , q 2 2 ( τ 1 ) 3 q 1 ( τ 1 ) = 0.0038 < 0 . Figure 2 displays that the solution of the system (6) will converge to the computer virus equilibrium P * as t tends to infinity for different initial value conditions.

And then, we take Λ = 0.5 , β 1 = 0.008 , β 2 = 0.1 , γ 1 = 0.1 , γ 2 = 0.0001 , μ 1 = 0.01 , μ 2 = 0.15 , μ 3 = 0.01 , α 1 = 0.01 , α 2 = 0.001 , and τ 1 = 2 . then R 0 ( τ 1 , 0 ) = 12.1031 > 1 , M 3 ( τ 1 , 0 ) = 0.6053 > 0 , q 2 2 ( τ 1 ) 3 q 1 ( τ 1 ) = 0.0132 > 0 , Θ 2 = 0.0054 < 0 . Figure 3(a) displays the computer virus equilibrium P * gradually tends to stabilize as t tends to infinity. However, when we take Λ = 0.2 , β 1 = 0.008 , β 2 = 0.1 , γ 1 = 0.1 , γ 2 = 0.0001 , μ 1 = 0.001 , μ 2 = 0.15 , μ 3 = 0.001 , α 1 = 0.01 , α 2 = 0.01 , and τ 1 = 2 , then R 0 ( τ 1 , 0 ) = 8.7446 > 1 , M 3 ( τ 1 , 0 ) = 0.5848 > 0 , q 2 2 ( τ 1 ) 3 q 1 ( τ 1 ) = 0.0002 > 0 , Θ 2 = 0.0007 > 0 , and Q ( Θ 2 ) = 5.1673 × 10 8 > 0 . Similarly, we can see the computer equilibrium P * keeps stability in Figure 3(b).

Therefore, under these conditions of Theorem 6, the system also does not have periodic behavior regardless of the change in the delay τ 1 . Further, the distribution of infected individuals at the computer virus equilibrium P * , L * ( a ) is shown in Figure 4(a), corresponding to the situation in Figure 3(b), and the distribution of immunization age and time, and the distribution of infection age and infection time L ( t , a ) is shown in Figure 4(b).

Figure 2. The stability of the computer virus equilibrium P * when q 2 2 ( τ 1 ) 3 q 1 ( τ 1 ) < 0 .

Figure 3. The stability of the computer virus equilibrium P * when q 2 2 ( τ 1 ) 3 q 1 ( τ 1 ) 0 .

Figure 4. The distributions of latent individuals when P * is asymptotically stable under R 0 ( τ 1 , 0 ) > 1 .

Finally, choosing Λ = 16.8 , β 1 = 0.04 , β 2 = 0.0001 , γ 1 = 0.1 , γ 2 = 8.1 , μ 1 = 0.0003 , μ 2 = 0.09 , μ 3 = 0.012 , α 1 = 10 , α 2 = 0.001 , and τ 1 = 0.1 , we can get R 0 ( τ 1 , 0 ) = 598.2678 > 1 , M 3 ( τ 1 , 0 ) = 0.0245 > 0 , q 2 2 ( τ 1 ) 3 q 1 ( τ 1 ) = 3327.2594 > 0 , Θ 2 = 27.1586 > 0 , and Q ( Θ 2 ) = 4861.8883 < 0 . Figure 5 shows that the system (6) experiences the Hopf bifurcation.

In the cases where τ 1 = 0 and τ 2 > 0 . Firstly, let Λ = 0.5 , β 1 = 0.1 , β 2 = 0.1 , γ 1 = 0.0001 , γ 2 = 0.1 , μ 1 = 0.0001 , μ 2 = 0.12 , μ 3 = 0.001 , α 1 = 0.01 , α 2 = 0.1 , and τ 2 = 2 . then we can obtain R 0 ( 0 , τ 2 ) = 42.5704 > 1 , M 3 ( 0 , τ 2 ) = 0.9252 > 0 , q 2 2 ( τ 2 ) 3 q 1 ( τ 2 ) = 0.0012 . Figure 6 displays that the solution of the system (6) will converge to the computer virus equilibrium P * as t tends to infinity for different initial value conditions.

And then, we take Λ = 0.5 , β 1 = 0.008 , β 2 = 0.1 , γ 1 = 0.1 , γ 2 = 0.0001 , μ 1 = 0.01 , μ 2 = 0.15 , μ 3 = 0.01 , α 1 = 0.01 , α 2 = 0.001 , and τ 2 = 2 . then R 0 ( 0 , τ 2 ) = 18.9326 > 1 , M 3 ( 0 , τ 2 ) = 0.6116 > 0 , q 2 2 ( τ 2 ) 3 q 1 ( τ 2 ) = 0.0334 > 0 , Θ 2 = 0.0057 < 0 . Figure 7(a) displays the computer virus equilibrium P * gradually tends to stabilize as t tends to infinity. However, when we take Λ = 0.2 , β 1 = 0.008 , β 2 = 0.1 , γ 1 = 0.1 , γ 2 = 0.0001 , μ 1 = 0.001 , μ 2 = 0.15 , μ 3 = 0.001 , α 1 = 0.01 , α 2 = 0.01 , and τ 2 = 2 . then R 0 ( 0 , τ 2 ) = 14.3084 > 1 , M 3 ( 0 , τ 2 ) = 0.5773 > 0 , q 2 2 ( τ 2 ) 3 q 1 ( τ 2 ) = 0.0043 > 0 , Θ 2 = 0.0011 > 0 , Q ( Θ 2 ) = 2.8030 × 10 8 > 0 . Similarly, we can see the computer equilibrium P * keeps stability in Figure 7(b).

Next, choosing Λ = 6.8 , β 1 = 0.2 , β 2 = 0.4 , γ 1 = 3 , γ 2 = 2.1 , μ 1 = 0.007395 , μ 2 = 0.5 , μ 3 = 0.5 , α 1 = 10 , α 2 = 9.4 , and τ 2 = 0.1 . we can get R 0 ( 0 , τ 2 ) = 146.5118072 > 1 , M 3 ( 0 , τ 2 ) = 0.0138 > 0 , and q 0 ( τ 2 ) = 79605.2596 < 0 . Figure 8 shows that the system (6) experiences the Hopf bifurcation. Finally, choosing Λ = 9.9 , β 1 = 0.045 , β 2 = 0.0001 , γ 1 = 0.1 , γ 2 = 10.1 , μ 1 = 0.0003 , μ 2 = 0.1 , μ 3 = 0.002 , α 1 = 9.2 , α 2 = 0.001 , and τ 2 = 0.1 , we can get R 0 ( 0 , τ 2 ) = 158.8810 > 1 , M 3 ( 0 , τ 2 ) = 0.0486 > 0 , q 2 2 ( τ 2 ) 3 q 1 ( τ 2 ) = 13375.6150 > 0 , Θ 2 = 8.5059 > 0 , and Q ( Θ 2 ) = 80.0660 < 0 . Figure 9 shows that the system (6) experiences the Hopf bifurcation.

Figure 5. The Hopf bifurcation around the computer virus equilibrium P * for τ 1 > 0 and τ 2 = 0 .

Figure 6. The stability of the computer virus equilibrium P * when q 2 2 ( τ 2 ) 3 q 1 ( τ 2 ) < 0 .

Figure 7. The stability of the computer virus equilibrium P * when q 2 2 ( τ 2 ) 3 q 1 ( τ 2 ) 0 .

Figure 8. The Hopf bifurcation around the computer virus equilibrium P * for q 0 ( τ 2 ) < 0 .

Figure 9. The Hopf bifurcation around the computer virus equilibrium P * for q 0 ( τ 2 ) > 0 .

In the cases where τ 1 = τ 2 = τ > 0 . Firstly, we illustrate the stability of the computer virus equilibrium P * when ω I ω . Let Λ = 9.8 , β 1 = 0.05 , β 2 = 0.0001 , γ 1 = 0.1 , γ 2 = 12.1 , μ 1 = 0.0003 , μ 2 = 0.09 , μ 3 = 0.01 , α 1 = 10 , and α 2 = 0.001 . Then we can obtain R 0 ( τ , τ ) = 436.6949 > 1 , M 3 ( τ , τ ) = 0.0121 > 0 when τ = 2 . Figure 10 illustrates the computer virus equilibrium P * gradually tends to stabilize as t increases. Secondly, we discuss the stability of the network virus equilibrium P * when ω I ω . Let Λ = 2.8 , β 1 = 0.05 , β 2 = 0.0001 , γ 1 = 0.04 , γ 2 = 2.1 , μ 1 = 0.0003 , μ 2 = 0.2 , μ 3 = 0.01 , α 1 = 10 , α 2 = 0.5 , and τ = 0.1 , then we can obtain R 0 ( τ , τ ) = 160.4551 > 1 , and M 3 ( τ , τ ) = 0.0351 > 0 . Figure 11 illustrates the system (6) experiences the Hopf bifurcation.

In the case where τ 1 > 0 , τ 2 > 0 , and τ 1 τ 2 . Let Λ = 8.5 , and μ 1 = 0.0001 . Taking τ 1 = 0.1 , and τ 2 = 0.2 , then we can obtain R 0 ( τ 1 , τ 2 ) = 1142.3502 > 1 , and M 3 ( τ 1 , τ 2 ) = 0.0125 > 0 . Figure 12 displays that the system (6) still undergoes the Hopf bifurcation.

Figure 10. The stability of the computer virus equilibrium P * for ω I ω .

Figure 11. The Hopf bifurcation around the computer virus equilibrium P * for τ 1 = τ 2 .

Figure 12. The Hopf bifurcation around the computer virus equilibrium P * for τ 1 τ 2 .

In order to completely control the spread of computer viruses in the network, it is necessary to control the basic regeneration number R 0 ( τ 1 , τ 2 ) when it is less than 1, which means that the spread of computer viruses can be controlled when virus-free equilibrium exists. Based on the basic regeneration number R 0 ( τ 1 , τ 2 ) in the previous theoretical analysis, it is known that it is related to both delays τ 1 and τ 2 . That R 0 ( τ 1 , τ 2 ) is a strictly monotonically increasing with respect to τ 2 . This indicates that the increase of τ 2 will have an impact on the stability of the system, so in order to control the spread of computer viruses, the range of values of τ 2 should be as small as possible, which means that the impact on the system is small at the same time. Therefore, we can effectively control the spread of computer viruses by reducing the recovery time of computer systems after infection. By adding age structure and two delays to the system, it is more suitable for the actual virus propagation in the computer in reality, which also provides effective measures for computer virus prevention.

The emergence of the Hopf bifurcation of the system (6) implies that when both factors, age structure and delay, are introduced together into the nonresident computer virus SLAS model, it leads to destabilization of the system, followed by the phenomenon of stability switching in the system. In other words, this would disrupt the threshold of dynamic behavior, while allowing the spread of the virus to get out of control.

The limitation of this paper is that it does not discuss the global stability of virus-free equilibrium P * when R 0 > 1 . In addition, this paper does not determine the dynamical behavior of the system as the two delays τ 1 and τ 2 increases. We will continue to discuss these aspects in the future. At the same time, the spread of viruses in the computer and the infection process is more detailed, which is conducive to the subsequent study of computer virus propagation model, in which case the proposed control strategy will be more effective.

Acknowledgements

This research was partially supported by National Natural Science Foundation of China through Grants No. 12071268 and No. 11971281.

Conflicts of Interest

The authors declare no conflicts of interest regarding the publication of this paper.

References

[1] Cohen, F. (1987) Computer Viruses: Theory and Experiments. Computers & Security, 6, 22-35.
https://doi.org/10.1016/0167-4048(87)90122-2
[2] Ren, J., Yang, X., Zhu, Q., Yang, L.X. and Zhang, C. (2012) A Novel Computer Virus Model and Its Dynamics. Nonlinear Analysis: Real World Applications, 13, 376-384.
https://doi.org/10.1016/j.nonrwa.2011.07.048
[3] Gan, C., Yang, X., Liu, W., Zhu, Q. and Zhang, X. (2013) An Epidemic Model of Computer Viruses with Vaccination and Generalized Nonlinear Incidence Rate. Applied Mathematics and Computation, 222, 265-274.
https://doi.org/10.1016/j.amc.2013.07.055
[4] Amador, J. and Artalejo, J.R. (2013) Stochastic Modeling of Computer Virus Spreading with Warning Signals. Journal of the Franklin Institute, 350, 1112-1138.
https://doi.org/10.1016/j.jfranklin.2013.02.008
[5] Gan, C., Yang, X., Liu, W. and Zhu, Q. (2014) A Propagation Model of Computer Virus with Nonlinear Vaccination Probability. Communications in Nonlinear Science and Numerical Simulation, 19, 92-100.
https://doi.org/10.1016/j.cnsns.2013.06.018
[6] Cao, H., Wang, S., Yan, D., Tan, H. and Xu, H. (2021) The Dynamical Analysis of Computer Viruses Model with Age Structure and Delay. Discrete Dynamics in Nature and Society, 2021, Article ID: 5538438.
https://doi.org/10.1155/2021/5538438
[7] Yang, L.X. and Yang, X. (2014) A New Epidemic Model of Computer Viruses. Communications in Nonlinear Science and Numerical Simulation, 19, 1935-1944.
https://doi.org/10.1016/j.cnsns.2013.09.038
[8] Chen, L., Hattaf, K. and Sun, J. (2015) Optimal Control of a Delayed SLBS Computer Virus Model. Physica A: Statistical Mechanics and Its Applications, 427, 244-250.
https://doi.org/10.1016/j.physa.2015.02.048
[9] Liang, X., Pei, Y. and Lv, Y. (2018) Modeling the State Dependent Impulse Control for Computer Virus Propagation under Media Coverage. Physica A: Statistical Mechanics and Its Applications, 491, 516-527.
https://doi.org/10.1016/j.physa.2017.09.058
[10] Upadhyay, R.K. and Kumari, S. (2018) Global Stability of Worm Propagation Model with Nonlinear Incidence Rate in Computer Network. International Journal of Network Security, 20, 515-526.
[11] Lanz, A., Rogers, D. and Alford, T.L. (2019) An Epidemic Model of Malware Virus with Quarantine. Journal of Advances in Mathematics and Computer Science, 33, 1-10.
https://doi.org/10.9734/jamcs/2019/v33i430182
[12] Abdel-Gawad, H.I., Baleanu, D. and Abdel-Gawad, A.H. (2021) Unification of the Different Fractional Time Derivatives: An Application to the Epidemic-Antivirus Dynamical System in Computer Networks. Chaos, Solitons & Fractals, 142, Article ID: 110416.
https://doi.org/10.1016/j.chaos.2020.110416
[13] Akgül, A., Sajid Iqbal, M., Fatima, U., Ahmed, N., Iqbal, Z., Raza, A., Rafiq, M. and Rehman, M.A. (2021) Optimal Existence of Fractional Order Computer Virus Epidemic Model and Numerical Simulations. Mathematical Methods in the Applied Sciences, 44, 10673-10685.
https://doi.org/10.1002/mma.7437
[14] Shah, H. and Comissiong, D.M.G. (2021) Computer Virus Model with Stealth Viruses and Antivirus Renewal in a Network with Fast Infectors. SN Computer Science, 2, Article No. 407.
https://doi.org/10.1007/s42979-021-00780-9
[15] Gao, W. and Baskonus, H.M. (2022) Deeper Investigation of Modified Epidemiological Computer Virus Model Containing the Caputo Operator. Chaos, Solitons & Fractals, 158, Article ID: 112050.
https://doi.org/10.1016/j.chaos.2022.112050
[16] Muroya, Y. and Kuniya, T. (2015) Global Stability of Nonresident Computer Virus Models. Mathematical Methods in the Applied Sciences, 38, 281-295.
https://doi.org/10.1002/mma.3068
[17] Zhang, Z., Wang, Y. and Ferrara, M. (2018) Hopf Bifurcation of a Nonresident Computer Virus Model with Delay. Analysis in Theory and Applications, 34, 199-208.
https://doi.org/10.4208/ata.OA-2016-0035
[18] Coronel, A., Huancas, F. and Pinto, M. (2019) Sufficient Conditions for the Existence of Positive Periodic Solutions of a Generalized Nonresident Computer Virus Model. Quaestiones Mathematicae, 44, 259-279.
https://doi.org/10.2989/16073606.2019.1686438
[19] Beretta, E. and Kuang, Y. (2002) Geometric Stability Switch Criteria in Delay Differential Systems with Delay Dependent Parameters. SIAM Journal on Mathematical Analysis, 33, 1144-1165.
https://doi.org/10.1137/S0036141000376086
[20] An, Q., Beretta, E., Kuang, Y., Wang, C. and Wang, H. (2019) Geometric Stability Switch Criteria in Delay Differential Equations with Two Delays and Delay Dependent Parameters. Journal of Differential Equations, 266, 7073-7100.
https://doi.org/10.1016/j.jde.2018.11.025

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.