• Không có kết quả nào được tìm thấy

Predator-prey System with the Effect of Environmental Fluctuation

N/A
N/A
Protected

Academic year: 2022

Chia sẻ "Predator-prey System with the Effect of Environmental Fluctuation"

Copied!
21
0
0

Loading.... (view fulltext now)

Văn bản

(1)

49

Predator-prey System with the Effect of Environmental Fluctuation

Le Hong Lan*

Faculty of Basic Sciences, Hanoi University of Communications and Transport, Lang Thuong, Dong Da, Hanoi, Vietnam

Received 18 July 2014

Revised 27 August 2014; Accepted 15 September 2014

Abstract: In this paper we study the trajectory behavior of Lotka - Volterra predator - prey systems with periodic coefficients under telegraph noises. We describe the ω - limit set of the solution, give sufficient conditions for the persistence and prove the existence of a Markov periodic solution.

Keywords: Key words and phrases, Lotka-Volterra Equation, Predator - Prey, Telegraph noise,

ω

- limit set, Markov periodic solution.

1. Introduction*

The Kolmogorov equation

( ) ( ) ( )

( ) ( ) ( )

, ,

, ,

x t x f t x t y t y t y g t x t y t

 =  

  

 =  

  

with the functionsf t x t,

( ) ( )

,y t ;g t x t,

( ) ( )

,y t periodic in t is a strong tool to describe the evolution of prey-predator communities depending on the changing of seasons. There is a lot of work dealing with the asymptotic behavior of such systems as the existence of periodic solutions, the persistence... [1-4] In particular, the classical model for a system consisting of two species in prey- predator relation

( ) ( ) ( ) ( ) ( ) ( ) ( )

( ) ( ) ( ) ( ) ( ) ( ) ( )

(1.1)

x t x t a t b t x t c t y t y t y t d t e t x t f t y t

 =  − − 

  

 = − + − 

  

with the periodic coefficients a; b; c; d; e; f is well investigated in [5-10], where x t

( )

(resp.y t

( )

) is

the quantity of the prey (resp. of predator) at time t. _______

* Tel.: 84- 989060885

Email: honglanle229@gmail.com

(2)

In almost of these works, one supposes that the communities develop under an environment without random perturbation. However, it is clear that it is not the case in reality because in general, annual seasonal living conditions of the communities are not the same. Therefore, it is important to take into account not only in the changing of seasons but also in the fluctuation of stochastic factors, which may have important consequences on the dynamics of the communities.

For the stochastic Lotka - Volterra equation, a systematic review has been given in [11-13]. In our separate paper [14], we analyze the Lotka - Volterra predator-prey system with constant coefficients under the telegraph noises, i.e., environmental variability causes the parameter switching between two systems. Then we have described some parts of ω-set of solutions and show out the existence of a stationary distribution.

In this paper, we want to consider predator-prey models under the influence of stochastic fluctuation of environment and changing periodically of season as well. We describe completely the omega limit set of the positive solutions of Equation (1.1) with the periodic coefficients under the telegraph noises. Also, the existence of a Markov periodic solution that attracts the other solutions of Equation (2.4), starting in +×+under certain conditions is proved.

The rest of the paper is divided into three sections. Section 2 details the model. Some properties of the solution and the set of omega limit are shown in section 3. The last section is some simulations and discussions.

2. Preliminary

Let ( , , )Ω F P be a complete probability space and { ( ) :ξ t t≥0} be a continuous-time Markov chain defined on ( , , )Ω F P , whose state space is a two-element set M= − +{ , } and whose generator is given by

11 12

21 22

q q

Q q q

α α

β β

   

=  = 

 − 

 

with α >0 and β>0 . It follows that, ϖ =

(

p q,

)

, the stationary distribution of

{

ξ

( )

t t: 0

}

satisfying the system of equations 0

1 Q p q ϖ =



 + = is given by

{ ( ) } { ( ) }

lim 1

lim 2

t

t

p P t

q P t

ξ β

α β ξ β

α β

→+∞

→ +∞

 = = =

 +



 = = =

 +

(2.1)

Such a two-state Markov chain is commonly referred to as telegraph noise because of the nature of its sample paths. The trajectory of

{ }

ξt is piecewise-constant, cadlag functions. Suppose that
(3)

0 1 2

0=τ <τ <τ < <... τn<... (2.2) are its jump times. Put

1: 1 0 , 2: 2 1, ... , n: n n1

