Skip to main content

Pathwise estimation of stochastic functional Kolmogorov-type systems with infinite delay

Abstract

In this paper, we study pathwise estimation of the global positive solutions for the stochastic functional Kolmogorov-type systems with infinite delay. Under some conditions, the growth rate of the solutions for such systems with general noise structures is less than a polynomial rate in the almost sure sense. To illustrate the applications of our theory more clearly, this paper also discusses various stochastic Lotka-Volterra-type systems as special cases.

MSC:34K50, 60H10, 92D25, 93E03.

1 Introduction

The stochastic functional Kolomogorov-type systems for n interacting species is described by the following stochastic functional differential equation:

dx(t)=diag( x 1 ,, x n ) [ f ( x t ) d t + g ( x t ) d w ( t ) ] ,
(1.1)

where x= ( x 1 , , x n ) T diag( x 1 ,, x n ) represents the n×n matrix with all elements zero except those on the diagonal which are x 1 ,, x n w(t) is a scalar Brownian motion, and

f= ( f 1 , , f n ) T :C ( [ τ , 0 ] ; R n ) R n ,g= ( g 1 , , g n ) T :C ( [ τ , 0 ] ; R n ) R n .

There is an extensive literature concerned with the dynamics of this system and we here only mention [7, 9, 10]. References [7, 9, 10] study existence and uniqueness of the global positive solution of Eq. (1.1), and its asymptotic bound properties and moment average in time. The nice positive property provides us with a great opportunity to discuss further how the solutions vary in R + n in more detail. Our interest is to discuss pathwise estimation of the global positive solutions for stochastic functional Kolomogorov-type systems with infinite delay.

There is an extensive literature concerned with the dynamics of the Kolomogorov-type systems (1.1) without the stochastic perturbation and we here only mention [35, 21]. As a special case, multispecies Lotka-Volterra-type systems with bounded delay and unbounded delay are studied. For example, He and Gopalsamy [16] consider the global positive solution for a two-dimensional Lotka-Volterra system. Kuang [19] examines global stability for infinite delay Lotka-Volterra-type systems. For more details about the Lotka-Volterra-type systems, we refer the reader to see [6, 1113, 15, 20] and references therein. In fact, population systems are often subject to environmental noise. It is therefore useful to reveal how the noise affects on the Kolmogorov-type systems. Recently, the stochastic Lotka-Volterra systems have received increasing attention. References [1, 17] reveal that the noise plays an important role to suppress the growth of the solution. References [2, 18] show the stochastic system behaves similarly to the corresponding deterministic system under different stochastic perturbations, respectively. These indicate clearly that different structures of environmental noise may have different effects on Lotka-Volterra systems.

However, little is yet known about the pathwise property of the stochastic functional Kolmogorov-type systems with infinite delay although they may be seen as a generalized stochastic functional Lotka-Volterra system. This paper will examine the pathwise estimation of the stochastic functional Kolmogorov-type systems under the general noise structures. Consider the n-dimensional unbounded delay stochastic functional Kolmogorov-type systems

dx(t)=diag ( x 1 ( t ) , , x n ( t ) ) [ f ( x t ) d t + g ( x t ) d w ( t ) ]
(1.2)

on t0, where w(t) is an m-dimensional Brownian motion, and

f:BC ( ( , 0 ] ; R n ) R n ,g:BC ( ( , 0 ] ; R n ) R n × m ,

where the initial data space BC((,0]; R n ) denotes the family of bounded continuous R n -value functions φ defined on (,0] with the norm φ= sup θ 0 |φ(θ)|<. Here, f and g are local Lipschitz continuous. Clearly, Eq. (1.2) includes the following forms:

dx(t)=diag ( x 1 ( t ) , , x n ( t ) ) [ f ( x t ) d t + g ( x ( t ) ) d w ( t ) ] ,
(1.3)
dx(t)=diag ( x 1 ( t ) , , x n ( t ) ) [ f ( x ( t ) ) d t + g ( x t ) d w ( t ) ] .
(1.4)

Since this paper mainly examines the pathwise estimation of the solution for stochastic functional Kolmogorov-type systems with infinite delay, we assume that there exists a unique global positive solution for all discussed equations (see [8, 14]).

In the next section, we give some necessary notations and lemmas. To show our idea clearly, Section 2 also studies the pathwise estimation for general stochastic functional differential equations with infinite delay. Applying the result of Section 2, we give various conditions under which stochastic functional Kolmogorov systems with infinite delay show the nice pathwise properties in Section 3. As in the applications of Section 2 and Section 3, Section 4 discusses several special equations, including various stochastic Lotka-Volterra systems with infinite delay.

2 A general result

