Zhang et al. Advances in Difference Equations (2016) 2016:264 DOI 10.1186/s13662-016-0993-1
RESEARCH
Open Access
Analysis of a nonautonomous stochastic predator-prey model with Crowley-Martin functional response Yan Zhang1,2 , Shihua Chen1* and Shujing Gao2 *
Correspondence:
[email protected] 1 School of Mathematics and Statistics, Wuhan University, Wuhan, 430000, P.R. China Full list of author information is available at the end of the article
Abstract The objective of this paper is to study some qualitative dynamic properties of a nonautonomous predator-prey model with stochastic perturbation and Crowley-Martin functional response. The existence of a global positive solution and stochastically ultimate boundedness are obtained. Sufficient conditions for extinction, persistence in the mean, and stochastic permanence of the system are established. We also derive conditions to guarantee the global attractiveness and stochastic persistence in probability of the model. Our theoretical results are confirmed by numerical simulations. Keywords: stochastic nonautonomous model; persistence; extinction; functional response
1 Introduction Predator-prey systems play an important role in studying the dynamics of interacting species. During the last decades, lots of predator-prey models have been proposed and analyzed from various prospectives. When investigating biological phenomena, functional response is one of the most important factors that affect dynamical properties of biological and mathematical models [–]. Many researchers have paid their attention to predatorprey systems with prey-dependent functional response. However, the predator functional response occurs quite frequently in nature and laboratory, such as searching for food and sharing, or competing for, food [, ]. Therefore, we must not ignore the predator functional response to prey because of the effect of such a response on dynamical system properties, and many types of predator-dependent functions have been proposed and analyzed. The deterministic predator-prey model with Crowley-Martin functional response can be expressed as follows: ω(t)y , + a(t)x + b(t)y + a(t)b(t)xy f (t)x y˙ = y –g(t) – h(t)y + , + a(t)x + b(t)y + a(t)b(t)xy x˙ = x r(t) – k(t)x –
()
where x(t) and y(t) represent the population densities of the prey and predator at time t, respectively. r(t) and g(t) are the growth rate of the prey and predator, respectively, k(t) and © 2016 Zhang et al. This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
Zhang et al. Advances in Difference Equations (2016) 2016:264
Page 2 of 28
h(t) stand for the density-dependent coefficients of species x and y, ω(t) is the capturing rate of predator, and f (t) denotes the rate of conversion of nutrients into the production ω(t)x(t)y(t) of predator at time t. The ratio +a(t)x(t)+b(t)y(t)+a(t)b(t)x(t)y(t) is the functional response, where a(t) and b(t) describe the effects of handling time and the magnitude of interference among predators. Meanwhile, population models in the real world are always affected by a lot of unpredictably environmental noises. To predict richer and more complex dynamics of the model, stochastic perturbations are introduced into the population models (see, e.g., [– ]). In common, there are four approaches including stochastic effects in the model [], that is, through time Markov chain model [], parameter perturbation [], being proportional to the variables [], and robusting the positive equilibria of deterministic models. Stochastic perturbation will bring effect on almost all parameters of the model in various different ways, and it is valuable to consider more than one approach to describe the random effects on the system. In this paper, we adopt a combination of the second and third approaches to include stochastic perturbations, that is, we assume that the stochastic perturbations are of white noise type and proportional to x(t), y(t), influenced respectively on x˙ (t) and y˙ (t) in system (); Moreover, the capturing and conversion rate coefficients ω(t) and f (t) are changed as ω(t) + σ (t)B˙ (t), and f (t) + δ (t)B˙ (t), respectively. Then, in accordance with system (), we propose the following stochastic predator-prey model: dx = x r(t) – k(t)x –
ω(t)y dt + a(t)x + b(t)y + a(t)b(t)xy σ (t)y dB (t), + x σ (t) + + a(t)x + b(t)y + a(t)b(t)xy f (t)x dy = y –g(t) – h(t)y + dt + a(t)x + b(t)y + a(t)b(t)xy δ (t)x dB (t), + y δ (t) + + a(t)x + b(t)y + a(t)b(t)xy
()
where all the coefficients are positive, continuous, and differentiable bounded functions on R+ = [, +∞), σi (t) and δi (t) (i = , ) denote the intensities of the white noises, B (t), B (t) are independent Brownian motions defined on a complete probability space (, F , P) with a filtration {Ft }t∈R+ satisfying the usual conditions (i.e., it is right continuous and increasing with F containing all P-null sets) []. We denote R+ = {X = (x, y)|x > , y > } and |X(t)| = (x (t) + y (t)) . To proceed, we present some useful definitions and notations: t f u = supt≥ f (t), f l = inft≥ f (t), f (t) = t f (s) ds, f ∗ = lim supt→+∞ f (t), f∗ = lim inft→+∞ f (t). Extinction: limt→+∞ x(t) = a.s. Non-persistence in the mean: x∗ = . Weak persistence in the mean: x∗ > . Strong persistence in the mean: x∗ > . Stochastic permanence: there are constants δ > , χ > such that P∗ {|x(t)| ≥ δ} ≥ – ε and P∗ {|x(t)| ≤ χ} ≥ – ε.
Zhang et al. Advances in Difference Equations (2016) 2016:264
Page 3 of 28
This paper is arranged as follows. In Section , we show that there exists a unique positive solution of system () and prove its boundedness. In Section , we obtain sufficient conditions for extinction, persistence in the mean, and stochastic permanence. The global attractiveness and stochastic persistence in probability of system () are analyzed in Section . Finally, some numerical simulations to support our analytical findings are given in Section .
2 Existence, uniqueness, and stochastically ultimate boundedness Theorem For any given value (x(), y()) = X ∈ R+ , there is a unique solution (x(t), y(t)) on t ≥ , and the solution remains in R+ with probability one. The proof of Theorem is standard, and we present it in the Appendix. Theorem The solutions of model () are stochastically ultimately bounded for any initial value X = (x , y ) ∈ R+ . Proof We need to show that for any ε ∈ (, ), there exists a positive constant δ = δ(ε) such that for any given initial value X ∈ R+ , the solution X(t) to () has the property lim sup P X(t) > δ < ε. t→∞
Let V (x) = xp and V (y) = yp for (x, y) ∈ R+ and p > . Then, we obtain d xp = pxp– dx + .p(p – )xp– (dx) ω(t)y p = px r(t) – k(t)x – dt + a(t)x + b(t)y + a(t)b(t)xy σ (t)y p + .p(p – )x σ (t) + dt + a(t)x + b(t)y + a(t)b(t)xy σ (t)y dB (t) + pxp σ (t) + + a(t)x + b(t)y + a(t)b(t)xy σ (t)y = LV (x, y) dt + pxp σ (t) + dB (t) + a(t)x + b(t)y + a(t)b(t)xy and d yp = pyp –g(t) – h(t)y +
f (t)x dt + a(t)x + b(t)y + a(t)b(t)xy δ (t)x + .p(p – )yp δ (t) + dt + a(t)x + b(t)y + a(t)b(t)xy δ (t)x p dB (t) + py δ (t) + + a(t)x + b(t)y + a(t)b(t)xy δ (t)x dB (t). = LV (x, y) + pyp δ (t) + + a(t)x + b(t)y + a(t)b(t)xy
Zhang et al. Advances in Difference Equations (2016) 2016:264
Page 4 of 28
Here, LV (x, y) ≤ pxp (ru – k l x + .(p – )(σu + δu ) al
σu ) ), bl
u
and LV (x, y) ≤ pyp ( fal + .p(δu +
– hl y). Thus,
dE[xp (t)] σu p E x (t) – k l E xp+ (t) ≤ p ru + .(p – ) σu + l dt b
+ p
σu p E x (t) – k l E xp (t) ≤ p ru + .(p – ) σu + l b
σu – k l E xp (t) p ≤ pE xp (t) ru + .p σu + l b
()
and
p p
fu δu dE[yp (t)] u l – h . E y ≤ pE yp (t) + .p δ + (t) dt al bl For (), we consider the equation dz(t) = pz(t) dt
σu – k l z(t) p ru + .p σu + l b
with initial value z() = z . Obviously, we can obtain that
/p
z (ru + .p(σu +
z(t) =
u
(ru + .p(σu +
σ σu –(ru +.p(σu + l ) )t b ) )e bl
p
σu ) ) bl
.
u
/p
σ –(ru +.p(σu + l ) )t
+ k l z ( – e
b
)
Letting t → ∞, we have lim z(t) =
ru + .p(σu +
σu p ) bl
kl
t→∞
.
Thus, by the comparison theorem we get lim sup Ex ≤ p
ru + .p(σu +
σu p ) bl
kl
t→∞
G < +∞.
Similarly, we obtain fu lim sup Eyp ≤
al
t→∞
+ .p(δu + hl
δu p ) bl
G < +∞.
Thus, for a given constant ε > , there exists T > such that
E xp (t) ≤ G + ε
and E yp (t) ≤ G + ε
for all t > T. In accordance with the continuity of E[xp (t)] and E[yp (t)], there are M (p), M (p) > satisfying E[xp (t)] ≤ M (p) and E[yp (t)] ≤ M (p) for t ≤ T. Denote M (p) = max M (p), G + ε ,
M (p) = max M (p), G + ε .
Zhang et al. Advances in Difference Equations (2016) 2016:264
Page 5 of 28
Then, for all t ∈ R+ , we have
E xp (t) ≤ M (p),
E yp (t) ≤ M (p).
Consequently, p EX(t) ≤ Mp < +∞, p
where Mp = (M (p) + M (p)). By virtue of the Chebyshev inequality, the proof is completed.
3 Persistence and extinction In this part, we show the long-time dynamical properties of system (), including extinction, persistence in the mean, and stochastic permanence in Theorems -. Before giving the theorems, we introduce some assumptions and lemmas. In [], the author considered the stochastic differential equation dx(t) = diag x (t), . . . , xn (t) b(t) + A(t)x(t) dt + σ (t) dw(t),
()
where x = (x , . . . , xn )T , b = (b , . . . , bn )T , A = (aij )n×n , w(t) = (w (t), . . . , wn (t))T , σ (t) = (σij (t))n×n and obtained the following theorem (Theorem . in []): Suppose that all the parameters bi (t), aij (t), and σij (t) ( ≤ i, j ≤ n) are bounded on t ∈ R+ and there exist positive numbers c , . . . , cn satisfying –λ := sup λ+max CA + AT C < ,
()
t≥
where C = diag(c , . . . , cn ) and λ+max (A) = supx∈Rn+ ,|x|= xT Ax. Then, for any initial value x() ∈ Rn+ , the solution x(t) of the SDE () has the property lim sup t→∞
ln(|x(t)|) ≤ ln t
a.s.
Introducing an auxiliary matrix A = (a¯ ij )n×n , where a¯ ij = supt≥ a¯ ij (t), ≤ i, j ≤ n, the author also achieved a more useful conclusion to verify condition (): If –A is a nonsingular M-matrix, then condition () holds. Thus, we obtain the following lemma. Assumption (H) k l hl > f u ωu . Lemma If Assumption (H) holds, then the solution X(t) = (x(t), y(t)) of system () with initial value (x , y ) ∈ R+ has the following properties: lim sup t→∞
ln x(t) ≤ , ln t
lim sup t→∞
ln y(t) ≤ ln t
a.s.,
()
and there is a positive constant K such that lim sup E x(t) ≤ K, t→∞
lim sup E y(t) ≤ K. t→∞
()
Zhang et al. Advances in Difference Equations (2016) 2016:264
Page 6 of 28
Proof By virtue of the useful conclusion obtained by Cheng [], we achieve that under Assumption (H), the conditions of Theorem . in [] are satisfied. Then inequality () is proved. Next, we turn to (). Denote V (x, y) = et (x + y). Then by Itô’s formula we have
ω(t)y dV (x, y) = et x + y + x r(t) – k(t)x – + a(t)x + b(t)y + a(t)b(t)xy f (t)x + y –g(t) – h(t)y + dt + a(t)x + b(t)y + a(t)b(t)xy σ (t)xy dB (t) + et σ (t)x + + a(t)x + b(t)y + a(t)b(t)xy δ (t)xy dB (t) + et δ (t)y + + a(t)x + b(t)y + a(t)b(t)xy σ (t)xy t dB (t) = LV (x, y) dt + e σ (t)x + + a(t)x + b(t)y + a(t)b(t)xy δ (t)xy dB (t). + et δ (t)y + + a(t)x + b(t)y + a(t)b(t)xy Here, fu LV (x, y) ≤ et x + y + ru x – k l x – g l y – hl y + l l ≤ C, ab where C > is a constant. Therefore, lim supt→∞ E(V (x(t), y(t))) ≤ C, and () is proved. Consider the ordinary differential equations σ (t)¯y d¯x = x¯ r(t) – k(t)¯x dt + x¯ σ (t) + dB (t), + a(t)¯x + b(t)¯y + a(t)b(t)¯xy δ (t)¯x f (t) dt + y¯ δ (t) + dB (t). d¯y = y¯ –h(t)¯y + a(t) + a(t)¯x + b(t)¯y + a(t)b(t)¯xy
()
Then we have the following results on the persistence and extinction of the populations. Theorem In system (), for the prey population x, if Assumption (H) holds, then the following conclusions hold: () If r ∗ < , then the prey species x ends in extinction with probability , where r (t) = r(t) – .σ (t). () If r ∗ = , then the prey species x is nonpersistent in the mean with probability . () If r – .(σ + σb ) ∗ > , then the prey species x is weakly persistent in the mean with probability . () If r – .(σ + σb ) ∗ – ωb ∗ > , then the species population x is strongly persistent in the mean with probability . u () If r ∗ > , then x(t)∗ ≤ rk l Mx . The proof of Theorem is presented in the Appendix. Theorem In system (), for the predator population y, if Assumption (H) holds, then the following conclusions hold:
Zhang et al. Advances in Difference Equations (2016) 2016:264
Page 7 of 28
() If k∗ –g – .δ ∗ + f ∗ r ∗ < , then the predator species y is extinct with probability . () If k∗ –g – .δ ∗ + f ∗ r ∗ = , then the predator species y is nonpersistent in the mean with probability . bl σ σ ∗ +σ ∗
f x¯ () If –g – .(δ + δa ) ∗ + +a¯x+b¯ ∗ – f u > , then the predator y+ab¯xy¯ (bl ) k l species y is weakly persistent in the mean with probability , where (¯x(t), y¯ (t)) is the solution of () with initial value (x , y ) ∈ R+ . () If f l r – .(σ + σb ) ∗ + k u –g – .(δ + δa ) ∗ > , then the species population y is strongly persistent in the mean with probability .
() If –g – .δ ∗ + af ∗ > , then y(t)∗ ≤
–g–.δ ∗ + a ∗ hl f
My .
The proof of Theorem is given in the Appendix. Remark From the proof of Theorem we can observe that if r ∗ > and k∗ –g – .δ ∗ + f ∗ r ∗ < , then although the prey population survives, the predators die out because of the too large diffusion coefficient δ . Remark From Theorems and we derive that if r ∗ < , then both the prey and predator populations eventually end in extinction. Meanwhile, in this case, the functional rate has no influence on the extinction of the system. Theorem Suppose that (max{σu , stochastically permanent.
σu u δu , δ , al }) bl
u
l
< min{rl – ωbl , af u – g u }, then system () is
Proof The proof is motivated by Li and Mao [] and Liu and Wang []. The whole proof is divided into two parts. First, we prove that for arbitrary ε > , there exists a constant δ > such that P∗ {|x(t)| ≥ δ} ≥ – ε. Above all, we claim that for any initial value X() = (x(), y()) ∈ R+ , the solution X(t) = (x(t), y(t)) satisfies
lim sup E θ |X(t)| t→∞
≤ M.
Here, θ is an arbitrary positive constant satisfying
σu δu ωu f l < min rl – l , u – g u . (θ + ) max σu , l , δu , l b a b a
()
By () there exists a constant p > satisfying
ωu f l σu δu – p > . min rl – l , u – g u – (θ + ) max σu , l , δu , l b a b a Define V (x, y) = x + y. Then
dV (x, y) = x r(t) – k(t)x –
ω(t)y + a(t)x + b(t)y + a(t)b(t)xy f (t)x dt +y + a(t)x + b(t)y + a(t)b(t)xy
()
Zhang et al. Advances in Difference Equations (2016) 2016:264
Page 8 of 28
+ y –g(t) – h(t)y dt + σ (t)x +
σ (t)xy dB (t) + a(t)x + b(t)y + a(t)b(t)xy δ (t)xy + δ (t)y + dB (t). + a(t)x + b(t)y + a(t)b(t)xy Letting U(x, y) =
, V (x,y)
by Itô’s formula we obtain
dU(X) = –U (X) x r(t) – k(t)x –
ω(t)y + a(t)x + b(t)y + a(t)b(t)xy f (t)x dt – U (X)y –g(t) – h(t)y dt +y + a(t)x + b(t)y + a(t)b(t)xy σ (t)y + U (X)x σ (t) + dt + a(t)x + b(t)y + a(t)b(t)xy δ (t)x + U (X)y δ (t) + dt + a(t)x + b(t)y + a(t)b(t)xy σ (t)xy dB (t) – U (X) σ (t)x + + a(t)x + b(t)y + a(t)b(t)xy δ (t)xy dB (t) + δ (t)y + + a(t)x + b(t)y + a(t)b(t)xy σ (t)xy dB (t) = LU(X) dt – U (X) σ (t)x + + a(t)x + b(t)y + a(t)b(t)xy δ (t)xy – U (X) δ (t)y + dB (t). + a(t)x + b(t)y + a(t)b(t)xy
Choose a positive constant θ such that it obeys (). Then θ θ– θ– L + U(X) = θ + U(X) LU(X) + θ (θ – ) + U(X) U (X) σ (t)y × x σ (t) + + a(t)x + b(t)y + a(t)b(t)xy δ (t)x . + y δ (t) + + a(t)x + b(t)y + a(t)b(t)xy Thus, we can choose p > sufficiently small such that it satisfies (). Denote W (X) = ept ( + U(X))θ , θ θ LW (X) = pept + U(X) + ept L + U(X) θ– pt = e + U(X) P + U(X) – θ U (X)x r(t) – k(t)x –
ω(t)y + a(t)x + b(t)y + a(t)b(t)xy
– θ U (X)y –g(t) – h(t)y +
– θ U (X)y –g(t) – h(t)y – θ U (X) x r(t) – k(t)x –
f (t)x + a(t)x + b(t)y + a(t)b(t)xy
ω(t)y + a(t)x + b(t)y + a(t)b(t)xy
Zhang et al. Advances in Difference Equations (2016) 2016:264
f (t)xy + + a(t)x + b(t)y + a(t)b(t)xy σ (t)y + θ U (X) x σ (t) + + a(t)x + b(t)y + a(t)b(t)xy δ (t)x + y δ (t) + + a(t)x + b(t)y + a(t)b(t)xy θ (θ + ) σ (t)y + U (X) x σ (t) + + a(t)x + b(t)y + a(t)b(t)xy δ (t)x . + y δ (t) + + a(t)x + b(t)y + a(t)b(t)xy Obviously, θ U (X) x σ (t) +
σ (t)y + a(t)x + b(t)y + a(t)b(t)xy δ (t)x + y δ (t) + + a(t)x + b(t)y + a(t)b(t)xy
σu δu ≤ θ U(X) max σu , l , δu , l ; b a σ (t)y θ (θ + ) U (X) x σ (t) + + a(t)x + b(t)y + a(t)b(t)xy δ (t)x + y δ (t) + + a(t)x + b(t)y + a(t)b(t)xy
σu δu θ (θ + ) U (X) max σu , l , δu , l . ≤ b a
Hence,
θ– u u ωu f l l u + p – θ min r – l , u – g p + θ max k , h LW (X) ≤ e + U(X) b a
σu δu U(X) + θ max k u , hu + θ max σu , l , δu , l b a
ωu f l + p – θ min rl – l , u – g u b a
θ (θ + ) σu δu max σu , l , δu , l U (X) . + b a pt
By () there exists a positive constant S such that LW (X) ≤ Sept . Thus, θ θ S(ept – )
. E ept + U(X) ≤ + U() + p Then,
θ S ≤ . lim sup E U θ X(t) ≤ lim sup E + U X(t) p t→∞ t→∞
Page 9 of 28
Zhang et al. Advances in Difference Equations (2016) 2016:264
Page 10 of 28
In other words, lim sup E t→∞
S ≤ θ lim sup EU θ (X) ≤ θ := M. θ |X(t)| p t→∞
Thus, for any ε > , letting δ = ( Mε ) θ , by the Chebyshev inequality we obtain –θ –θ –θ
P X(t) < δ = P X(t) > δ –θ ≤ E X(t) /δ –θ = δ θ E X(t) . Therefore, P∗ X(t) ≥ δ ≥ – ε. In the following, we prove that for any ε > , there exists a constant χ > such that P∗ {|X(t)| ≤ χ} ≥ – ε. Define V (X) = xq + yq , where, < q < and X = (x, y) ∈ R+ . By Itô’s formula we have ω(t)y q dV X(t) = qx r(t) – k(t)x – + a(t)x + b(t)y + a(t)b(t)xy q– σ (t)y dt + σ (t) + + a(t)x + b(t)y + a(t)b(t)xy f (t)x + qyq –g(t) – h(t)y + + a(t)x + b(t)y + a(t)b(t)xy q– δ (t)x dt + δ (t) + + a(t)x + b(t)y + a(t)b(t)xy σ (t)y q dB (t) + qx σ (t) + + a(t)x + b(t)y + a(t)b(t)xy δ (t)x dB (t). + qyq δ (t) + + a(t)x + b(t)y + a(t)b(t)xy Let k be so large that X lies within the interval [ k , k ]. For each integer k ≥ k , we define the stopping time τk = inf{t ≥ : X(t) ∈/ (/k, k)}. Obviously, τk increases as k → ∞. Therefore,
E exp{t ∧ τk }X q (t ∧ τk ) – X q () t∧τk –q σ (s) ds exp{s}xq (s) + q r(s) – k(s)x(s) – ≤ qE t∧τk f (s) – q – δ (s) ds exp{s}yq (s) + q –g(s) – h(s)y(s) + + qE a(s) t∧τk ≤E (K + K ) exp{s} ds
≤ (K + K ) exp{t} – , where K , K are positive constants. Letting k → +∞, we have
exp{t}E X q (t) ≤ X q () + (K + K ) exp{t} – .
Zhang et al. Advances in Difference Equations (2016) 2016:264
Page 11 of 28
In other words, we have shown that lim supt→+∞ E[X q (t)] ≤ K + K . Thus, for any given /q ) ε > , choosing χ = (K +K , by the Chebyshev inequality we get ε/q q q
P X(t) > χ = P X(t) > χ q ≤ E X(t) /χ q , that is, q
P∗ X(t) > χ ≤ E X(t) /χ q ≤ ε. Consequently, P∗ {|X(t)| ≤ χ} ≥ – ε. Theorem is proved.
4 Global attractiveness of the system and stochastically persistent in probability Definition System () is globally attractive if lim x (t) – x (t) = ,
t→+∞
lim y (t) – y (t) =
t→+∞
for any two positive solutions (x (t), y (t)), (x (t), y (t)) of system (). Theorem Suppose that (x(t), y(t)) is a solution of system () on t ≥ with initial value (x , y ) ∈ R+ . Then almost every sample path of (x(t), y(t)) is uniformly continuous. Proof From system () we have ω(s)y(s) ds + a(s)x(s) + b(s)y(s) + a(s)b(s)x(s)y(s) t σ (s)y(s) dB (s). + x(s) σ (s) + + a(s)x(s) + b(s)y(s) + a(s)b(s)x(s)y(s)
x(t) = x +
t
x(s) r(s) – k(s)x(s) –
Set f (s) = x(s) r(s) – k(s)x(s) –
ω(s)y(s) , + a(s)x(s) + b(s)y(s) + a(s)b(s)x(s)y(s) σ (s)y(s) , f (s) = x(s) σ (s) + + a(s)x(s) + b(s)y(s) + a(s)b(s)x(s)y(s)
we obtain p p ω(t)y E f (t) = Ex r(t) – k(t)x – + a(t)x + b(t)y + a(t)b(t)xy p ω(t)y p = E |x| r(t) – k(t)x – + a(t)x + b(t)y + a(t)b(t)xy p ≤ E|x|p + Eru + k u x + ωu y
p p p ≤ E|x|p + p– ru + k u E|x|p + ωu E|y|p
Zhang et al. Advances in Difference Equations (2016) 2016:264
≤
Page 12 of 28
p p– u p u p M (p) + r + k M (p) + ωu M (p)
F (p) and p p σ (t)y E f (t) = Ex σ (t) + + a(t)x + b(t)y + a(t)b(t)xy σu P σu P u p u ≤ σ + l E|x| ≤ σ + l M (p) b b F (p). In addition, in view of the moment inequality for stochastic integrals, we show that, for ≤ t ≤ t and p > , E
t
t
p p t p p– p(p – ) f (s) dB (s) ≤ (t – t ) Ef (s) ds t p p p(p – ) (t – t ) F (p). ≤
Thus, for < t < t < ∞, t – t ≤ , and p Ex(t ) – x(t ) = E
p
t
t
f (s) ds +
t
≤ p– E
t
t
t
+
q
= , we get
p f (s) dB (s)
p f (s) ds + p– E
t
t
p f (s) dB (s)
p p p p– p(p – ) f (s) ds + ≤ (t – t ) E (t – t ) F (p) t p p p p– p– p(p – ) q ≤ (t – t ) F (p)(t – t ) + (t – t ) F (p) p p p– p p– p(p – ) = (t – t ) F (p) + (t – t ) F (p)
p p p p(p – ) p– F (p) = (t – t ) (t – t ) F (p) +
p p p(p – ) p– F(p). ≤ (t – t ) + p–
p q
t
Here, F(p) = max{F (p), F (p)}. By Lemma in [, ] we have that almost every sample path of x(t) is locally but uniformly Hölder-continuous with exponent υ for every υ ∈ ), and therefore, almost every sample path of x(t) is uniformly continuous on t ∈ R+ . (, p– p Similarly, we can prove that almost every sample path of y(t) is also uniformly continuous on t ∈ R+ . Theorem is proved.
Zhang et al. Advances in Difference Equations (2016) 2016:264
Page 13 of 28
Lemma ([, ]) Let f be a nonnegative function defined on R+ such that f is integrable and uniformly continuous. Then limt→+∞ f (t) = . Theorem Suppose that σ = , δ = , and there exist constants μi > (i = , ) such that lim inft→∞ Ai (t) > , where ω(t)a(t) A (t) = μ k(t) – – μ f (t), b(t) f (t)b(t) – μ ω(t). A (t) = μ h(t) – a(t)
()
Then lim Ex (t) – x (t) = ,
t→∞
lim Ey (t) – y (t) = ,
t→∞
()
where (x (t), y (t)), (x (t), y (t)) are any two solutions of model () with initial values X = (x (), y ()) ∈ R+ and X = (x (), y ()) ∈ R+ . Moreover, model () is globally attractive. Proof We construct a Lyapunov function as follows: V (t) = μ ln x (t) – ln x (t) + μ ln y (t) – ln y (t). Then, we achieve D+ V (t) = μ sgn(x – x ) × r(t) – k(t)x –
ω(t)y – .σ (t) dt + a(t)x + b(t)y + a(t)b(t)x y ω(t)y – .σ (t) dt – r(t) – k(t)x – + a(t)x + b(t)y + a(t)b(t)x y
+ μ sgn(y – y ) × –g(t) – h(t)y +
f (t)x – .δ (t) dt + a(t)x + b(t)y + a(t)b(t)x y f (t)x – .δ (t) dt – –g(t) – h(t)y + + a(t)x + b(t)y + a(t)b(t)x y y ≤ μ sgn(x – x ) –k(t)(x – x ) + ω(t) + a(t)x + b(t)y + a(t)b(t)x y y – dt + a(t)x + b(t)y + a(t)b(t)x y x + μ sgn(y – y ) –h(t)(y – y ) + f (t) + a(t)x + b(t)y + a(t)b(t)x y x dt – + a(t)x + b(t)y + a(t)b(t)x y ω(t)a(t) ≤ – μ k(t) – – μ f (t) |x – x | b(t) f (t)b(t) – μ ω(t) |y – y |. – μ h(t) – a(t)
Zhang et al. Advances in Difference Equations (2016) 2016:264
Page 14 of 28
Since lim inft→∞ Ai (t) > (i = , ), there exist constants α > and T > such that Ai (t) ≥ α (i = , ) for all t ≥ T . Thus, D+ V (t) ≤ –α |x – x | + |y – y |
()
for all t ≥ T . Integrating () from T to t, we get V (t) – V (T ) ≤ –α
x (s) – x (s) + y (s) – y (s) ds,
t
T
that is, V (t) + α
x (s) – x (s) + y (s) – y (s) ds ≤ V (T ) < +∞.
t
()
T
Then, by V (t) ≥ and () we have x (t) – x (t) ∈ L [, +∞),
y (t) – y (t) ∈ L [, +∞).
()
According to Theorem and Lemma , the model is globally attractive. On the other hand, by system () and inequality () we have dE(x(t)) ≤ ru E x(t) – k l E x(s) – ωu E x(t)y(t) dt ≤ ru E x(t) ≤ ru K. Therefore, E(x(t)) is a uniformly continuous function. Similarly, we can obtain that E(y(t)) is uniformly continuous. According to () and Barbalat’s conclusion [], assertion () is achieved. In the following, we discuss the stochastic persistence in probability of our model, which was proposed and discussed by Schreiber et al. [] and Liu et al. [] for m j dXi (t) = Xi (t)Fi X(t) dt +
i X(t) dBj (t),
i = , , . . . , n,
()
j=
where X(t) = (X (t), . . . , Xn (t)). If there exists a unique invariant probability measure V satisfying V ( ) = and the distribution of X(t) converges to V as t → +∞ whenever n X() ∈ Rn+ , where = {a ∈ R+ |ai = for some i, ≤ i ≤ n}, then () is stochastically persistent in probability. Theorem Suppose that σ = and δ = and let the conditions of Theorem hold. If u r – .(σ + σb ) ∗ > min{ ωb ∗ , – kf l –g – .(δ + δa ) ∗ }, then system () is stochastically persistent in probability. Proof The proof is motivated by []. First, we prove that system () is asymptotically stable in distribution, that is, there exists a unique probability measure μ such that for every X() ∈ R+ , the transition probability p(t, X(), ·) of X(t) converges weakly to μ as t → +∞.
Zhang et al. Advances in Difference Equations (2016) 2016:264
Page 15 of 28
Let X(t; X ) be a solution of () with initial value X () = X ∈ R+ , p(t, X , dy) be the transition probability of X(t; X ), and P(t, X , B) denote the probability of event X(t; X ) ∈ B. Applying inequality () and the Chebyshev inequality, {p(t, X , dy) : t ≥ } is tight. Denote all the probability measures on R+ by P (R+ ). Then, for any P , P ∈ P , we can define the metric dL (P , P ) = sup f (x)P (dx) – f (x)P (dx), f ∈L
R+
R+
where L = {f : R+ → R||f (x) – f (y)| ≤ x – y, |f (·)| ≤ }. For f ∈ L and t, s > , we have Ef x(t + s; X ) – Ef x(t; X ) = E E f x(t + s; X ) |Fs – Ef x(t; X ) = Ef x(t; X ) p(s, X , dX ) – Ef x(t; X ) ≤
R+
R+
Ef x(t; X ) – Ef x(t; X ) p(s, X , dX ).
By () there exists a constant time T > such that, for all t ≥ T, supEf x(t; X ) – Ef x(t; X ) ≤ ε. f ∈L
Hence, Ef x(t + s; X ) – Ef x(t; X ) ≤ ε. Since f is arbitrary, we have dL p(t + s, X , ·), p(t, X , ·) ≤ ε for all t ≥ T, s > . Thus, {p(t, X , ·) : t ≥ } is Cauchy in the space P (R+ ). Then there exists a unique μ ∈ P (R+ ) satisfying lim dL p(t, , ·), μ = ,
t→+∞
where = (., .)T . In addition, by () we obtain lim dL p(t, X , ·), p(t, , ·) = .
t→+∞
Therefore, lim dL p(t, X , ·), μ ≤ lim dL p(t, X , ·), p(t, , ·)
t→+∞
t→+∞
+ lim dL p(t, , ·), p(t, , μ) = . t→+∞
Then system () is asymptotically stable in distribution.
Zhang et al. Advances in Difference Equations (2016) 2016:264
Page 16 of 28
On the other hand, by Theorems and we get that t→+∞ t
t
x(s) ds > ,
lim
t→+∞ t
t
y(s) ds > a.s.
lim
Therefore, model () is stochastically persistent in probability.
5 Numerical simulation This section presents a numerical simulation to verify our theoretical analysis of system (). By means of the Milstein method mentioned in Higham [], we consider the following discretized equations: xi+ = xi + xi r(it) – k(it)xi –
ω(it)yi t + a(it)xi + b(it)yi + a(it)b(it)xi yi √ σ (it)y(i) + xi σ (it) + tξi + a(it)xi + b(it)yi + a(it)b(it)xi yi
σ (it) xi ξi – t σ (it) yi + xi ξi – t , + a(it)xi + b(it)yi + a(it)b(it)xi yi () f (it)xi t yi+ = yi + yi –g(it) – h(it)yi + + a(it)xi + b(it)yi + a(it)b(it)xi yi √ δ (it)x(i) + yi δ (it) + tηi + a(it)xi + b(it)yi + a(it)b(it)xi yi +
δ (it) yi ηi – t δ (it) xi + yi ηi – t . + a(it)xi + b(it)yi + a(it)b(it)xi yi
+
In Figure , we let r(t) = . + . sin t, k(t) = . + . sin t, ω(t) = . + . sin t, f (t) = . + . sin t, g(t) = . + . sin t, h(t) = . + . sin t, δ (t)
δ (t)
σ (t)
= . + . sin t,
σ (t)
=
. + . sin t, = . + . sin t, = . + . sin t, and different values of a(t) and b(t) are chosen for Figures (a)-(d). Then, we have r (t)∗ = –. < . According to Theorems and , both of the prey and predator populations (x and y, respectively) end in extinction. σ (t) σ (t) δ (t) In Figure , we choose = . + . sin t, = . + . sin t, = . + . sin t, δ (t)
= . + . sin t, r(t) = . + . sin t, b(t) = . + . sin t, and the other parameters are the same as those in Figure . Then, r(t) – .(σ (t) + σb(t) ) ∗ ≥ . > and (k(t))∗ –g(t) – .δ (t)∗ + (f (t))∗ r (t)∗ = –. < . By virtue of Theorems and we get that the prey population x is weakly persistent in the mean, whereas the predator population y is extinct, which is confirmed by Figure . Next, set σ (t)
δ (t)
δ (t)
σ (t)
= . + . sin t,
= . + . sin t, = . + . sin t, = . + . sin t, b(t) = . + . sin t, and f (t) = . + . sin t. The other parameters are the same as those in Figure . Then, r(t) – .(σ (t) + σb(t) ) ∗ ≥ , and from Figure we observe that both of prey and predator populations are weakly persistent in the mean.
Zhang et al. Advances in Difference Equations (2016) 2016:264
Page 17 of 28
Figure 1 The figure depicts the extinction of the prey and predator species. (a) a(t) = 0.1 + 0.04 sin t, b(t) = 0.5 + 0.05 sin t. (b) a(t) = b(t) = 0. (c) a(t) = 0, b(t) = 0.5 + 0.05 sin t. (d) a(t) = 0.1 + 0.04 sin t, b(t) = 0. Both of the prey and predator populations go to extinction.
Figure 2 The prey population is weakly persistent in the mean, whereas the predator species y is extinct.
In Figure , we let σ (t) = . + . sin t, σ (t) = . + . sin t, δ (t) = . + . sin t, δ (t) = . + . sin t, r(t) = . + . sin t, a(t) = . + . sin t, f (t) = . + . sin t, and (x (), y ()) = (., .). Thus, the conditions of Theorem hold, and model () is stochastically permanent. σ (t)
δ (t)
Moreover, we choose = . + . sin t, = . + . sin t, r(t) = . + . sin t, h(t) = . + . sin t, and f (t) = . + . sin t. The initial conditions are x () = ,
Zhang et al. Advances in Difference Equations (2016) 2016:264
Page 18 of 28
Figure 3 The populations are weakly persistent in the mean for system (2) with σ12 (t) 2 δ12 (t) 2 δ22 (t) 2
=
σ22 (t) 2
= 0.1 + 0.05 sin t,
= 0.09 + 0.02 sin t, and = 0.08 + 0.02 sin t.
Figure 4 The system is stochastically permanent.
y () = ., and x () = ., y () = . The only difference among Figures (a)-(d) is the values of σ and δ , which are chosen as σ = δ = in Figures (a), (b), whereas σ (t)
δ (t)
= . + . sin t, = . + . sin t in Figures (c), (d). From the figures we can observe that system () is globally attractive. In the following example, we investigate the effects of functional response on the species. First, by comparing Figures (a)-(d) we observe that the effects of handling time a(t) and the magnitude of interference among predators b(t) do not influence the extinction of the system. Second, we fix f (t) = . + . sin t, and the other parameters are the same as in Figure . Then we obtain that (k(t))∗ –g(t) – .δ (t)∗ + (f (t))∗ r (t)∗ < . On the basis of Theorem , the predator species goes to extinction, and it is confirmed by Figure (a). We increase the intensity of conversion rate and choose f (t) = . + . sin t and f (t) = . + . sin t, respectively, for Figures (b) and (c). From Figures (a)-(c), we observe that the predator changes from extinction to persistence, which shows that increasing the amplitude of periodical conversion rate is benefit for the coexistence of ecosystems.
Appendix Proof of Theorem Let k > be so large that X lies within the interval [/k , k ]. For each integer k > k , define the stopping times τk = inf{t ∈ [, τe ] : x(t) ∈/ (/k, k) or y(t) ∈/ (/k, k)}. Then, τk is increasing as k → ∞. Denote τ∞ = limk→+∞ τk ; thus, τ∞ ≤ τe . Next, we show that τ∞ = ∞. Otherwise, there are constants T > and ε ∈ (, ) satisfying P{τ∞ < ∞} > ε. Then, there exists an integer k ≥ k such that P{τk ≤ T} ≥ ε
Zhang et al. Advances in Difference Equations (2016) 2016:264
Page 19 of 28
Figure 5 The figure shows the attractiveness of system (2). The only difference between these graphs is the values of σ22 and δ22 . (a), (b): σ22 = δ22 = 0. (c), (d):
σ22 (t) 2
= 0.06 + 0.01 sin t,
δ22 (t) 2
= 0.03 + 0.02 sin t.
for all k > k . Define the C -function V : R+ → R+ by V (x, y) = (x – – ln x) + (y – – ln y), which is nonnegative. If (x(t), y(t)) ∈ R+ , then by Itô’s formula we have dV (x, y) = Vx dx + .Vxx (dx) + Vy dy + .Vyy (dy) ω(t)y = ( – /x)x r(t) – k(t)x – + a(t)x + b(t)y + a(t)b(t)xy f (t)x dt + ( – /y)y –g(t) – h(t)y + + a(t)x + b(t)y + a(t)b(t)xy σ (t)y + . σ (t) + dt + a(t)x + b(t)y + a(t)b(t)xy δ (t)x dt + . δ (t) + + a(t)x + b(t)y + a(t)b(t)xy σ (t)y dB (t) + ( – /x)x σ (t) + + a(t)x + b(t)y + a(t)b(t)xy δ (t)x dB (t) + ( – /y)y δ (t) + + a(t)x + b(t)y + a(t)b(t)xy
Zhang et al. Advances in Difference Equations (2016) 2016:264
Page 20 of 28
Figure 6 The figure depicts the effects of functional response on the dynamical properties of the model. The difference between the graphs is the values of f (t): (a) f (t) = 0.05 + 0.02 sin t, (b) f (t) = 0.6 + 0.02 sin t, and (c) f (t) = 2.2 + 0.02 sin t.
σ (t)y dB (t) + a(t)x + b(t)y + a(t)b(t)xy δ (t)x dB (t). + (y – ) δ (t) + + a(t)x + b(t)y + a(t)b(t)xy
= LV (x, y) dt + (x – ) σ (t) +
(A.)
Here ωu σu LV (x, y) ≤ ru + k u x – k l x – rl + l + g u + . σu + l b b fu δu + hu + l – g l y – hl y + . δu + l a a ≤ G, where G is a positive number. Integrating both sides of inequality (A.) from to τk ∧ T (τk ∧ T = min{τk , T}) and taking the expectations, we obtain that EV x(τk ∧ T), y(τk ∧ T) ≤ V x(), y() + GE(τk ∧ T) ≤ V x(), y() + GT.
Zhang et al. Advances in Difference Equations (2016) 2016:264
Page 21 of 28
Let k = {τk ≤ T}. Then we have P(k ) ≥ ε. For each ω ∈ k , x(τk , ω) or y(τk , ω) equals either k or /k, and V x(τk , ω), y(τk , ω) ≥ min{k – – ln k, /k – + ln k}. Therefore,
V x(), y() + GT ≥ E k (ω)V x(ω), y(ω) ≥ ε min{k – – ln k, /k – + ln k}, where k is the indicator function of k . Letting k → ∞, we obtain the contradiction. The proof is completed. Proof of Theorem () From system () we have that d ln x = r(t) – k(t)x –
ω(t)y + a(t)x + b(t)y + a(t)b(t)xy σ (t)y dt – . σ (t) + + a(t)x + b(t)y + a(t)b(t)xy σ (t)y + σ (t) + dB (t), + a(t)x + b(t)y + a(t)b(t)xy f (t)x d ln y = –g(t) – h(t)y + + a(t)x + b(t)y + a(t)b(t)xy δ (t)x dt – . δ (t) + + a(t)x + b(t)y + a(t)b(t)xy δ (t)x + δ (t) + dB (t). + a(t)x + b(t)y + a(t)b(t)xy
(A.)
Integrating the first equation of (A.), we have ln x(t) – ln x ≤ r (t) + t
t
σ (s)y (σ (s) + +a(s)x+b(s)y+a(s)b(s)xy ) dB (s)
t
.
(A.)
Let M (t) =
t σ (s) +
σ (s)y dB (s) + a(s)x + b(s)y + a(s)b(s)xy
and t δ (s) + M (t) =
δ (s)x dB (s). + a(s)x + b(s)y + a(s)b(s)xy
Then, Mi (t) (i = , ) is a local martingale, and the quadratic variation satisfies M , M t =
t σ (s) +
σ (s)y + a(s)x + b(s)y + a(s)b(s)xy
ds ≤
σ +
σ b
u t
Zhang et al. Advances in Difference Equations (2016) 2016:264
Page 22 of 28
and M , M t =
t δ (s) +
δ (s)x + a(s)x + b(s)y + a(s)b(s)xy
ds ≤
δ u δ + t. a
According to the strong law of large numbers for martingales, we get lim sup t→∞
Mi (t) = a.s. t
(A.)
Thus,
ln x(t) – ln x t
∗
∗ ≤ r (t) < .
Then, limt→∞ x(t) = . () By virtue of the superior limit and (A.) we can show that, for an arbitrary ε > , there exists T > such that r (t) ≤ r (t)∗ + ε and Mt(t) ≤ ε for all t > T. From (A.) we get ln x(t) – ln x ≤ r ∗ – k l x + ε ≤ ε – k l x. t By Lemma in [] we have x(t)∗ ≤ kεl . By the arbitrariness of ε the desired conclusion is obtained. () According to (A.) and Lemma , we have ∗ ∗ ln x(t) – ln x ∗ ω(t)y + k(t)x + k x + ω y ≥ t + a(t)x + b(t)y + a(t)b(t)xy ∗ σ ≥ r – . σ + > . (A.) b u
∗
u
∗
Then, x∗ > a.s. If not, for arbitrary υ ∈ {x(t, υ)∗ = }, by (A.) we have y(t, υ)∗ > . Meanwhile, from equation (A.) we get
ln y(t, υ) – ln y t
∗
∗ ∗ ∗ ≤ –g – .δ + f u x(t, υ) + hl –y(t, υ) < .
Therefore, limt→∞ y(t, υ) = , which contradicts with y(t, υ)∗ > . The proof is completed. () By the condition r – .(σ + σb ) ∗ – ωb ∗ > there exists a sufficiently small ε > such that r – .(σ + σb ) ∗ – ωb ∗ – ε > . In addition, by (A.) for this ε > , there exists T > such that
σ σ ε > r –. σ + – , r –. σ + b b ∗
∗ ω ω ε < + , b b
for all t > T. Then, we get ∗ σ ω ln x(t) – ln x – – ε – k u x. ≥ r – . σ + t b b ∗
M (t) ε >– t
Zhang et al. Advances in Difference Equations (2016) 2016:264
Page 23 of 28
According to Lemma in [] and the arbitrariness of ε, we obtain r – .(σ + σb ) ∗ – ωb ∗ mx > . x(t) ∗ ≥ ku The proof is completed. () From the first equation of (A.) we have that d ln x ≤
r(t) – .σ (t)
σ (t)y dB (t). – k(t)x dt + σ (t) + + a(t)x + b(t)y + a(t)b(t)xy
Thus, ∗ M (t) ln x(t) – ln x ≤ r – .σ – k l x(t) + . t t In addition, from the property of the superior limit and (A.), for the given positive number ε, there is T > satisfying ∗ ε r – .σ < r – .σ + ,
M (t) ε < t
for all t > T . According to Lemma in [] and the arbitrariness of ε, we get that ∗ r – .σ ∗ x(t) ≤ Mx . kl
Proof of Theorem () Case I. If r ∗ ≤ , then by Theorem we have x(t)∗ = . Thus, for arbitrary sufficiently small ε > , there exists T > such that –g –.δ < –g –.δ ∗ + ε and M (t) < εt for all t > T. Therefore,
ln y(t) – ln y t
∗
∗ ∗ ∗ ≤ –g – .δ + f u x(t) + ε = –g – .δ + ε < ,
and then limt→∞ y(t) = . Case II. If r ∗ > , then by (A.), for sufficiently small ε > , there exists T > such that ln x(t) – ln x ≤ r ∗ – k∗ x(t) + ε t for all t > T. By virtue of Lemma in [] and the arbitrariness of ε, we get ∗ r ∗ . x(t) ≤ k∗
(A.)
Thus, we get
ln y(t) – ln y t
∗
∗ ∗ ≤ –g – .δ + f ∗ x(t) ≤
Then, limt→∞ y(t) = .
k∗ –g – .δ ∗ + f ∗ r ∗ < . k∗
(A.)
Zhang et al. Advances in Difference Equations (2016) 2016:264
Page 24 of 28
() In (), we have already shown that if r ∗ ≤ , then limt→∞ y(t) = , and, as a result, y(t)∗ = . Now, we show that if r ∗ > , then y(t)∗ = is still valid. Otherwise, y(t)∗ > ]∗ = . According to (A.), we get , and by Lemma we show that [ ln y(t) t =
ln y(t) – ln y t
∗
∗ ∗ ≤ –g – .δ + f ∗ x(t) .
Meanwhile, for an arbitrary constant ε > , there exists T > such that ∗ ε –g – .δ ≤ –g – .δ + ,
∗ ε f (t)x(t) ≤ f ∗ x(t) + ,
and
ε M (t) ≤ t
for all t > T. Thus, we have M (t) ln y(t) – ln y ≤ –g – .δ + f (t)x(t) – h(t)y(t) + t t ∗ ∗ ∗ ≤ –g – .δ + f x(t) + ε – h∗ y(t) . Using Lemma in [], we obtain ∗ –g – .δ ∗ + f ∗ x(t)∗ + ε , y(t) ≤ h∗ which indicates that y(t)∗ ≤
–g–.δ ∗ +f ∗ x(t)∗ . h∗
Applying (A.), we have
∗ k∗ –g – .δ ∗ + f ∗ r ∗ = . y(t) ≤ h∗ k∗ This is a contradiction. Therefore, y(t)∗ = a.s. () In this part, we need to prove that y(t)∗ > a.s. If not, for arbitrary ε > , there exist a solution (ˇx(t), yˇ (t)) with initial value (x , y ) ∈ R+ such that P{ˇy(t)∗ < ε } > . Let ε be sufficiently small such that
∗ bl σ σ ∗ + σ ∗ δ ∗ f x¯ –g – . δ + + –fu a + a¯x + b¯y + ab¯xy¯ (bl ) k l u u f ω > + hu + ε . kl
Then, we obtain δ (t)ˇx ln yˇ (t) – ln y – h(t)ˇy(t) ≥ –g(t) – . δ (t) + t + a(t)ˇx + b(t)ˇy + a(t)b(t)ˇxyˇ t δ (s)ˇx (δ (s) + +a(s)ˇx+b(s)ˇy+a(s)b(s)ˇxyˇ ) dB (s) + t f (t)¯x f (t)ˇx – + + a(t)ˇx + b(t)ˇy + a(t)b(t)ˇxyˇ + a(t)¯x + b(t)¯y + a(t)b(t)¯xy¯ f (t)¯x . + + a(t)¯x + b(t)¯y + a(t)b(t)¯xy¯
Zhang et al. Advances in Difference Equations (2016) 2016:264
Page 25 of 28
Here, xˇ (t) ≤ x¯ (t) and yˇ (t) ≤ y¯ (t) a.s. for t ∈ [, +∞). Notice that f (t)¯x f (t)ˇx – + a(t)ˇx + b(t)ˇy + a(t)b(t)ˇxyˇ + a(t)¯x + b(t)¯y + a(t)b(t)¯xy¯ = f (t)
–(¯x – xˇ ) + a(t)b(t)¯xxˇ (¯y – yˇ ) + b(t)ˇx(¯y – yˇ ) – b(t)ˇy(¯x – xˇ ) ( + a(t)ˇx + b(t)ˇy + a(t)b(t)ˇxyˇ )( + a(t)¯x + b(t)¯y + a(t)b(t)¯xy¯ )
≥ –f (t)(¯x – xˇ ), and thus, δ (t) ln yˇ (t) – ln y – h(t)ˇy(t) ≥ –g(t) – . δ (t) + t a(t) t δ (s)ˇx (δ (s) + +a(s)ˇx+b(s)ˇy+a(s)b(s)ˇxyˇ ) dB (s) + t f (t)¯x + – f (t)(¯x – xˇ ) . + a(t)¯x + b(t)¯y + a(t)b(t)¯xy¯
(A.)
Define the Lyapunov function V (t) = | ln x¯ (t) – ln xˇ (t)|, which is a positive function on R+ . Then
ω(t)ˇy + a(t)ˇx + b(t)ˇy + a(t)b(t)ˇxyˇ σ (t)¯y – . σ (t) + + a(t)¯x + b(t)¯y + a(t)b(t)¯xy¯ σ (t)ˇy + . σ (t) + dt + a(t)ˇx + b(t)ˇy + a(t)b(t)ˇxyˇ σ (t)¯y σ (t)ˇy + – dB (t) . + a(t)¯x + b(t)¯y + a(t)b(t)¯xy¯ + a(t)ˇx + b(t)ˇy + a(t)b(t)ˇxyˇ
D+ V (t) ≤ sgn(¯x – xˇ )
–k(¯x – xˇ ) +
t σ (s)¯y σ (s)ˇy – +a(s)ˇx+b(s)ˇ ) dB (s), by the strong law of large Setting M (t) = ( +a(s)¯x+b(s)¯ y+a(s)b(s)¯xy¯ y+a(s)b(s)ˇxyˇ numbers for martingales we get
lim sup t→∞
M (t) = a.s. t
Thus, for the given constant ε > , there exists T > such that M (t) < ε t for all t ≥ T. Therefore, we get that V (t) – V () bl σ σ ∗ + σ ∗ M (t) ≤ ωu yˇ (t) – k l ¯x – xˇ + . + t (bl ) t Then, we obtain ¯x – xˇ ≤
ωu bl σ σ ∗ + σ ∗ yˇ (t) + . kl k l (bl )
Zhang et al. Advances in Difference Equations (2016) 2016:264
Page 26 of 28
Substituting this inequality into (A.) and taking the superior limit of the inequality, we get
ln yˇ (t) – ln y t
∗
δ (t) ∗ ≥ –g(t) – . δ (t) + – hu yˇ (t) ∗ a(t) t δ (s)ˇx (δ (s) + +a(t)ˇx+b(t)ˇy+a(t)b(t)ˇxyˇ ) dB (s) + t ∗ f (t)¯x + + a(t)¯x + b(t)¯y + a(t)b(t)¯xy¯ ∗ l ∗ ωu ∗ u b σ σ + σ ˇ y (t) – f kl k l (bl ) ∗ ∗ δ (t) f (t)¯x ≥ –g(t) – . δ (t) + + a(t) + a(t)¯x + b(t)¯y + a(t)b(t)¯xy¯ ∗ l ∗ f u ωu u b σ σ + σ u –f – + h + ε > , k l (bl ) kl
– f u
which contradicts with Lemma , and thus y(t)∗ > a.s. () The proof is motivated by Liu and Bai []. We have y(t) fl x(t) σ (t) fl r(t) – . σ + ln ≥ ln (t) + t k u x() y() k u b(t) ∗ t l u δ (t) ∗ f w u + –g(t) – . δ (t) + t– + h y(s) ds a(t) ku fl t σ (s)y + u dB (s) σ (s) + k + a(s)x + b(s)y + a(s)b(s)xy t δ (s)y δ (s) + dB (s). + (A.) + a(s)x + b(s)y + a(s)b(s)xy l
(t) (t) ∗ By (), for arbitrary < ε < kf u r(t) – .(σ (t) + σb(t) ) ∗ + –g(t) – .(δ (t) + δb(t) ) , there exists a random time T = T(ω) satisfying
fl x(t) – ln y() < ε ln t k u x() t
a.s.
for all t ≥ T. Substituting this inequality into (A.), we obtain that σ (t) fl t ln y(t) ≥ u r(t) – . σ (t) + k b(t) ∗ l u t δ (t) ∗ f w u + –g(t) – . δ (t) + t – εt – +h y(s) ds a(t) ku σ (s)y fl t σ (s) + dB (s) + u k + a(s)x + b(s)y + a(s)b(s)xy t δ (s)y dB (s). δ (s) + + + a(s)x + b(s)y + a(s)b(s)xy
Zhang et al. Advances in Difference Equations (2016) 2016:264
Page 27 of 28
According to Lemma in [], we get that lim inf y(t) ≥
f l r(t) – .(σ (t) +
σ (t) ) ∗ b(t)
+ k u –g(t) – .(δ (t) +
δ (t) ∗ ) a(t)
f l wu + k u hu
t→∞
– kuε
> .
The proof is completed. () From the second equation of (A.) we have d ln y ≤
–g(t) – .δ (t)
+ δ (t) +
f (t) + – h(t)y dt a(t)
δ (t)x dB (t). + a(t)x + b(t)y + a(t)b(t)xy
Thus, ∗ M (t) f ln y(t) – ln y ∗ ≤ –g – .δ + . – hl y(t) + t a t In addition, from the property of the superior limit and (A.) we have that, for the given positive number ε, there exists T > such that ∗ ε –g – .δ < –g – .δ + ,
∗ f f ε < + , a a
and
M (t) ε < t
for all t > T . According to Lemma in [], we have ∗ –g – .δ ∗ + af ∗ My . y(t) ≤ hl
Competing interests The authors declare that they have no competing interests. Authors’ contributions The authors declare that the study was realized in collaboration with the same responsibility. All authors read and approved the final manuscript. Author details 1 School of Mathematics and Statistics, Wuhan University, Wuhan, 430000, P.R. China. 2 College of Mathematics and Computer Science, Gannan Normal University, Ganzhou, 341000, P.R. China. Acknowledgements The authors gratefully acknowledge the anonymous referees for their careful reading of the original manuscript. This work is supported by The National Natural Science Foundation of China (61273215, 11261004, 11301492), The bidding project of Gannan Normal University (15zb01) and PhD Programs Foundation of Ministry of Education of China (20130145120005). Received: 19 June 2016 Accepted: 11 October 2016 References 1. Ji, C, Jiang, D, Shi, N: Analysis of a predator-prey model with modified Leslie-Gower and Holling-type II schemes with stochastic perturbation. J. Math. Anal. Appl. 359, 482-498 (2009) 2. Wang, L, Teng, Z, Jiang, H: Global attractivity of a discrete SIRS epidemic model with standard incidence rate. Math. Methods Appl. Sci. 36, 601-619 (2013) 3. Gao, S, Liu, Y, Nieto, JJ, Andrade, H: Seasonality and mixed vaccination strategy in an epidemic model with vertical transmission. Math. Comput. Simul. 81, 1855-1868 (2011) 4. Hu, Z, Teng, Z, Jia, C, Zhang, L, Chen, X: Complex dynamical behaviors in a discrete eco-epidemiological model with disease in prey. Adv. Differ. Equ. 2014, 265 (2014) 5. Liu, X, Zhong, S, Tian, B, Zheng, F: Asymptotic properties of a stochastic predator-prey model with Crowley-Martin functional response. J. Appl. Math. Comput. 43, 479-490 (2013)
Zhang et al. Advances in Difference Equations (2016) 2016:264
Page 28 of 28
6. Qiu, H, Liu, M, Wang, K, Wang, Y: Dynamics of a stochastic predator-prey system with Beddington-DeAngelis functional response. Appl. Math. Comput. 219, 2303-2312 (2012) 7. Bandyopadhyay, M, Chattopadhyay, J: Ratio-dependent predator-prey model: effect of environmental fluctuation and stability. Nonlinearity 18, 913-936 (2005) 8. Liu, M, Wang, K, Wu, Q: Survival analysis of stochastic competitive models in a polluted environment and stochastic competitive exclusion principle. Bull. Math. Biol. 73, 1969-2012 (2011) 9. Lin, Y, Jiang, D, Wang, S: Stationary distribution of a stochastic SIS epidemic model with vaccination. Physica A 394, 187-197 (2014) 10. Witbooi, P: Stability of an SEIR epidemic model with independent stochastic perturbations. Physica A 392, 4928-4936 (2013) 11. Zhou, Y, Zhang, W, Yuan, S: Survival and stationary distribution in a stochastic SIS model. Discrete Dyn. Nat. Soc. 2013, Article ID 592821 (2013) 12. Tan, W, Zhu, X: A stochastic model of the HIV epidemic for heterosexual transmission involving married couples and prostitutes: I. The probabilities of HIV transmission and pair formation. Math. Comput. Model. 24(11), 47-107 (1996) 13. Dalal, N, Greenhalgh, D, Mao, X: A stochastic model of AIDS and condom use. J. Math. Anal. Appl. 325, 36-53 (2007) 14. Wang, K: Stochastic Models in Mathematical Biology. Science Press, Beijing (2010) 15. Cheng, S: Stochastic population systems. Stoch. Anal. Appl. 27, 854-874 (2009) 16. Li, X, Mao, X: Population dynamical behavior of non-autonomous Lotka-Volterra competitive system with random perturbation. Discrete Contin. Dyn. Syst. 24, 523-545 (2009) 17. Liu, M, Wang, K: Persistence and extinction in stochastic non-autonomous logistic systems. J. Math. Anal. Appl. 375, 443-457 (2011) 18. Mao, X: Stochastic versions of the LaSalle theorem. J. Differ. Equ. 153, 175-195 (1999) 19. Karatzas, I, Shreve, S: Brownian Motion and Stochastic Calculus. Springer, Berlin (1991) 20. Barbalat, I: Systèmes d’équations différentielles d’oscillations non linéaires. Rev. Roum. Math. Pures Appl. 4, 267-270 (1959) 21. Schreiber, S, Benaïm, M, Atchadé, K: Persistence in fluctuating environments. J. Math. Biol. 62, 655-683 (2011) 22. Liu, M, Bai, C: Analysis of a stochastic tri-trophic food-chain model with harvesting. J. Math. Biol. 73, 597-625 (2016) 23. Higham, D: An algorithmic introduction to numerical simulation of stochastic differential equations. SIAM Rev. 43, 525-546 (2001)