σ =τ −τ σ =τ −τ σ =τ −τ (2.3)

It is known that the sequence

{ }

σk nk=1 is an independent random variables in the condition of given sequence

{ }

k 1

n τ k

ξ = (see [15, 16]). Note that if ξ0 is given then

τn

ξ is constant since the process

{ }

ξt takes only two values. Hence, (σk)k=1 is a sequence of conditionally independent random variables, valued in

[

0,+ ∞

]

. Moreover, if ξ0= + then σ2n+1 has the exponential density α1[0,+ ∞)eαt and σ2n+1 has the densityβ1[0,+ ∞)eβt . Conversely, if ξ0 = − then σ2n has the exponential density

[0, )

1 e αt

α + ∞ and σ2n+1 has the density β1[0,+ ∞)eβt (see [15]). Here

[0, )

1 , 0

1 0 , 0

t

+ ∞ t

=

 < .

Denote ℑ =0n σ τ

(

k ,kn

)

;ℑ =n σ τ

(

k −τn,k>n

)

. We see that ℑ0n is independent of ℑn for any n∈ in the condition that ξ0 given.

Let ξ0 have the distribution Ρ

{

ξ0= + =

}

p

{

ξ0= − =

}

q then

{ }

ξt is a stationary process.

Therefore, there exists a group θt,t∈ of

P −

preserving measure transformations θt: Ω → Ω such thatξ ωt

( )

=ξ θ ω0

(

t

)

, ω∈Ω.

We consider the periodic predator-prey equation under a random environment. Suppose that the quantity x of the prey and the quantity y of the predator are described by a Lotka - Volterra equation

( ) ( ) ( )

( ) ( ) ( )

, , ,

, , ,

t t t

t t t

x x a t b t x c t y

y y d t e t x f t y

ξ ξ ξ

ξ ξ ξ

 =  − − 

  

 = − + − 

  

(2.4)

where g:Ε →+for g=a b c d e f, , , , , such that g i

( )

,. are continuous and periodic functions with period T > 0 for any i∈Ε. Moreover, mg i t

( )

,M; in which m and M are two positive constants.

In case where the noise

{ }

ξt intervenes virtually into Equation (2.4), it makes a switching between the deterministic periodic system

( ) ( ) ( ) ( ) ( ) ( ) ( )

( ) ( ) ( ) ( ) ( ) ( ) ( )

, , ,

, , ,

x t x t a t b t x t c t y t

y t y t d t e t x t f t y t

+ + + +

+ + + +

 =  + − + − + 

  

 = − + + + − + 

  

(2.5)

and another

( ) ( ) ( ) ( ) ( ) ( ) ( )

( ) ( ) ( ) ( ) ( ) ( ) ( )

, , ,

, , ,

x t x t a t b t x t c t y t

y t y t d t e t x t f t y t

 =  − − − − − 

  

 = − − + − − − 

  

(2.6)

(4)

Thus, the relationship of these two systems will determine the trajectory behavior of Equation (2.4).

System (2.4) without the noise

{ }

ξt , i.e.,g

(

ξt,t

)

=g t

( )

for any g=a b, , ...,f is studied in [9].

They show that

Theorem 2.1. Consider the system

( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) ( )

x t x t a t b t x t c t y t y t y t d t e t x t f t y t

 =  − − 

  

 = − + − 

  

(2.7)

where , ,...,a b f are T-periodic functions.

a) If

a d

inf sup

b e

   

 >  

    (2.8) b c

inf sup

e d

   

 >  

    (2.9) then system (2.7) has a positive T-periodic solution

(

x t*

( ) ( )

,y t*

)

satisfying

(

x t

( )

x t*

( ) ( )

, y t y t*

( ) )

t→∞

( )

0,0 . (2.10)

b) If

d a

inf sup

e b

   

 >  

    (2.11)

then the (unique) periodic solution u t*

( )

of the equation u t

( )

=u t

( ) ( ) ( ) ( )

a t b t u t  is stable and

(

x t

( )

u t*

( ) ( )

,y t

)

→t→+∞

( )

0,0 (2.12)

for any positive solution

(

x t

( ) ( )

, y t

)

to (2.7).

Figure 1. Coexistence of predator and prey. Figure 2. Extinction of predators.

(5)

Lemma 2.2. Consider the system

( ) ( )

( ) ( )

, , , , x t f x y t y t g x y t

 =



 =

where f g, : 2×

[

0,+ ∞ →

)

2×

[

0,+ ∞

)