Throughout this paper, unless otherwise specified, we use the following notations. Let || denote the Euclidean norm in R n . If A is a vector or matrix, its transpose is denoted by A T . If A is matrix, its trace norm is denoted by |A|= trace ( A T A ) . Let R n ={x R n : x i 0for all1in}, R + n ={x R n : x i 0for all1in}, R + + n ={x R n : x i >0for all1in}. For any c= ( c 1 , , c n ) T R + + n , let c ˆ =min{ c 1 ,, c n } and c ˇ =max{ c 1 ,, c n }. Let (Ω,F,P) be a complete probability space with a filtration { F t } t 0 satisfying the usual conditions, that is, it is right continuous and increasing while F 0 contains all P-null sets. Let w(t) be an m-dimensional Brownian motion defined on the complete probability space. If x(t) is an R n -valued stochastic process on tR, we let x t ={x(t+θ):θ(,0]} for t0.

Let M 0 be the family of the probability measures μ on (,0]. Let ε 0 >0. For any ε[0, ε 0 ], we define a set of the probability measure

M ε := { μ M 0 , μ ε : = 0 e ε θ d μ ( θ ) < } .

Clearly, M ε 0 M ε M 0 and μ ε is continuously dependent on ε on [0, ε 0 ], and μ ε 1 as ε0. For the arbitrary V(x) C 2 ( R n ;R), define

V x (x)= ( V ( x ) x 1 , , V ( x ) x n ) , V x x (x)= ( 2 V ( x ) x i x j ) n × n .

The following lemma shows boundedness of polynomial functions.

Lemma 2.1 For any positive constants b, α, and the functionh(x)C( R + n ;R), ifh(x)=o( | x | α ), as|x|. Then

sup x R + n [ b | x | α + h ( x ) ] <.

Proof We may choose c>0 such that |h(x)|< | x | α for any | x | α >c, which implies b | x | α +h(x)<0. Therefore, we have

sup x R + n [ b | x | α + h ( x ) ] = sup x R + n , | x | < c [ b | x | α + h ( x ) ] <,

as required. □

To show our idea about the pathwise estimation of solutions clearly, we first consider the following general n-dimensional stochastic functional differential equation:

dx(t)=F(t, x t )dt+G(t, x t )dw(t)
(2.1)

on t0. Here,

F: R + ×BC ( R ; R n ) R n ,G: R + ×BC ( R ; R n ) R n × m

are local Lipschitz continuous and w(t) is an m-dimensional Brownian motion. Assume that Eq. (2.1) almost surely admits a unique global positive solution. Then we have the following pathwise estimation.

Theorem 2.1 Letp>0andx(t)=x(t,ξ)be the global positive solution of Eq. (2.1). If there exists a vectorc R + + n such that for anyε(0, ε 0 ]and an integerJ>0, there are constants K, K j >0, α j and probability measures μ j M ε (1jJ) such that

c T F ( t , φ ) c T φ ( 0 ) + p 1 2 [ c T G ( t , φ ) c T φ ( 0 ) ] 2 + ε log ( c T φ ( 0 ) ) K + j = 1 J K j ( 0 | φ ( θ ) | α j d μ j ( θ ) μ j ε | φ ( 0 ) | α j )
(2.2)

for anyt0andφBC( R ; R + + n ). Then for any given initial dataξBC( R ; R + + n ) L q ( R ; R n ), whereq= min 1 j J ( α j ), the solutionx(t)of Eq. (2.1) has the following property:

lim sup t log ( | x ( t ) | ) log t 1 p a.s.
(2.3)

Proof Define

V(x)= c T x,onx R + n .

For any ε(0, ε 0 ], applying the Itô formula to e ε t logV(x(t)) yields

e ε t log V ( x ( t ) ) = log V ( x ( 0 ) ) + 0 t d [ e ε s log V ( x ( s ) ) ] = log V ( ξ ( 0 ) ) + 0 t e ε s [ c T F ( s , x s ) c T x ( s ) 1 2 ( c T G ( s , x s ) c T x ( s ) ) 2 + ε log V ( x ( s ) ) ] d s + M ( t ) ,
(2.4)

where

M(t)= 0 t e ε s c T G ( s , x s ) c T x ( s ) dw(s)

is a continuous local martingale with the quadratic variation

M ( t ) , M ( t ) = 0 t e 2 ε s ( c T G ( s , x s ) c T x ( s ) ) 2 ds.

For any given kN and δ>1, the exponential martingale inequality yields

P { sup 0 t k [ M ( t ) p 2 e ε k 0 t e 2 ε s ( c T G ( s , x s ) c T x ( s ) ) 2 d s ] δ e ε k log n p } 1 k δ .

Since Σ k = 1 n δ <, the well-known Borel-Cantelli lemma yields that there exists an Ω 0 Ω with P( Ω 0 )=1 such that for any ω Ω 0 there exists an integer k 0 (ω), when k k 0 (ω) and k1tk,

M(t) p 2 0 t e ε s ( c T G ( s , x s ) c T x ( s ) ) 2 ds+ δ e ε ( t + 1 ) log ( t + 1 ) p .
(2.5)