are T-periodic functions in t.

Suppose that this system has a globally asymptotically stable T- periodic solution

(

x t*

( ) ( )

, y t*

)

:=

(

x t

(

,0,z*0

) (

,y t,0,z0*

) )

,

where z0*:=

(

x0*,y*0

)

is the initial point. Then, for every ε >0and a compact set K, we can find a

( )

* *

, 0

T =T ε Κ > such that for all tT* ,s≥0 ,

(

x0 , y0

)

∈Κ. we have

(

, , 0, 0

)

*

( ) (

, , 0, 0

)

*

( )

x t+s s x yx t+s + y t+s s x yy t+s ≤ε (2.13)

Proof. Since ,f gare T−periodic, we can suppose that 0≤ ≤s T. Moreover, it is easy to show that if

(

x0,y0

)

∈Κ and 0≤ ≤s T, there is a compact set Κ′ such that

( ) ( )

(

x T s x, , 0,y0 ,y T s x, , 0,y0

)

∈Κ′. Due to the periodicity of parameters, it is therefore sufficient to verify (2.13) for s=0. Since

(

x t*

( )

,y t*

( ) )

is stable, we can find a δε >0 such that if

* *

0 0

xx + −y y ≤δε then

x t

(

,0, ,x y

)

x t*

( )

+ y t

(

,0, ,x y

)

y t*

( )

ε ,∀ ≥t 0

(

2.14

)

On the one hand,

(

x t*

( ) ( )

, y t*

)

is globally asymptotic then for every

(

x0, y0

)

∈Κ, there exist a

(x0,y0) (x0,y0) , (x0,y0)

T =k T k ∈ such that

x T

(

(x0,y0), 0, ,x y

)

x T*

(

(x0,y0)

)

+ y T

(

(x0,y0),0, ,x y

)

y T*

(

(x0,y0)

)

δε

By the continuous dependence of solutions on the initial data, there is a neighborhood of

(

x0,y0

)

, denoted by

0, 0

x y

V , such that

( )

(

0 0

) ( )

( )

(

( 0 0)

) (

( 0 0)

) ( )

0 0

( )

* *

, ,

, , 0, , x y , ,0, , , , , x y 2.15

x y x y x y

x T x yx T + y T x yy T ≤δεx yV

As a result of (2.14) and (2.15),

(

,0, ,

)

*

( ) (

,0, ,

)

*

( )

,

(

,

)

x0,y0, (x0,y0)

(

2.16

)

x t x yx t + y t x yy t ≤δεx yV tT

The family

{

Vx0,y0:

(

x0,y0

)

∈Κ

}

is an open covering of Κ. Since Κ is compact then there is a finite family

{

Vx10,y10 ,...,Vx0n,y0n

}

such that

0, 0

1

.

i i

n x y i

V

=

Κ ⊂

By choosing *

(

0 0

)

1

max i, i

i n

T T x y

≤ ≤

= , for any

point

(

x0,y0

)

∈Κ and for allt>T*, we have:

x t

(

,0,x0,y0

)

x t*

( )

+ y t

(

,0,x0,y0

)

y t*

( )

<ε. The proof is complete.
(6)

3. Dynamic behavior of the solution

Let

(

x0,y0

)

2+. Denote by

(

x t

(

,0,x0,y0

) (

, y t, 0,x0,y0

) )

the solution of (2.4) satisfying the initial condition

(

x

(

0, 0,x0,y0

) (

, y 0,0,x0,y0

) )

=

(

x0,y0

)

. For the sake of simplification, we write

(

x t

( ) ( )

, y t

)

for

(

x t

(

,0,x0,y0

) (

, y t, 0,x0,y0

) )

if there is no confusion.

Proposition 3.1. The system (2.4) is dissipative and the rectangle

(

0,M m/

]

×

(

0,M2/m21 is forward invariant.

Proof. By the uniqueness of the solution, it is easy to show that both the nonnegative and positive cones of 2+ are positively invariant for (2.4). From the first equation of system (2.4) we see that

x=x a

(

ξt,t

) (

b ξt,t x

)

c

(

ξt,t y

)

<x a

(

ξt,t

) (

b ξt,t x

)

< x M

(

mx

)

.

By the comparison theorem, it follows that if x

( )

00 then x t

( )

M m/ ,∀ >t t0 for some t0>0.

Similarity,

( ) ( ) ( ) ( ) ( ) ( )

(

2

)

, , , , , / ,

/ ,

t t t t t t

y y d t e t x f t y y d t e t M m f t y

y m M m my

ξ ξ ξ ξ ξ ξ

= − + − < − + − 

< − + −

which follows that y t

( )

M2/m2−1 ,∀ >t t1 for somet1>t0 .

From these estimates, we also see that the rectangle

(

0,M m/

]

×

(

0,M2/m21 is forward invariant. The proof is complete.

Proposition 3.2. There exists A δ0>0such that lim sup

(

,0, 0, 0

)

0 t

x t x y δ

→+∞

≥ for any

(

x y0, 0

)

with probability 1.

Proof. By the system (2.4), there exist δ0>0, ε0>0 such that

(

t,

) (

t,

) (

t,

)

0 ; 0 0 , 0 2/ 2 1

d ξ t e ξ t x f ξ t y ε x δ y M m

− + − < − ∀ < < < ≤ −

and

(

t,

) (

t,

) (

t,

)

0 0 , 0.

( )

3.1

a ξ tb ξ t xc ξ t yfor allx y≤δ Assume that lim sup

(

,0, 0, 0

)

0

t

x t x y δ

→+∞

< with a positive probability. Then, there is a t3>0 such that

( )

0 ,

( )

2/ 2 1 3

x t < δ y tM m − ∀ ≥t t , which implies that y t

( )

< −ε0y t

( )

. Therefore, for some t4>t3 ,y t

( )

0 ,∀ ≥t t4 . From (3.1) we see x t

( )

0x t

( )

,∀ ≥t t4 , which follows thatlim

( )

t x t

→+ ∞ = ∞ . This contradiction implies the assertion of this proposition.

Proposition 3.3. There exists a positive number xmin satisfying: if

(

x0,y0

)

2+ we can find 0

t>

such that x t

(

,0,x y0, 0

)

xmin for all tt.
(7)

Proof. With δ0 mentioned in 3.2, there exists t>0 such thatx t

( )

0. Let 0<ε1≤δ0 such that−δ1:= − +m Mε1<0. If x t

( )

≥ε1 for all t>t then the proposition is proved. Otherwise, x t

( )

1

for a t>t. Let h1=inf

{

s>t x s:

( )

<ε1

}

. We see that if x t

( )

≤ε1 for t>h1 then

(

t,

) (

t,

) (

t,

) (

1

)

1

(

1, 2

)

y=y−d ξ t +e ξ t xf ξ t y≤y − +m Mε = −δ y for all th h which implies that

( ) ( )

1 1(t h1) max 1(t h1) ,

(

1, 2

)

y ty h eδ y eδ ∀ ∈t h h Hence,

(

t,

) (

t,

) (

t,

) (

max 1(t h1)

)

,

(

1, 2

)

x=x a ξ tb ξ t xc ξ t y≥x mM xM y eδ ∀ ∈t h h . Put

( ) (

1( 1)

) ( )

( )

1 1

max ;

t t

t h n s

h h

n t =

mM y eδ ds N t =

e ds By comparison theorem we get

( )

( )

( ) ( )

1

1 2

, , .

1 en t

x t t h h

M N t ε

≥ ε ∀ ∈

+

Let

( )

( )

1

min 1 0

1

n t t h

e M N t α ε

ε

= > >

+ . It is clear that α does not depend on

(

x

( ) ( )

0 ,y 0

)

and h1. Let

{ }

min min , 1

x = α ε we see that x t

( )

>xmin ,∀ >t t. The proof is complete.

As is known, the property of solutions of Lotka -Volterra systems near to boundary is dependent of two marginal equations. In the case where the prey is absent, the quantity ( )v t of predator at the time t satisfies the equationv= −d

(

ξt,t v

)

f

(

ξt,t v

)

2. Thus, ( )v t decreases exponentially to 0.

Similarly, without the predator, the quantity ( )u t of the prey at the time t satisfies the logistic equation

(

t,

) (

t,

)

, 0

( )

0

u=u a ξ tb ξ t u <u+ (3.2) If ( )u t is a solution of (3.2) then

{

ξt,u t

( ) }

is Markov processes.

A random process

{ }

φt , valued in a measurable space (S; S), is said to be periodic with period T if for any t t1, ,...,2 tn∈, the simultaneous distribution of

(

1 , 2 ,...,

)

t k T t k T tn k T

φ + φ + φ + does not depend on k∈ .

We show that Equation (3.2) has a unique solution u t*

( )

such that

(

ξt,u t*

( ) )

is a periodic process. Indeed, put

( )

( )

( )

( )

*

,

A t t

A s s

u t e

b ξ s e ds

−∞

=

(8)

where

( ) ( )

0

, .

t

A t =

a ξs s ds Firstly, we see that

( )

( )

( )

( )

0

0

,

*

,

,

,

t T s

s

a s ds

t T a d

s

u t T e

b s e ds

τ

ξ ω

ξ ω τ τ

ω

ξ ω

+

+

−∞

+ =

  ∫

 

( )

( )

( )

0

0

,

,

,

t T T s T

s T T

a s T ds

t T a T d

T s T

e

b s T e ds

τ

ξ θ ω

ξ θ ω τ τ

ξ θ ω

+

+

−∞

=

 −  ∫

 

( )

( )

( )

( )

0

0

,

, ,

,

t T s T

s T T

s T

a s ds

t a d

a s ds

T s

e

e b s e ds

τ

ξ θ ω

ξ θ ω τ τ ξ θ ω

ξ θ ω

−∞

=

∫  

 

( )

( )

( )

( )

0

0

,

* ,

, , .

,

t T s

s T

a s ds

T

t a d

T s

e u t

e b s ds

τ

ξ θ ω

ξ θ ω τ τ

θ ω ξ θ ω

−∞

= =

∫  

 

Hence, by virtue of P- preserving measure property of θ, for any continuous function h, for any

1 2 ... n ;

t < < <t t k∈ we have

( ) ( ) ( )

{

hξt1+k T,u t* 1 k T ,ξt2+k T,u t* 2 k T ,...,ξtn+k T,u t* n k T

}

Ε  + + + 

( ) ( ) ( ) ( ) ( ) ( )

{

hξ θt1 kT ,u t* 1,θkT ,ξ θt2 kT ,u t* 2,θkT ,...,ξ θtn kT ,u t* n,θkT

}

= Ε  

( ) ( ) ( ) ( ) ( ) ( )

{

hξt1 . ,u t* 1, . ,ξt2 . ,u t* 2, . ,...,ξtn . ,u t* n, .

}

.

= Ε  

This means that

(

ξt,u t*

( ) )

is a periodic process with period T. The uniqueness follows from the following lemma:

Lemma 3.4. For any 0 0, lim

( )

*

( )

0

u t u t u t

→+ ∞ 

>  − = a.s., where u t

( )

is the solution of the equation (3.2) satisfyingu

( )

0 =u0.

Proof. Put 1 1*

z= −u u we havez= −a z. Thus, by virtue of the bounded below property by positive constant of z we follow the result.

Lemma 3.5. [Law of large numbers for periodic processes] For any continuous, bounded function

(

, ,

)

h t i u , periodic in t with period T we have

(9)

( ) ( )

* *

0 0

1 1

lim , , , ,

t T

s s

t h s u s ds h s u s ds

t ξ T ξ

→+ ∞

 

 

  = Ε   

     

∫ ∫

(3.3)

Proof. Put

( 1)

( )

, , *

n T

n s

nT

X h s ξ u s ds

+

 

=

 

Since

{

ξt,u t*

( ) }

is periodic then

{ }

Xn is a stationary process. By the law of large numbers we have

[

0

]

0

lim 1 / . .,

n n k

k

X X J a s

→∞ n =

= Ε

where J is the σ − algebra of the invariant sets. However,

( )

ξt is ergodic and u t*

( )

has no

non-trivial invariant set then we follow thatJ = Φ Ω

{

,

}

. This implies that

( ) [ ]

[ ]/

[ ]

*

0 0 0

1 1 1 1

lim , , lim

/

t t T

s k

t t

k

h s u s ds X X

t ξ T t T T

→+ ∞ →+∞

=

  = = Ε

 

( )

* 0

1 , ,

T

h s s u s ds

T ξ

= Ε   

Where,

[ ]

x denotes the integer number such that

[ ]

x x <

[ ]

x +1. Lemma is proved.

We study conditions that ensure the persistence of ( )y t of the Equation (2.4) with (0)x >0 and (0) 0

y > .

Proposition 3.6. Put

( ) ( ) ( )

*

0

: 1 , ,

T

t t

d t e t u t dt

λ = T Ε− ξ + ξ

(3.4)

a) If λ>0 then lim sup

( )

0

t

y t δ

→+ ∞

> > with probability 1.

b) In case 0, lim