Substituting the inequalities (2.5) into (2.4), and letting t sufficiently large, it is obtained almost surely that

e ε t logV ( x ( t ) ) logV ( ξ ( 0 ) ) + p 1 δ e ε ( t + 1 ) log(t+1)+I,

where

I= 0 t e ε s [ c T F ( s , x s ) c T x ( s ) + p 1 2 ( c T G ( s , x s ) c T x ( s ) ) 2 + ε log V ( x ( s ) ) ] ds.

By the condition (2.2), we obtain that

I 0 t e ε s { K + j = 1 J K j [ 0 | x ( s + θ ) | α j d μ j ( θ ) μ j ε | x ( s ) | α j ] } d s ε 1 K e ε t + j = 1 J K j 0 t e ε s ( 0 | x ( s + θ ) | α j d μ j ( θ ) μ j ε | x ( s ) | α j ) d s .

We may compute that

0 t e ε s 0 | x ( s + θ ) | α j d μ j ( θ ) d s = 0 d μ j ( θ ) 0 t e ε s | x ( s + θ ) | α j d s = 0 d μ j ( θ ) θ t + θ e ε ( s θ ) | x ( s ) | α j d s 0 e ε θ d μ j ( θ ) [ 0 e ε s | x ( s ) | α j d s + 0 t e ε s | x ( s ) | α j d s ] μ j ε C α j + μ j ε 0 t e ε s | x ( s ) | α j d s ,

where

C α j := 0 | ξ ( s ) | α j ds<, μ j ε := 0 e ε θ d μ j (θ)<,

for all 1jJ. Therefore,

e ε t logV ( x ( t ) ) logV ( ξ ( 0 ) ) + ε 1 K e ε t + j = 1 J K j μ j ε C α j + p 1 δ e ε ( t + 1 ) log(t+1).

This implies

lim sup t log ( V ( x ( t ) ) ) log t δ e ε p ,a.s.

Noting the inequality

0< c ˆ |x|V(x)|c||x|,forx R + + n ,

and letting δ1, ε0, we obtain that

lim sup t log ( | x ( t ) | ) log t 1 p ,a.s.

as required. □

The result (2.3) shows that for any ε>0, there is a positive random time T ε such that, with probability one, for any t> T ε ,

| x ( t ) | p t 1 + ε .
(2.6)

In other words, with probability one, the solution will not grow faster than t ( 1 + ε ) / p .

In this theorem, it is a key to compute the condition (2.2). In the following section, we apply Theorem 2.1 to examine stochastic functional Kolmogorov-type systems.

3 Main result

This section mainly applies the result of Theorem 2.1 to Eq. (1.2). For any x R + + n and φBC( R ; R + + n ), we firstly list the following conditions for both f and g that we will need. (H1) = These exist α>0, κ, κ ¯ 0 and the probability measure μ M ε , where ε(0, ε 0 ] and αε, such that

| f ( φ ) | κ | φ ( 0 ) | α + κ ¯ 0 | φ ( θ ) | α dμ(θ)+o ( | φ ( 0 ) | α ) .

; (H2) = There exist β>0, λ, λ ¯ 0 and the probability measure ν M ε , where ε(0, ε 0 ] and βε, such that

| g ( φ ) | λ | φ ( 0 ) | β + λ ¯ 0 | φ ( θ ) | β dν(θ)+o ( | φ ( 0 ) | β ) .

; (H3) = There exist c= ( c 1 , , c n ) T R + + n , β,b>0, σ0 and the probability measure ν ¯ M ε , where ε(0, ε 0 ] and 2βε, such that

| φ ( 0 ) | 2 [ φ T ( 0 ) C g ( φ ) ] 2 b | φ ( 0 ) | 2 β σ 0 | φ ( θ ) | 2 β d ν ¯ (θ)+o ( | φ ( 0 ) | 2 β ) ,

where C=diag( c 1 ,, c n ).; (H4) = There exist c R + + n , α,b>0, σ0 and the probability measure μ ¯ M ε , where ε(0, ε 0 ] and αε, such that

| φ ( 0 ) | 1 φ T (0)Cf(φ)b | φ ( 0 ) | α +σ 0 | φ ( θ ) | α d μ ¯ (θ)+o ( | φ ( 0 ) | α ) ,

where C=diag( c 1 ,, c n ).. When f(x) and g(x) replace f(φ) and g(φ), the above conditions may be rewritten as (H1) = These exist α>0, κ0 such that

| f ( x ) | κ | x | α +o ( | x | α ) .

; (H2) = There exist β>0, λ0 such that

| g ( x ) | λ | x | β +o ( | x | β ) .

; (H3) = There exist c R + + n , β,b>0 such that

[ x T C g ( x ) ] 2 b | x | 2 β + 2 +o ( | x | 2 β + 2 ) ,

where C=diag( c 1 ,, c n ).; (H4) = There exist c R + + n , α,b>0 such that