( )

0

t y t

λ< → + ∞ = with probability 1.

Proof. By comparison theorem, if x

( )

0 =u

( )

0 we haveu t

( )

x t

( )

,∀t. Therefor, by virtue of Lemma 3.4 we have ln *

( )

ln

( )

lim inf 0

t

u t x t

t

→+ ∞

− ≥ .

a) From Equations (3.2) and (2.4) we have

*

( )

*

( ) ( ) ( ) ( )

*

0 0

ln ln 0 1 1

, ,

t t

s s

u t u

a s ds b s u s ds

t t ξ t ξ

− =

(3.5)

( ) ( ) ( ) ( ) ( ) ( )

( ) ( ) ( ) ( )

*

0 0

*

0 0

ln ln 0 1 1

, ,

1 1

, ,

t t

s s

t t

s s

x t x

a s ds b s x s u s ds

t t t

b s u s ds c s y s d

t t

ξ ξ

ξ ξ

− = −  −  −

− −

∫ ∫

∫ ∫

(3.6)

(10)

On subtracting (3.6) from (3.5) we obtain

( ) ( ) ( )

*

( ) ( )

0 0

1 1

0 lim inf , ,

t t

s s

t

c s y s ds b s u s x s ds

t ξ t ξ

→+ ∞

 

   