x T Cf(x)b | x | α + 1 +o ( | x | α + 1 ) ,

where C=diag( c 1 ,, c n ).. Here, we emphasize that the same letter represents the same parameter when we use the several conditions simultaneously. In the following sections, we always assume that the initial data x 0 BC( R n ; R + + n ) L ( α β ) ( R n ; R n ). Applying the conditions (H1) and (H3) to stochastic functional Kolmogorov systems (1.2) gives

Theorem 3.1 Under the conditions (H 1) and (H 3), for the global positive solutionx(t)of Eq. (1.2), if one of the following conditions

p=1,α<2β,b>σ;
(3.1a)
0<p<1,α=2β,b>σ+ 2 | c | 2 ( κ + κ ¯ ) 1 p
(3.1b)

holds, then

lim sup t log ( | x ( t ) | p ) log ( t ) 1,a.s.
(3.2)

Proof To apply Theorem 2.1, we need to compute the condition (2.2). Substituting F(t,φ)=diag( φ 1 (0),, φ n (0))f(φ) and G(t,φ)=diag( φ 1 (0),, φ n (0))g(φ) into the condition (2.2) yields

Φ ε : = φ T ( 0 ) C f ( φ ) c T φ ( 0 ) + p 1 2 [ φ T ( 0 ) C g ( t , φ ) c T φ ( 0 ) ] 2 + ε log ( c T φ ( 0 ) ) = : I 1 + I 2 + ε log ( c T φ ( 0 ) ) ,
(3.3)

where C=diag( c 1 ,, c n ). By the condition (H1),

I 1 max 1 i n { f i ( φ ) } | f ( φ ) | κ | φ ( 0 ) | α + κ ¯ 0 | φ ( θ ) | α d μ ( θ ) + o ( | φ ( 0 ) | α ) .

Noting p1, by the condition (H3),

I 2 p 1 2 | c | 2 | φ ( 0 ) | 2 [ φ T C g ( φ ) ] 2 p 1 2 | c | 2 [ b | φ ( 0 ) | 2 β σ 0 | φ ( θ ) | 2 β d ν ¯ ( θ ) + o ( | φ ( 0 ) | 2 β ) ] .

Substituting I 1 and I 2 into (3.3) and noting that εlog( c T φ(0))o( | φ ( 0 ) | α ), we get

Φ ε κ ¯ 0 | φ ( θ ) | α d μ ( θ ) + σ ( 1 p ) 2 | c | 2 0 | φ ( θ ) | 2 β d ν ¯ ( θ ) + κ | φ ( 0 ) | α b ( 1 p ) 2 | c | 2 | φ ( 0 ) | 2 β + o ( | φ ( 0 ) | 2 β ) = κ ¯ [ 0 | φ ( θ ) | α d μ ( θ ) μ ε | φ ( 0 ) | α ] + σ ( 1 p ) 2 | c | 2 [ 0 | φ ( θ ) | 2 β d ν ¯ ( θ ) ν ¯ ε | φ ( 0 ) | 2 β ] + I ,

where

I= 1 p 2 | c | 2 (bσ ν ¯ ε ) | φ ( 0 ) | 2 β +(κ+ κ ¯ μ ε ) | φ ( 0 ) | α +o ( | φ ( 0 ) | 2 β ) .
(3.4)

If the condition (3.1a) holds, choosing δ(0,1) to replace p in (3.4), then we have

I= 1 δ 2 | c | 2 (bσ ν ¯ ε ) | φ ( 0 ) | 2 β +o ( | φ ( 0 ) | 2 β ) =: b 1 | φ ( 0 ) | 2 β +o ( | φ ( 0 ) | 2 β ) .

Noting b>σ and ν ¯ ε 1 as ε0, choose ε sufficiently small such that b 1 >0. Lemma 2.1 gives Iconst, which implies the condition (2.2) is satisfied. Letting δ1, Theorem 2.1 gives the desired result under p=1.

If the condition (3.1b) holds,

I = 1 p 2 | c | 2 ( b σ ν ¯ ε 2 | c | 2 ( κ + κ ¯ μ ε ) 1 p ) | φ ( 0 ) | 2 β + o ( | φ ( 0 ) | 2 β ) = : b 2 | φ ( 0 ) | 2 β + o ( | φ ( 0 ) | 2 β ) .

By the condition (3.1b), choose ε sufficiently small such that b 2 >0, so we have Iconst, which implies the condition (2.2) and further gives the desired result by Theorem 2.1. □

Applying Theorem 3.1 to Eq. (1.3), the condition (H3) should be replaced by (H3), which implies σ=0. This result may be described as follows.

Corollary 3.2 Under the conditions (H 1) and (H 3), for the global positive solutionx(t)of Eq. (1.3), if one of the following conditions

p=1,α<2β,b>σ;
(3.5a)
0<p<1,α=2β,b(1p)>2 | c | 2 (κ+ κ ¯ )
(3.5b)