≤ 

 −  

( )

*

( ) ( )

0 0

1 1

lim inf

t t

t

M y s ds m u s x s ds

t t

→ +∞

 

   

≤ 

 −  

Hence,

( )

*

( ) ( )

0 0

1 1

lim inf 0

t t

t

M y s ds u s x s ds

t m t

→+ ∞

 

 −  −  ≥

   

 

∫ ∫

(3.7)

Otherwise,

( )

( ) (

t,

) (

t,

) ( ) (

t,

) ( )

y t d t e t x t f t y t

y t = − ξ + ξ − ξ

follows

( ) ( ) ( ) ( ) ( )

( ) ( ) ( ) ( ) ( )

* 0

*

0 0

ln ln 0 1

, ,

1 1

, ,

t

s s

t t

s s

y t y

d s e s u s ds

t t

e s u s x s ds f s y s ds

t t

ξ ξ

ξ ξ

− = − +  −

 

−  −  −

∫ ∫

and

( )

*

( ) ( ) ( ) ( )

0 0

1 1

, ,

t t

s s

e s u s x s ds f s y s ds

t

ξ  −  +t

ξ =

( ) ( ) ( )

*

( ) ( )

0

ln ln 0

1 , ,

t

s s

y t y

d s e s u s ds

t ξ ξ t

=

− +  −

Moreover, ( )y t is bounded above then ln

( )

ln

( )

0

lim inf 0

t

y t y

t

→+ ∞

 − 

− ≥

 

  and we apply the law

of large numbers (Lemma 3.5),

( ) ( ) ( )

*

0

lim 1 , ,

t

s s

t d s e s u s ds

t ξ ξ λ

→+ ∞

− +  = , consequently,

( )

*

( ) ( ) ( ) ( )

0 0

1 1

lim inf , ,

t t

s s

t

e s u s x s ds f s y s ds

t ξ t ξ

→+ ∞

 

  −  + =

   

 

∫ ∫

( ) ( ) ( )

*

( ) ( )

0

ln ln 0

lim inf 1 , ,

t

s s

t

y t y

d s e s u s ds

t ξ ξ t

→ + ∞

 − 

   

= 

− +  − 

( ) ( ) ( )

*

( ) ( )

0

ln ln 0

lim inf 1 , , lim inf

t

s s

t t

y t y

d s e s u s ds

t ξ ξ t λ

→ + ∞ →+ ∞

     − 

≥ 

− +  + − ≥

Hence,

( ) ( ) ( )

*

0 0

1 1

lim inf

t t

t

u s x s ds y s ds

t t

→+ ∞

 

  −  + ≥

   

 

∫ ∫

(11)

( )

*

( ) ( ) ( ) ( )

0 0

, ,

1 1

lim inf

t t

s s

t

e s f s

u s x s ds y s ds

t M t M M

ξ ξ λ

→+ ∞

 

  −  + ≥

   

 

∫ ∫

By (3.7) plus (3.8), we obtain

( ) ( )

*

( ) ( )

0 0 0

1 1 1

lim inf 1 lim inf

t t t

t t

M M

y s ds y s ds u s x s ds

t m t m t

→+ ∞ → + ∞

 

 

 +  ≥  −  −  +

   

   

∫ ∫ ∫

+ *

( ) ( ) ( )

0 0

1 1

lim inf

t t

t

u s x s ds y s ds

t t M

λ

→+ ∞

 

  −  + ≥

   

 

∫ ∫

then

( )

( )

0

lim inf 1 0

t

t

y s ds m

t M M m λ

→+ ∞ ≥ ≥

+ and lim sup

( )

0.

t

y t δ

→ +∞ > >

b) From the second equality of systems (2.4) and λ>0 we have

( ) ( ) ( ) ( ) ( )

( ) ( ) ( ) ( ) ( )

* 0

*

0 0

ln ln 0 1

lim sup lim sup , ,

1 1

, ,

t

s s

t t

t t

s s

y t y

d s e s u s ds

t t

e s u s x s ds f s y s ds

t t

ξ ξ

ξ ξ

→ + ∞ →+ ∞

− =  − +  −



  

−  −  − 



∫ ∫

( )

*

( ) ( ) ( ) ( )

0 0

1 1

lim sup , lim sup , 0

t t

s s

t t

e s u s x s ds f s y s ds

t t

λ ξ ξ

→+ ∞ →+ ∞

 

≤ −

 −  −

<

which implies that lim

( )

0

t y t

→+ ∞ = . The proof is complete.

Remark 3.7. The conditions (3.4) is easily to be checked by simulation method based on the law of large numbers. Moreover, by

(

ξt,u t*

( ) )

is solution of equation (3.2), we have

( ) ( ) ( )

*

0

: 1 , ,

T

t t

d t e t u t dt

λ =T Ε

− ξ + ξ 

( ) ( )

( ) ( ) ( )

*

0

1 ,

, ,

,

T

t

t t

t

e t

d t b t u t dt

T b t

ξ ξ ξ

ξ

   

 

= Ε − +  

 

   

( ) ( )

( ) ( ) ( )

*

0

1 ,

, inf ,

,

T

t t

t t

e t

d t b t u t dt

T ξ b t ξ

ξ

→+ ∞

   ±   

   

≥ Ε − +    

 

 

     

( ) ( )

( ) ( )

0

1 ,

, inf ,

,

T

t t t

t

e t

d t a t dt

T ξ b t ξ

ξ

→+ ∞

   ±   

   

= Ε − +    +

 

 

     

( )

( ) ( ) ( ) ( )

*

0

, 1

inf , ,

,

T

t t

t t

e t

a t b t u t dt

b t T ξ ξ

ξ

→+ ∞

 ±   

     

+   Ε

 −   Note that
(12)

( ) ( ) ( )

*

0

1 , , 0

T

t t

a t b t u t dt

T Ε

 ξ − ξ =

and that

( ) ( )

( )

,

( )

, inf , 0 , 0

,

t

e t

d t a t t

b t

→+ ∞

 ± 

 

− ± +   ± ≥ ∀ >

 ± 

 

provided that

( ) ( )

( ) ( )

, ,

inf sup

, ,

t t

a t d t

b t e t

→+ ∞ → +∞

 ±   ± 

   

 >  

± ±

   

    (3.9)

Then, λ>0 under the condition 3.9, which is similar to (2.8).

From now on, we suppose that λ>0.

Lemma 3.8. With probability 1, there are infinitely many sn=sn

( )

ω >0 such that sn >sn1, lim n

n s

→+ ∞ = ∞ and x s

( )

n ≥δ, y s

( )

n ≥δ ,∀ ∈n .

Proof. By Proposition 3.3 we can find t>0 such that x t

( )

xmin, for allt>t. On the other hand, there exists δ <xmin and a random sequences

{ }

sn,sn>t such thaty s

( )

n, ∀ ∈n . The proof is complete.

For the sake of simplicity, we suppose ξ0= + a.s and set xn:=x

(

τn, ,x y

)

, yn:=y

(

τn, ,x y

)

( )

0 ,

n

k k n

σ τ

ℑ = ≤ ; ℑ =n σ τ

(

k −τn,k>n

)

. It is clear that

(

xn,yn

)

is ℑ0n measurable ℑ0n is independent ℑ0 if ξ0 is given.

Hypotheses 3.9. On the quadrant int2+, the system (2.5) has a stable positive T−periodic solution

(

x*+,y+*

)

such that

( ) ( ) ( ) ( )

(

x+ t x*+ t , y+ t y*+ t

)

→t→+∞

(

0,0 .

)