is satisfied, then (3.2) holds.

Applying Theorem 3.1 to Eq. (1.4), the condition (H1) should be replaced by (H1), which is equivalent to choose κ ¯ =0 in (H1). Then we may obtain the following corollary.

Corollary 3.3 Under the conditions (H 1) and (H 3), for the global positive solutionx(t)of Eq. (1.4), if one of the following conditions

p=1,α<2β,b>σ;
(3.6a)
0<p<1,α=2β,b>σ+ 2 | c | 2 κ 1 p
(3.6b)

holds, then

lim sup t log ( | x ( t ) | p ) log ( t ) 1,a.s.
(3.7)

In these results above, the condition (H3) or (H3) plays an important role to suppress growth of the solution. To use the condition (H3) or (H3), it is necessary to require p1. To avoid the condition (H3) or (H3), we may impose another condition on the function f to suppress growth of the solution. This idea leads to the following theorem.

Theorem 3.4 Under the conditions (H 2) and (H 4), for the global positive solutionx(t)of Eq. (1.2), if

α>2β,b>|c|σ/ c ˆ
(3.8)

hold, then

lim sup t log ( | x ( t ) | ) log ( t ) 0,a.s.
(3.9)

If p1 and

α=2β,b> | c | σ c ˆ + | c | ( λ + λ ¯ ) 2 ( p 1 ) 2
(3.10)

hold, then

lim sup t log ( | x ( t ) | p ) log ( t ) 1,a.s.
(3.11)

Proof Repeating the proof process of Theorem 3.1 obtains Eq. (3.3). Then by the conditions (H2) and (H4), we may estimate I 1 and I 2 . By the condition (H4),

I 1 | φ ( 0 ) | 1 c T φ ( 0 ) [ b | φ ( 0 ) | α + σ 0 | φ ( θ ) | α d μ ¯ ( θ ) + o ( | φ ( 0 ) | α ) ] b | c | | φ ( 0 ) | α + σ c ˆ 0 | φ ( θ ) | α d μ ¯ ( θ ) + o ( | φ ( 0 ) | α ) .

Note the elementary inequality: for any x,y0 and u(0,1)

( x + y ) 2 x 2 u + y 2 1 u .

Then for any u,v(0,1), by the condition (H2) and the Hölder inequality,

I 2 ( p 1 ) + 2 [ i = 1 n c i φ i ( 0 ) c T φ ( 0 ) | g i ( φ ) | ] 2 ( p 1 ) + 2 max 1 i n | g i ( φ ( 0 ) ) | 2 ( p 1 ) + 2 [ λ | φ ( 0 ) | β + λ ¯ 0 | φ ( θ ) | β d ν ( θ ) + o ( | φ ( 0 ) | β ) ] 2 ( p 1 ) + 2 u [ λ | φ ( 0 ) | β + λ ¯ 0 | φ ( θ ) | β d ν ( θ ) ] 2 + o ( | φ ( 0 ) | 2 β ) ( p 1 ) + 2 u [ λ 2 v | φ ( 0 ) | 2 β + λ ¯ 2 1 v 0 | φ ( θ ) | 2 β d ν ( θ ) ] + o ( | φ ( 0 ) | 2 β ) .

Substituting I 1 and I 2 into (3.3) yields

Φ ε σ c ˆ [ 0 | φ ( θ ) | α d μ ¯ ( θ ) μ ¯ ε | φ ( 0 ) | α ] + ( p 1 ) + λ ¯ 2 2 u ( 1 v ) [ 0 | φ ( θ ) | 2 β d ν ( θ ) ν ε | φ ( 0 ) | 2 β ] + I ,

where

I= ( b | c | σ μ ¯ ε c ˆ ) | φ ( 0 ) | α + ( p 1 ) + 2 u ( λ 2 v + λ ¯ 2 ν ε 1 v ) | φ ( 0 ) | 2 β +o ( | φ ( 0 ) | α ) .

If the condition (3.8) holds, we can choose sufficiently small ε such that b>|c|σ μ ¯ ε / c ˆ >0. Then, by Lemma 2.1, we have

I= ( b | c | σ μ ¯ ε c ˆ ) | φ ( 0 ) | α +o ( | φ ( 0 ) | α ) const.

Then, for any p1, Theorem 2.1 gives

lim sup t log ( | x ( t ) | ) log t 1 p ,a.s.

Letting p, we get the desired assertion (3.9).

If the condition (3.10) holds, noting α=2β and p1, we have

I= [ b | c | σ μ ¯ ε c ˆ ( p 1 ) 2 u ( λ 2 v + λ ¯ 2 ν ε 1 v ) ] | φ ( 0 ) | α +o ( | φ ( 0 ) | α ) .

Assume that λ, λ ¯ 0 (when λ, λ ¯ =0, the computation is obvious). Choose v=λ/(λ+ λ ¯ )(0,1) such that