Lemma 3.10. Suppose that Hypothesis 3.9 holds andλ>0, we can find an ∆ >0such that with probability 1, there are infinitely many n∈ such that∆ ≤xn,ynM*. Moreover, we can find ∆ >0 such that the events

{

x2k+1> ∆, y2k+1> ∆

}

as well as

{

x2k> ∆, y2k> ∆

}

occur infinitely many often.

Proof. Let

{ }

t be the filtration generated by

{

ξ

( )

t

}

. It is obvious that

{

ξ

( ) ( ) ( )

t ,x t ,y t

}

is a

strong Feller-Markov process with respect to the filtration

{ }

t . For a stopping time ς , the σ− algebra at ς is ℑ =ς

{

A∈ ℑ:A

{

ς ≤ ∈ ℑ ∀ ∈t

}

t , t +

}

. Fix a T1>0, by Lemma 3.8, we can define almost surely finite stopping times

( ) ( )

{ }

( ) ( )

{ }

( ) ( )

{ }

1

2 1 1

1 1

inf 0: ,

inf : ,

...

inf : ,

n n

t x t y t

t T x t y t

t T x t y t

η δ δ

η η δ δ

η η δ δ

= > ≥ ≥

= > + ≥ ≥

= > + ≥ ≥

(13)

For a stopping time ς , we write τ ς

( )

for the first jump of ξ

( )

t after ς , i.e.,

( )

inf

{

t :

( )

t

( ) }

τ ς = >ς ξ ≠ξ ς . Let σ ς

( )

=τ ς

( )

−ς andAk =

{

σ η

( )

k <T1

}

,k. Obviously, Ak is in the σ− algebra generated by

{

ξ η

(

n+s

)

: s0

}

and

1

k k

A η

∈ ℑ + also. Therefore, in view of the strong Markov property of

(

ξ

( ) ( ) ( )

t ,x t ,y t

)

and [see 15, Theorem 5, p. 59] we have

ΡAk ξ η

( )

k = ± = Ρσ

( )

0 >T1ξ

( )

0 = ±. Hence,

( )

Ak σ η

( )

k T1ξ η

( )

k ξ η

( )

k σ η

( )

k T1ξ η

( )

k ξ η

( )

k

Ρ = Ρ > = + Ρ  = ++ Ρ > = − Ρ  = −

( )

0 T1

( )

0

( )

k

( )

0 T1

( )

0

( )

k p

σ ξ ξ η σ ξ ξ η

   

= Ρ > = + Ρ  = ++ Ρ > = − Ρ  = −≤ where p=max

{

Ρ

(

σ

( )

0 >T1 ξ0= ± <

) }

1. Moreover,

( ) ( ) ( )

{ }

( ) ( ) ( )

{ }

( ) ( ) ( )

{ }

1

1 1

1 1

1 1 1

1 1 1

1 1 1

1 1 , ,

1 1 , ,

1 1 , ,

k k

k k k

k k k

k k k

A A

k k k

A A

k k k

A A

x y

x y

x y

η

η

ξ η η η

ξ η η η

ξ η η η

+

+ +

+ +

+ + +

+ + +

+ + +

Ε   =

 

= Ε Ε ℑ   

 

= Ε Ε ℑ   

Tài liệu tham khảo

Tài liệu liên quan

Having established, in general terms, the centrality of the category clause and having suggested the criteria relevant to its definition and recognition, I will

Using structural time series models, we have estimated common stochastic trend and cycle models of money demand (M1) for Venezuela in the 1993.1-2001.4 period, using the

The index evaluating the extent of growth, with concern for the growth experienced by the initially disadvantaged types, is positive for the first period and negative for the

Ngoài ra, để xem xét sự tồn tại của hàm Riemann Zeta tại một điểm cho trước, bằng cách so sánh giá trị chuỗi tại điểm đó với một chuỗi con như thế, từ đó ta có thể biết

Abstract: In this work, we investigate the defect structure of silicene with a vancacy and the adsorption mechanism of isopropanol on the surface of defected silicene

Received: 09/9/2021 Recently, fuzzy clustering is widely used to group data. Fuzzy clustering is studied and applicable in many technical applications like

Dựa trên các phương pháp kết hợp muộn cơ bản được thực hiện trên các bài toán khác nhau và được truyền cảm hứng từ nghiên cứu [8] thực hiện kết hợp nhiều mô hình khác nhau

In this paper we deal with the non-linear static analysis of stiffened and unstiffened lam inated plates by R itz’s m ethod and FEM in correctizied