b ¯ := b | c | σ μ ¯ ε c ˆ ( p 1 ) 2 u ( λ 2 v + λ ¯ 2 ν ε 1 v ) = b | c | σ μ ¯ ε c ˆ ( p 1 ) 2 u (λ+ λ ¯ )(λ+ λ ¯ ν ε ).

Noting that the condition (3.10) holds, choose ε sufficiently small and u sufficiently near 1 such that b ¯ >0. So Iconst. Applying Theorem 2.1 therefore gives the desired assertion (3.11). □

The result (3.9) is a very strong result. It shows that growth of the solution x(t) is so slow that it is near to be bound. By this result, we know that for any ε>0, there is a positive random time T ε such that, with probability one, for any t T ε ,

| x ( t ) | t ε .
(3.12)

In other words, with probability one, the solution will not grow fast than t ε .

Applying Theorem 3.4 to Eq. (1.3), the condition (H2) should be replaced by (H2), which implies that λ ¯ =0 in (H2). We may obtain the following corollary.

Corollary 3.5 Under the conditions (H 2) and (H 4), for the global positive solutionx(t)of Eq. (1.3), if

α>2β,b>|c|σ/ c ˆ ,
(3.13)

then (3.9) holds. Ifp1and

α=2β,b> | c | σ c ˆ + | c | λ 2 ( p 1 ) 2 ,
(3.14)

then (3.11) holds.

Applying Theorem 3.4 to Eq. (1.4), the condition (H4) should be replaced by (H4), which implies that σ=0 in (H4). The corollary follows.

Corollary 3.6 Under the conditions (H 2) and (H 4), for the global positive solutionx(t)of Eq. (1.4), if

α>2β,
(3.15)

then (3.9) holds. Ifp1and

α=2β,2b>|c| ( λ + λ ¯ ) 2 (p1),
(3.16)

then (3.11) holds.

Comparing Theorem 3.1 with Theorem 3.4, we conclude that in Theorem 3.1, the function g plays an important role to suppress growth of the solution in condition (H3). While in Theorem 3.4, the function f is the main factor to suppress growth of the solution in condition (H4).

4 Some special case

In this section, some special Kolmogorov-type equations are considered by applying the results in the previous two sections to obtain some pathwise estimation, where some special noises are chosen. We firstly consider the n-dimensional stochastic functional equations

dx(t)=diag ( x 1 ( t ) , , x n ( t ) ) [ f ( x t ) d t + q d w ( t ) ] ,
(4.1)

which is equivalent to choosing g(x)q R n in Eq. (1.2). Clearly, the condition (H2) is satisfied. Applying Corollary 3.5 to Eq. (4.1) gives the following theorem.

Theorem 4.1 Under the condition (H 4), ifb>|c|σ/ c ˆ , for the global positive solutionx(t)of Eq. (4.1), then the result (3.9) holds.

Then we consider the functional Lotka-Volterra-type system of Eq. (4.1)

dx(t)=diag ( x 1 ( t ) , , x n ( t ) ) [ ( a + A x ( t ) + B 0 x ( t + θ ) d μ ( θ ) ) d t + q d w ( t ) ] ,
(4.2)

where a R n A,B R n × n and μ M ε for some suitable ε(0, ε 0 ]. For any c= ( c 1 , , c n ) T R + + n . Let C=diag( c 1 ,, c n ), Then we have

φ T ( 0 ) C f ( φ ) = φ T ( 0 ) C [ a + A φ ( 0 ) + B 0 φ ( θ ) d μ ( θ ) ] φ T ( 0 ) C A φ ( 0 ) + | φ T ( 0 ) C B | 0 | φ ( θ ) | d μ ( θ ) + o ( | φ ( 0 ) | 2 ) 1 2 λ max + ( C A + A T C ) | φ ( 0 ) | 2 + c ˇ | B | | φ ( 0 ) | 0 | φ ( θ ) | d μ ( θ ) + o ( | φ ( 0 ) | 2 ) = : | φ ( 0 ) | [ b | φ ( 0 ) | + σ 0 | φ ( θ ) | d μ ( θ ) ] + o ( | φ ( 0 ) | 2 ) ,
(4.3)

where 2b= λ max + (CA+ A T C)σ= c ˇ |B|. Here we use the notation

λ max + (M)= sup x R + , | x | = 1 x T Mx,for a symmetric matrixM R n × n ,

which was introduced by Bahar and Mao [2]. Let us emphasize that this is different from the largest eigenvalue λ max (M) of the matrix M. Recall the nice property of the largest eigenvalue:

λ max (M)= sup x R , | x | = 1 x T Mx.

Clearly, λ max + (M) λ max (M), which implies that λ max + (M)<0 if the matrix M is negative definite. (4.3) shows that f satisfies the condition (H4) when we choose α=1. The condition b>|c|σ/ c ˆ is equivalent to

λ max + ( C A + A T C ) >2|c| c ˇ |B|/ c ˆ ,
(4.4)

then Theorem 4.1 implies the following corollary.

Corollary 4.2 If there existsc= ( c 1 , , c n ) T R + + n such thatC=diag( c 1 ,, c n )satisfies the condition (4.4), for the global positive solutionx(t)of Eq. (4.2) has the property (3.9).

If we choose μ is the Dirac measure at some point 0<τ<, then Eq. (4.2) may be rewritten as

dx(t)=diag ( x 1 ( t ) , , x n ( t ) ) [ ( a + A x ( t ) + B x ( t τ ) ) d t + q d w ( t ) ] ,
(4.5)

which is another Lotka-Volterra type delay equation that has been investigated by Bahar et al. [2]. Applying Corollary 4.2 to Eq. (4.5) gives the following corollary.

Corollary 4.3 If there existsc= ( c 1 , , c n ) T R + + n such thatC=diag( c 1 ,, c n ),

λ max + ( C A + A T C ) >2|B||c| c ˇ / c ˆ ,
(4.6)

then the global positive solutionx(t)of Eq. (4.5) has the property (3.9).

Now we consider another Kolmogorov-type equation

dx(t)=diag( x 1 ,, x n ) [ f ( x t ) d t + Q x ( t ) d w ( t ) ] ,
(4.7)

where Q=[ q i j ] R n × n . Clearly, here g satisfies the condition (H2) when we choose that λ=|Q| and β=1. If the matrix Q satisfies the condition

q i i >0if1in,while q i j 0ifij,
(4.8)

then g satisfies the condition (H3) when we choose that b= max 1 i n { c i 2 q i i 2 }. Then Corollary 3.2 gives the following theorem.

Theorem 4.4 Under the conditions (4.8) and (H 1), for the global positive solutions of Eq. (4.7), if one of the following two conditions

p=1,α<2;
(4.9a)
0<p<1,α=2, max i i n { c i 2 q i i 2 } > 2 | c | 2 ( κ + κ ¯ ) 1 p ,
(4.9b)

is satisfied, wherec= ( c 1 , , c n ) T R + + n , then (3.2) holds.

Roughly speaking, Theorem 4.4 shows that under the condition (4.8), if the growth order α of f is smaller than 2 (or α=2 under some conditions), (3.2) is satisfied for all p1. To satisfy (3.2) under p1, the condition (4.8) plays a crucial role. But here f is only required to satisfy an unrestrictive condition, which includes the linear growth condition. If f is the linear growth function, namely,

f(φ)=a+Aφ(0)+B 0 φ(θ)dμ(θ)

then Eq. (4.7) may be rewritten as

d x ( t ) = diag ( x 1 ( t ) , , x n ( t ) ) × [ ( a + A x ( t ) + B 0 x ( t + θ ) d μ ( θ ) ) d t + Q x ( t ) d w ( t ) ] ,
(4.10)

where Q R n × n , which is another stochastic functional Lotka-Volterra systems. Clearly, f satisfies the condition (H1) when we choose that α=1, κ=1, κ ¯ =|B|. So, for p=1, we have the following theorem.

Theorem 4.5 Under the condition (4.8), the global positive solution of Eq. (4.10) has the property

lim sup t log x ( t ) log t 1,a.s.

We further choose that μ is a Dirac measure at the point τ, then Eq. (4.10) is written as the delay stochastic Lotka-Volterra systems

dx(t)=diag ( x 1 ( t ) , , x n ( t ) ) [ ( a + A x ( t ) + B x ( t τ ) ) d t + Q x ( t ) d w ( t ) ] ,
(4.11)

which is discussed by [1] where Theorem 5.3 is obtained. This means that our result is more general.

References

  1. Bahar A, Mao X: Stochastic delay Lotka-Volterra model. J. Math. Anal. Appl. 2004, 292: 364–380. 10.1016/j.jmaa.2003.12.004

    Article  MathSciNet  Google Scholar 

  2. Bahar A, Mao X: Stochastic delay population dynamics. Int. J. Pure Appl. Math. 2004, 4: 377–400.

    MathSciNet  Google Scholar 

  3. Tineo A: Existence of global attractors for a class of periodic Kolmogorov systems. J. Math. Anal. Appl. 2003, 279: 365–371. 10.1016/S0022-247X(02)00332-3

    Article  MathSciNet  Google Scholar 

  4. Granados B: Permanence for a large class of planar periodic Kolmogorov systems. J. Math. Anal. Appl. 2002, 268: 701–706. 10.1006/jmaa.2000.7080

    Article  MathSciNet  Google Scholar 

  5. Tang B, Kuang Y: Permanence in Kolmogorov-type systems of nonautonomous functional differential equations. J. Math. Anal. Appl. 1996, 197: 427–447. 10.1006/jmaa.1996.0030

    Article  MathSciNet  Google Scholar 

  6. Chen F: Global asymptotic stability in n -species non-autonomous Lotka-Volterra competitive systems with infinite delays and feedback control. Appl. Math. Comput. 2005, 170: 1452–1468. 10.1016/j.amc.2005.01.028

    Article  MathSciNet  Google Scholar 

  7. Wu F, Hu S: Stochastic functional Kolmogorov-type population dynamics. J. Math. Anal. Appl. 2008, 347: 534–549. 10.1016/j.jmaa.2008.06.038

    Article  MathSciNet  Google Scholar 

  8. Wu F, Hu S: On the pathwise growth rates of large fluctuations of stochastic population systems with innite delay. Stoch. Models 2011, 27: 94–119. 10.1080/15326349.2011.542733

    Article  MathSciNet  Google Scholar 

  9. Wu F, Hu S, Liu Y: Positive solution and its asymptotic behaviour of stochastic functional Kolmogorov-type system. J. Math. Anal. Appl. 2010, 364: 104–118. 10.1016/j.jmaa.2009.10.072

    Article  MathSciNet  Google Scholar 

  10. Wu F, Hu Y: Pathwise estimation of the stochastic functional Kolmogorov-type system. J. Franklin Inst. 2009, 346: 191–205. 10.1016/j.jfranklin.2008.06.011

    Article  MathSciNet  Google Scholar 

  11. Bereketoglu H, Gyori I: Golbal asymptotic stability in a nonautonomous Lotka-Volterra type systems with infinite delay. J. Math. Anal. Appl. 1997, 210: 279–291. 10.1006/jmaa.1997.5403

    Article  MathSciNet  Google Scholar 

  12. Wang J, Zhou L, Tang Y: Asymptotic periodicity of the Volterra equation with infinite delay. Nonlinear Anal. 2008, 68: 315–328. 10.1016/j.na.2006.10.050

    Article  MathSciNet  Google Scholar 

  13. Xu R, Chaplain MAJ, Chen L: Global asymptotic stability in n -species nonautonmous Lotka-Volterra competitive systems with infinited delays. Appl. Math. Comput. 2002, 130: 295–309. 10.1016/S0096-3003(01)00097-2

    Article  MathSciNet  Google Scholar 

  14. Zhou S, Hu S, Cen L: Stochastic Kolmogorov-type system with infinite delay. Appl. Math. Comput. 2011, 218: 207–218. 10.1016/j.amc.2011.05.104

    Article  MathSciNet  Google Scholar 

  15. Faria T: Global attractivity in scalar delayed differential equations with applications to population models. J. Math. Anal. Appl. 2004, 289: 35–54. 10.1016/j.jmaa.2003.08.013

    Article  MathSciNet  Google Scholar 

  16. He X, Gopalsamy K: Persistence, attractivity, and delay in facultative mutualism. J. Math. Anal. Appl. 1997, 215: 154–173. 10.1006/jmaa.1997.5632

    Article  MathSciNet  Google Scholar 

  17. Mao X, Marion G, Renshaw E: Environmental noise supresses explosion in population dynamics. Stoch. Process. Appl. 2002, 97: 96–110.

    MathSciNet  Google Scholar 

  18. Mao X, Sabanis S, Renshaw E: Asymptotic behaviour of the stochastic Lotka-Volterra model. J. Math. Anal. Appl. 2003, 287: 141–156. 10.1016/S0022-247X(03)00539-0

    Article  MathSciNet  Google Scholar 

  19. Kuang Y, Smith HL: Global stability for infinite delay Lotka-Volterra type systems. J. Differ. Equ. 1993, 103: 221–246. 10.1006/jdeq.1993.1048

    Article  MathSciNet  Google Scholar 

  20. Muroya Y: Persistence and global stability in Lotka-Volterra delay differential systems. Appl. Math. Lett. 2004, 17: 759–800. 10.1016/j.aml.2004.06.002

    Article  MathSciNet  Google Scholar 

  21. Teng Z: The almost periodic Kolmogorov competitive systems. Nonlinear Anal. 2000, 42: 1221–1230. 10.1016/S0362-546X(99)00149-2

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This work was supported in part by the National Natural Science Foundation of China under Grant nos. 11101054, 11101434, the Open Fund Project of Key Research Institute of Philosophies and Social Sciences in Hunan Universities under Grant no. 11FEFM11, the Scientific Research Funds of Hunan Provincial Science and Technology Department of China under Grant no. 2012SK3096, and Hunan Provincial Natural Science Foundation of China under Grant no. 12jj4005.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yong Xu.

Additional information

Competing interests

The authors declare that they have no competing interests.

Authors’ contributions

The authors contributed equally and significantly in writing this article. The authors read and approved the final manuscript.

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and permissions

About this article

Cite this article

Zhu, E., Xu, Y. Pathwise estimation of stochastic functional Kolmogorov-type systems with infinite delay. J Inequal Appl 2012, 171 (2012). https://doi.org/10.1186/1029-242X-2012-171

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1186/1029-242X-2012-171

Keywords