Mao and Mao Advances in Difference Equations (2016) 2016:77 DOI 10.1186/s13662-016-0802-x
RESEARCH
Open Access
An averaging principle for neutral stochastic functional differential equations driven by Poisson random measure Wei Mao1* and Xuerong Mao2 *
Correspondence:
[email protected] 1 School of Mathematics and Information Technology, Jiangsu Second Normal University, Nanjing, 210013, China Full list of author information is available at the end of the article
Abstract In this paper, we study the averaging principle for neutral stochastic functional differential equations (SFDEs) with Poisson random measure. By stochastic inequality, Burkholder-Davis-Gundy’s inequality and Kunita’s inequality, we prove that the solution of the averaged neutral SFDEs with Poisson random measure converges to that of the standard one in Lp sense and also in probability. Some illustrative examples are presented to demonstrate this theory. Keywords: averaging principle; neutral SFDEs; Lp convergence; convergence in probability; Poisson random measure
1 Introduction Since Krylov and Bogolyubov [] put forward the averaging principles for dynamical systems in , the averaging principles have received great attention and many people have devoted their efforts to the study of averaging principles of nonlinear dynamical systems. For example, the averaging principles for nonlinear ordinary differential equations (ODEs) can be found in [, ]. For the averaging principles of nonlinear partial differential equations (PDEs), we refer to [, ]. With the developing of stochastic analysis theory, many authors began to study the averaging principle for stochastic differential equations (SDEs). Khasminskii [] first extended the averaging theory for ODEs to the case of stochastic differential equations (SDEs) and studied the averaging principle of SDEs driven by Brownian motion. After that, there grew an extensive literature on averaging principles for SDEs. Freidlin and Wentzell [] provided a mathematically rigorous overview of fundamental stochastic averaging method. Golec and Ladde [], Veretennikov [], Khasminskii and Yin [], Givon et al. [] studied the averaging principle to stochastic differential systems in the sense of mean square and probability. On the other hand, Stoyanov and Bainov [], Kolomiets and Melnikov [], Givon [], Xu et al. [] established the averaging principle for stochastic differential equations with Lévy jumps. They proved that the solutions of averaged systems converge to the solutions of original systems in mean square under the Lipschitz conditions. On the other hand, Yin and Ramachandran [] studied the asymptotic properties of stochastic differential delay equation (SDDEs) with wideband noise perturbations. By adopting the martingale averaging techniques and the method of weak convergence, they © 2016 Mao and Mao. 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.
Mao and Mao Advances in Difference Equations (2016) 2016:77
Page 2 of 18
showed that the underlying process yε (t) converges weakly to a random process xε (t) of SDDEs as ε → . Tan and Lei [] investigated the averaging method for a class of SDDEs with constant delay. Under non-Lipschitz conditions, they showed the convergence between the standard form and the averaged form of SDDEs. Furthermore, Xu et al. [] and Mao et al. [] also extended the convergence results [, , , ] to the case of stochastic functional differential equations (SFDEs) and SDDEs with variable delays, respectively. SDDEs and SFDEs are well known to model problems from many areas of science and engineering, the future state of which is determined by the present and past states. In fact, many stochastic systems not only depend on the present and past states but also involve the derivatives with delays as well as the function itself. In this case, neutral SDDEs (SFDEs) has been used to described such systems. In the past few years, the theory of neutral SDDEs (SFDEs) has attracted more and more attention (see e.g. [–]). However, to the best of our knowledge, there is no research about using the averaging methods to obtain the approximate solutions to neutral SDDEs (SFDEs). In order to fill the gap, we will study the averaging principle of neutral SFDEs with Poisson random measure. By using the averaging method, we give the averaged form of neutral SFDEs () and show that the pth moment of solution to equation () is bounded. Then, applying the stochastic inequality, Burkholder-Davis-Gundy’s inequality and Kunita’s inequality, we prove that the solution of the averaged neutral SFDEs with Poisson random measure () converges to that of the standard one () in Lp sense and also in probability under the Lipschitz conditions. Meantime, we relax the Lipschitz condition and obtain the averaging principle for neutral SFDEs with Poisson random measure () under non-Lipschitz conditions. It should be pointed out that the previous works [, , –, , ] on averaging principle mainly discussed L strong convergence for stochastic differential equations and they do not imply Lp (p > ) strong convergence. Moreover, since the neutral term is involved, the proof of the main results are much more technical. The results obtained of this paper are a generalization and improvement of some results in [, , , , , , ]. The rest of this paper is organized as follows. In Section , we introduce some preliminaries and establish our main results. In Section , some lemmas will be given which will be crucial in the proof of the main results, Theorems . and .. Section is devoted to the proof of the main results. Finally, two illustrative examples will be given in Section .
2 Averaging principle and main results Throughout this paper, let (, F , P) be a complete probability space equipped with some filtration (Ft )t≥ satisfying the usual conditions. Here w(t) is an m-dimensional Brownian motion defined on the probability space (, F , P) adapted to the filtration (Ft )t≥ . Let τ > , and D([–τ , ]; Rn ) denote the family of all right-continuous functions with lefthand limits ϕ from [–τ , ] → Rn . The space D([–τ , ]; Rn ) is assumed to be equipped with the norm ϕ = sup–τ ≤t≤ |ϕ(t)|. DbF ([–τ , ]; Rn ) denotes the family of all almost surely bounded, F -measurable, D([–τ , ]; Rn ) valued random variable ξ = {ξ (θ ) : –τ ≤ θ ≤ }. p For any p ≥ , let LF ([–τ , ]; Rn ) denote the family of all F measurable, D([–τ , ]; Rn )valued random variables ϕ = {ϕ(θ ) : –τ ≤ θ ≤ } such that Esup–τ ≤θ≤ |ϕ(θ )|p < ∞. Let {¯p = p¯ (t), t ≥ } be a stationary Ft -adapted and Rn -valued Poisson point process. Then, for A ∈ B (Rn – {}), ∈/ the closure of A, we define the Poisson counting measure
Mao and Mao Advances in Difference Equations (2016) 2016:77
Page 3 of 18
N associated with p¯ by IA p¯ (s) , N (, t] × A := # < s ≤ t, p¯ (s) ∈ A = t
where # denotes the cardinality of the set {·}. For simplicity, we denote N(t, A) := N((, t] × A). It is well known that there exists a σ -finite measure π such that E N(t, A) = π(A)t,
exp(–tπ(A))(π(A)t)n . P N(t, A) = n = n!
This measure π is called the Lévy measure. Moreover, by Doob-Meyer’s decomposition ˜ A) and a unique {Ft }-adapted theorem, there exists a unique {Ft }-adapted martingale N(t, ˆ natural increasing process N(t, A) such that ˜ A) + N(t, ˆ A), N(t, A) = N(t,
t > .
˜ A) is called the compensated Poisson random measure and N(t, ˆ A) = π(A)t is Here N(t, called the compensator. For more details on Poisson point process and Lévy jumps, see [–]. Consider the following neutral SFDEs with Poisson random measure
d x(t) – D(xt ) = f (t, xt ) dt + g(t, xt ) dw(t) +
h(t, xt , v)N(dt, dv),
()
Z
where xt = {x(t + θ ) : –τ ≤ θ ≤ } is regarded as a D([–τ , ]; Rn )-valued stochastic process. f : [, T] × D([–τ , ]; Rn ) → Rn , g : [, T] × D([–τ , ]; Rn ) → Rn×m and h : [, T] × D([–τ , ]; Rn ) × Z → Rn are both Borel-measurable functions. The initial condition x is defined by x = ξ = ξ (t) : –τ ≤ t ≤ ∈ LF [–τ , ]; Rn , that is, ξ is an F -measurable D([–τ , ]; Rn )-valued random variable and Eξ < ∞. To study the averaging method of equation (), we need the following assumptions. Assumption . Let D() = and for all ϕ, ψ ∈ D([–τ , ]; Rn ), there exists a constant k ∈ (, ) such that
D(ϕ) – D(ψ) ≤ k ϕ – ψ.
()
Assumption . For all ϕ, ψ ∈ D([–τ , ]; Rn ) and t ∈ [, T], there exist two positive constants k , k such that
f (t, ϕ) – f (t, ψ) ∨ g(t, ϕ) – g(t, ψ) ≤ k ϕ – ψ and Z
h(t, ϕ, v) – h(t, ϕ, v) p π(dv) ≤ k ϕ – ψp ,
p ≥ .
()
Mao and Mao Advances in Difference Equations (2016) 2016:77
Page 4 of 18
Assumption . For all ϕ ∈ D([–τ , ]; Rn ) and t ∈ [, T], there exist two positive constants k , k such that
f (t, ϕ) ∨ g(t, ϕ) ≤ k + ϕ and
h(t, ϕ, v) p π(dv) ≤ k + ϕp ,
p ≥ .
()
Z
Let C , ([–τ , T] × Rn ; R+ ) denote the family of all nonnegative functions V (t, x) defined on [–τ , T] × Rn which are continuously twice differentiable in x and once differentiable in t. For each V ∈ C , ([–τ , T] × Rn ; R+ ), define an operator LV by LV (t, x, y) = Vt t, x – D(y) + Vx t, x – D(y) f (t, y) trace g (t, y)Vxx t, x – D(y) g(t, y) V t, x – D(y) + h(t, y, v) – V t, x – D(y) π(dv), +
+
()
Z
where ∂V (t, x) , Vx (t, x) = ∂t ∂ V (t, x) Vxx (t, x) = . ∂xi ∂xj n×n
Vt (t, x) =
∂V (t, x) ∂V (t, x) , ,..., ∂x ∂xn
Similar to the proof of [], we have the following existence result. Theorem . If Assumptions .-. hold, equation () has a unique solution in the sense of Lp . Now, we study the averaging principle for neutral SFDEs with Poisson random measure. Let us consider the standard form of equation () xε (t) = x() + D(xε,t ) – D(x ) + ε +
√
f (s, xε,s ) ds
t
g(s, xε,s ) dw(s) +
ε
t
√ ε
t h(s, xε,s , v)N(ds, dv),
()
Z
where the coefficients f , g, and h have the same assumptions as in (), (), and ε ∈ [, ε ] is a positive small parameter with ε is a fixed number. ¯ v) : D([–τ , ]; Rn ) × Let f¯ (x) : D([–τ , ]; Rn ) → Rn , g¯ (x) : D([–τ , ]; Rn ) → Rn×m and h(x, Z → Rn be measurable functions, satisfying Assumptions . and .. We also assume that the following condition is satisfied. Assumption . For any ϕ ∈ D([–τ , ]; Rn ) and p ≥ , there exist three positive bounded functions ψi (T ), i = , , , such that T
T
f (t, ϕ) – f¯ (ϕ) p dt ≤ ψ (T ) + ϕp ,
Mao and Mao Advances in Difference Equations (2016) 2016:77
T
Page 5 of 18
T
g(t, ϕ) – g¯ (ϕ) p dt ≤ ψ (T ) + ϕp ,
and T
T
h(t, ϕ, v) – h(ϕ, ¯ v) p π(dv) dt ≤ ψ (T ) + ϕp , Z
where limT →∞ ψi (T ) = . Then we have the averaging form of the standard neutral SFDEs with Poisson random measure
t
yε (t) = y() + D(yε,t ) – D(y ) + ε +
√
t ε
f¯ (yε,s ) ds +
√
ε
t
g¯ (yε,s ) dw(s)
¯ ε,s , v)N(ds, dv), h(y
()
Z
where y() = x(), y = x . Obviously, under Assumptions .-., the standard neutral SFDEs with Poisson random measure () and the averaged one () have a unique solutions in Lp , respectively. Now, we present our main results which are used for revealing the relationship between the processes xε (t) and yε (t). Theorem . Let Assumptions .-. hold. For a given arbitrary small number δ > and p ≥ , there exist L > , ε ∈ (, ε ], and β ∈ (, ) such that
p E xε (t) – yε (t) ≤ δ ,
∀t ∈ , Lε–β ,
()
for all ε ∈ (, ε ]. The proof of this theorem will be shown in Section . Remark . In particular, when p = , we see that the solution of the averaged neutral SFDEs with Poisson random measure converges to that of the standard one in second moment. With Theorem ., it is easy to show the convergence in probability between the processes xε (t) and yε (t). Corollary . Let Assumptions .-. hold. For a given arbitrary small number δ > , there exists ε ∈ [, ε ] such that for all ε ∈ (, ε ], we have
lim P
ε→
sup xε (t) – yε (t) > δ = ,
where L and β are defined by Theorem ..
Mao and Mao Advances in Difference Equations (2016) 2016:77
Page 6 of 18
Proof By Theorem . and the Chebyshev inequality, for any given number δ > , we can obtain
P
p cLε–β
sup xε (t) – yε (t) > δ ≤ p E sup xε (t) – yε (t) ≤ . p δ
Let ε → , and the required result follows.
Next, we extend the averaging principle for neutral SFDEs with Poisson random measure to the case of non-Lipschitz condition. Assumption . Let k(·), ρ(·) be two concave nondecreasing functions from R+ to R+ up– n such that k() = ρ() = and + k p (u)+ρ p (u) du = ∞. For all ϕ, ψ ∈ D([–τ , ]; R ), t ∈ [, T], and p ≥ , then
f (t, ϕ) – f (t, ψ) ∨ g(t, ϕ) – g(t, ψ) ≤ k ϕ – ψ ,
h(t, ϕ, v) – h(t, ψ, v) p π(dv)
p
≤ ρ ϕ – ψ .
()
Z
Remark . As we know, the existence and uniqueness of solution for NSFDEs under the above assumptions were proved by Bao and Hou [], Ren and Xia [] and Wei and Cai []. If k(u) = ρ(u) = Lu, then Assumption . reduces to the Lipschitz conditions (). In other words, Assumption . is much weaker than Assumption .. Theorem . If Assumptions . and . hold, then there exists a unique solution to equation () in the sense of Lp . Proof The proof is similar to Ren and Xia [] and Wei and Cai [], and we thus omit here. Theorem . Let Assumptions ., ., and . hold. For a given arbitrary small number δ > , there exist L > , ε ∈ (, ε ], and β ∈ (, ) such that
E xε (t) – yε (t) ≤ δ ,
∀t ∈ , Lε–β ,
()
for all ε ∈ (, ε ]. Proof The proof of this theorem will be shown in Section .
Similarly, with Theorem ., we can show that the convergence in probability of the standard solution of equation () and averaged solution of equation (). Corollary . Let Assumptions ., ., and . hold. For a given arbitrary small number δ > , there exists ε ∈ [, ε ] such that for all ε ∈ (, ε ], we have
lim P
ε→
sup xε (t) – yε (t) > δ = ,
where L and β are defined by Theorem ..
Mao and Mao Advances in Difference Equations (2016) 2016:77
Page 7 of 18
Remark . If jump term h = h˜ = , then equation () and () will become neutral SFDEs (SDDEs) which have been investigated by [–]. Under our assumptions, we can show that the solution of the averaged neutral SFDEs (SDDEs) converges to that of the standard one in pth moment and in probability. ˜ = , then equation () and () will Remark . If the neutral term D(·) = and D(·) reduce to SFDEs (SDDEs) with jumps which have been studied by [, ]. Hence, the corresponding results in [, ] are generalized and improved.
3 Some useful lemmas In order to prove our main results, we need to introduce the following lemmas. Lemma . Let p > and a, b ∈ Rn . Then, for > , p– |b|p p p– . |a| + |a + b| ≤ + p
Lemma . Let p > and a, b > . Then, for > , ap– b ≤
(p – ) p a + p– bp , p p
ap– b ≤
(p – ) p a + p– bp . p p
Lemma . Let p > and a, b ∈ Rn . Then, for any δ ∈ (, ), |a + b|p ≤
|a|p |b|p + . ( – δ)p– δ p–
Lemma . Let φ : R+ × Z → Rn and assume that t
φ(s, v) p π(dv) ds < ∞, p ≥ .
Z
Then there exists Dp > such that
t
p
˜ E sup
φ(s, v)N(ds, dv) ≤ Dp E ≤t≤u
Z
u
u
+E
φ(s, v) π(dv) ds
p
Z
φ(s, v) p π(dv) ds .
Z
The proof of Lemma . and Lemma . can be found in [], the proof of Lemma . can be found in [, ] and the proof of Lemma . can be obtained from Lemma . by δ putting = –δ . The following lemma shows that if the initial data are in Lp (p ≥ ) then the solution of averaged neutral SFDEs with Poisson random measure will be in Lp . p
Lemma . Let Assumptions . and . hold. If the initial data ξ ∈ LF ([–τ , ]; Rn ) for some p ≥ , then for any t ≥ , the unique solution yε (t) of equation () has the property that
p E sup yε (s) ≤ C,
()
–τ ≤s≤t
˜ where C = [( + C)Eξ p +
C¯
T C¯ T]e (–k )p . (–k )p
Mao and Mao Advances in Difference Equations (2016) 2016:77
Page 8 of 18
Proof By the Itô formula to V (t, yε (t) – D(yε,t )) = |yε (t) – D(yε,t )|p , we obtain
yε (t) – D(yε,t ) p
p = yε () – D(y ) + √ +p ε
t
LV yε (s), yε,s , s ds
t
yε (s) – D(yε,s ) p– yε (s) – D(yε,s ) g¯ (yε,s ) dw(s)
t
√
yε (s) – D(yε,s ) + εh(y ¯ ε,s , v) p
+
Z
p ˜ – yε (s) – D(yε,s ) N(ds, du),
()
where
p– x – D(y) f¯ (y) LV (x, y, t) = pε x – D(y)
p–
p(p – )
ε x – D(y) g¯ (y)
√
x – D(y) + εh(y, ¯ v) p – x – D(y) p π(dv). + +
Z
Taking the expectation on both sides of (), one gets
p
E sup yε (s) – D(yε,s )
≤s≤t
p
≤ E sup yε () – D(y ) + E sup ≤s≤t
s
p– pε yε (σ ) – D(yε,σ )
≤s≤t
× yε (σ ) – D(yε,σ ) f¯ (yε,σ ) dσ s
p–
p(p – )
ε yε (σ ) – D(yε,σ ) g¯ (yε,σ ) dσ + E sup ≤s≤t s
p– √
yε (σ ) – D(yε,σ ) g¯ (yε,σ ) dw(σ ) + E sup p ε yε (σ ) – D(yε,σ )
≤s≤t
s
√
yε (σ ) – D(yε,σ ) + εh(y ¯ ε,σ , v) p
+ E sup ≤s≤t
Z
p – yε (σ ) – D(yε,σ ) N(dσ , du)
p Ii . = E sup yε () – D(y ) + ≤s≤t
i=
By Lemma . and Assumption ., we get
p
p |D(y )|p
p– p–
yε () + E sup yε () – D(y ) ≤ + ≤s≤t p
p k y p p–
yε () + . ≤ + p–
()
Mao and Mao Advances in Difference Equations (2016) 2016:77
Page 9 of 18
p–
Letting = k ,
p E sup yε () – D(y ) ≤ ( + k )p Eξ p .
()
≤s≤t
Recalling Lemma ., there exists a > such that t
p
p
¯ (p – )
yε (s) – D(yε,s ) + p– f (yε,s ) ds I ≤ pεE p p t
p
¯ (p – ) p p
≤ pεE ( + k ) yε,s + p– f (yε,s ) ds. p p
()
By Assumption . and the basic inequality, we get
p
¯f (yε,s ) p ≤ (k ) + yε,s p . Letting =
√ k , +k
()
it follows from () and () that
t + yε,s p ds. I ≤ pε k ( + k )p– E
()
By Lemma . and Assumption ., we obtain I ≤
p(p – ) εE
p(p – ) ≤ εE
Letting =
t
t
(p – ) |yε (s) – D(yε,s )|p + p
g¯ (yε,s ) p ds p–
p
p (p – ) (k ) p p p ds. ( + k ) yε,s + p– + yε,s p p
k , (+k )
I ≤ (p – ) εk ( + k )p– E
t
+ yε,s p ds.
()
For the estimation of I : by the Burkholder-Davis-Gundy’s inequality, there exists a positive constant Cp such that
I ≤
√
εCp E
yε (s) – D(yε,s ) p– g¯ (yε,s ) ds
t
.
Further, by the Young inequality and Assumption ., we deduce that I ≤
p E sup yε (s) – D(yε,s )
≤s≤t t + yε,s p ds. + εCp k ( + k )p– E
()
Mao and Mao Advances in Difference Equations (2016) 2016:77
Page 10 of 18
˜ ˜ Finally, we will estimate I . Note N(dt, dv) = N(dt, dv) + π(dv) dt and N(dt, dv) is a martingale, one has t
I ≤ E
√
yε (s) – D(yε,s ) + εh(y ¯ ε,s , v) p – yε (s) – D(yε,s ) p π(dv) ds.
Z
By the mean value theorem, we obtain I ≤ pE
t
√
√
yε (s) – D(yε,s ) + θ ε h(y ¯ ε,s , v) p– ε h(y ¯ ε,s , v) π(dv) ds, Z
where |θ | ≤ . This, together with the basic inequality |a + b|p– ≤ p– (|a|p– + |b|p– ), implies that I ≤ pCE
t
√
√
yε (s) – D(yε,s ) p– ε h(y ¯ ε,s , v) + ε h(y ¯ ε,s , v) p π(dv) ds.
Z
By Lemma ., Assumptions . and ., it follows that
I ≤ pC k + π(Z) ( + k )
p–
√ √ p ε + k ε E
t
+ yε,s p ds.
()
Combining (), ()-(), we obtain
p E sup yε (s) – D(yε,s ) ≤ ( + k )p Eξ p + C¯ ≤s≤t
t
E + yε,s p ds,
t
where C¯ = (p – ) + Cp εk ( + k )p– + pε k ( + k )p– √ √ p + pC k + π(Z) ( + k )p– ε + k ε . On the other hand, by Lemma ., we have
p
E sup yε (s) ≤
p
k Eξ p + E sup yε (s) – D(yε,s )
p – k ( – k ) t ≤s≤t t C¯ C¯ ˜ ≤ CEξ p + T + Eyε,s p ds, ( – k )p ( – k )p t
≤s≤t
where C˜ =
k –k
+
(+k )p . (–k )p
Consequently,
p
˜ E sup yε (s) ≤ ( + C)Eξ p + –τ ≤s≤t
t
p
C¯ C¯ T + E sup yε (σ ) ds. p p ( – k ) ( – k ) t –τ ≤σ ≤s
Therefore, we apply the Gronwall inequality to get
p ˜ E sup yε (s) ≤ ( + C)Eξ p + –τ ≤s≤t
The proof is complete.
C¯ C¯ T T e (–k )p . p ( – k )
Mao and Mao Advances in Difference Equations (2016) 2016:77
Page 11 of 18
4 Proof of main results Proof of Theorem . By Lemma ., it follows that
xε (t) – yε (t) p = xε (t) – yε (t) – D(xε,t ) – D(yε,t ) + D(xε,t ) – D(yε,t ) p ≤
|xε (t) – yε (t) – [D(xε,t ) – D(yε,t )]|p ( – δ)p– +
|D(xε,t ) – D(yε,t )|p . δ p–
()
Letting δ = k and taking the expectation on both sides of (), we have E sup |xε (t) – yε (t)|p ≤ ≤t≤u
E sup≤t≤u |xε (t) – yε (t) – [D(xε,t ) – D(yε,t )]|p ( – k )p–
p + k E sup xε (t) – yε (t) . ≤t≤u
Consequently,
p E sup≤t≤u |xε (t) – yε (t) – [D(xε,t ) – D(yε,t )]|p
E sup xε (t) – yε (t) ≤ , ( – k )p ≤t≤u
()
where k ∈ (, ). Next, we will estimate E sup≤t≤u |xε (t) – yε (t) – [D(xε,t ) – D(yε,t )]|p . From () and (), we have xε (t) – yε (t) – D(xε,t ) – D(yε,t ) t f (s, xε,s ) – f¯ (yε,s ) ds =ε
+
√
t
g(s, xε,s ) – g¯ (yε,s ) dw(s)
ε
+
√
t
ε
¯ ε,s , v) N(ds, dv). h(s, xε,s , v) – h(y
Z
Using the elementary inequality |a + b + c|p ≤ p– (|a|p + |b|p + |c|p ), it follows that for any u ∈ [, T],
p E sup xε (t) – yε (t) – D(xε,t ) – D(yε,t )
≤t≤u
t
p f (s, xε,s ) – f¯ (yε,s ) ds
≤ p– εp E sup
≤t≤u
p
t
p p–
g(s, xε,s ) – g¯ (yε,s ) dw(s)
+ ε E sup
≤t≤u
t
p
p p–
¯ h(s, xε,s , v) – h(yε,s , v) N(ds, dv)
+ ε E sup
≤t≤u
= J + J + J .
Z
()
Mao and Mao Advances in Difference Equations (2016) 2016:77
Page 12 of 18
By the Hölder inequality, we get
f (s, xε,s ) – f¯ (yε,s ) p ds.
u
J ≤ p– εp up– E
By Lemma . and Assumption ., it follows that for any >
u
f (s, xε,s ) – f (s, yε,s ) + f (s, yε,s ) – f¯ (yε,s ) p ds
J ≤ p– εp up– E
≤
p– p p–
Letting = J ≤
ε u
√
k
p–
p– p–
+
u √ E
p
p k xε,s – yε,s p
+ f (s, yε,s ) – f¯ (yε,s ) ds.
,
p– p p–
ε u
( +
k )
u
p
+ p– εp up ( +
k )p E
u
p E sup xε (σ ) – yε (σ ) ds
≤σ ≤s
f (s, yε,s ) – f¯ (yε,s ) p ds.
u
Then Assumption . implies that J ≤ p– εp up– ( +
+ p– εp up ( +
k )p
u
p
E sup xε (σ ) – yε (σ ) ds
≤σ ≤s
k )p ψ (u) + E sup yε,t p .
()
≤t≤u
For the second term J of (): by the Burkholder-Davis-Gundy inequality, there exists a Cp > such that J ≤
p
g(s, xε,s ) – g¯ (yε,s ) ds
u
p– ε Cp E
≤
p
p
p– ε Cp u – E
p
g(s, xε,s ) – g¯ (yε,s ) p ds.
u
Similar to J , we get J ≤
p
p
p– ε Cp u – ( + p
p
p k )
+ p– ε Cp u ( +
u
p
E sup xε (σ ) – yε (σ ) ds ≤σ ≤s
k )p ψ (u) + E sup yε,t p .
()
≤t≤u
˜ Since N(dt, dv) = N(dt, dv) + π(dv) dt and using the basic inequality |a + b|p ≤ p– (|a|p + |b|p ), we have
t
p
¯ ˜ h(s, xε,s , v) – h(yε,s , v) N(ds, sup
dv)
≤t≤u Z
p
t
p p–
¯ h(s, xε,s , v) – h(yε,s , v) π(dv) ds
+ ε E sup
p
J ≤ p– ε E
≤t≤u
p
= p– ε (L + L ).
Z
()
Mao and Mao Advances in Difference Equations (2016) 2016:77
Page 13 of 18
By Lemma ., there exists a Dp such that L ≤ D p E
u
p
Z
h(s, xε,s , v) – h(y ¯ ε,s , v) p π(dv) ds .
u
+E
h(s, xε,s , v) – h(y ¯ ε,s , v) π(dv) ds
()
Z
By Assumptions . and ., we have
u
h(s, xε,s , v) – h(y ¯ ε,s , v) π(dv) ds
E
p
Z
≤ E k
u
xε,s – yε,s ds
p
u
¯ h(s, yε,s , v) – h(yε,s , v) π(dv) ds + u u Z p u ≤ E k xε,s – yε,s ds + uψ (u) + yε,s .
()
Using the basic inequality and the Hölder inequality, we obtain
u
h(s, xε,s , v) – h(y ¯ ε,s , v) π(dv) ds
E
p
Z
≤
p –
E k
u
xε,s – yε,s | ds
p
+ uψ (u)
p
+ uψ (u)
p
Eyε,s
p
≤
p –
p p – (k ) u
u
+ uψ (u)
p
p
E sup xε (σ ) – yε (σ ) ds ≤σ ≤s
+ uψ (u)
p
Eyε,s p .
()
Similar to the estimation of J , we derive that
u
h(s, xε,s , v) – h(y ¯ ε,s , v) p π(dv) ds
E
Z
≤ ( + k )E
u
xε,s – yε,s p ds + ( + k )E
u
≤ ( + k )
u
h(s, yε,s , v) – h(y ¯ ε,s , v) p π(dv) ds
Z
p E sup xε (σ ) – yε (σ ) ds ≤σ ≤s
+ ( + k )uψ (u) + E sup yε,t p . ≤t≤u
On the other hand, using the Hölder inequality, it follows that
p p– t
¯ L ≤ E sup h(s, xε,s , v) – h(yε,s , v) π(dv)
ds ds
≤t≤u Z u
p–
h(s, xε,s , v) – h(y ¯ ε,s , v) p π(dv) ds E ≤ uπ(Z)
t
Z
()
Mao and Mao Advances in Difference Equations (2016) 2016:77
≤ ( + k ) uπ(Z)
p–
u
Page 14 of 18
p
E sup xε (σ ) – yε (σ ) ds ≤σ ≤s
+ uψ (u) + E sup yε,t
p
.
()
≤t≤u
Hence, substituting ()-() into (), we get p– p p p p J ≤ p– ε Dp – (k ) u – + ( + k ) Dp + uπ(Z) u
p p p p p × E sup xε (σ ) – yε (σ ) ds + p– ε Dp – uψ (u) u – ≤σ ≤s
p– uψ (u) + E sup yε,t p . + ( + k ) Dp + uπ(Z)
()
≤t≤u
Combining with (), (), and (),
p E sup xε (t) – yε (t) – D(xε,t ) – D(yε,t )
≤t≤u
≤ C εE
u
p
p
sup xε (σ ) – yε (σ ) dt + C εu + E sup yε (t) , –τ ≤t≤u
≤σ ≤t
()
√ p p p p p p where C = p– ( + k )p (εp– up– + ε – Cp u – ) + p– ε – [Dp – (k ) u – + ( + √ p p p k )(Dp + (uπ(Z))p– )], C = p– ( + k )p (εp– up– ψ (u) + ε – Cp u – ψ (u)) + p– ε – × p p p [Dp – (uψ (u)) u – + ( + k )(Dp + (uπ(Z))p– )ψ (u)]. Hence Assumption . and Lemma . imply that
p E sup xε (t) – yε (t) – D(xε,t ) – D(yε,t )
≤t≤u
≤ C ε
u
p
E sup xε (σ ) – yε (σ ) dt ≤σ ≤t
+ C εu( + C).
()
Inserting () into (),
p E sup xε (t) – yε (t) ≤ ≤t≤u
C ε ( – k )p +
u
p E sup xε (σ ) – yε (σ ) dt
≤σ ≤t
C εu( + C) . ( – k )p
Finally, by the Gronwall inequality, we have
p C εu( + C) C εup E sup xε (t) – yε (t) ≤ e (–k ) . ( – k )p ≤t≤u Choose β ∈ (, ) and L > such that for every t ∈ [, Lε–β ] ⊆ [, T], E
p sup xε (t) – yε (t) ≤ cLε–β , t∈[,Lε–β ]
Mao and Mao Advances in Difference Equations (2016) 2016:77
C
Page 15 of 18
Lε–β
(+C) (–k )p where c = C(–k . Consequently, given any number δ , we can choose ε ∈ p e ) [, ε ] such that for each ε ∈ [, ε ] and for t ∈ [, Lε–β ],
p sup xε (t) – yε (t) ≤ δ .
E
t∈[,Lε–β ]
The proof is complete.
Proof of Theorem . The key technique to prove this theorem is already presented in the proof of Theorem ., so we here only highlight some parts which need to be modified. By Assumption ., J of () should become
u
J ≤ p– εp up– p– E
p
k p xε,s – yε,s + f (s, yε,s ) – f¯ (yε,s ) ds.
In fact, since the function k(·) is concave and increasing, there must exist a positive number cp such that k p |x| ≤ cp + |x|p ,
for all p ≥ .
Hence, J ≤ cp C
u
p + E sup xε (s) – yε (s) ds + cp C u
≤t≤u
+ uC ψ (u) + E sup yε,t p ,
()
≤t≤u
where C = p– εp up– p . Similarly, J and J can be estimated as J . Finally, all of required assertions can be obtained in the same way as the proof of Theorem .. The proof is therefore completed.
5 Examples Example . Consider the following neutral stochastic differential delay equations: ˜ x(t – τ ) = f˜ t, x(t), x(t – τ ) dt + g˜ t, x(t), x(t – τ ) dw(t) d x(t) – D + h˜ t, x(t), x(t – τ ), v N(dt, dv),
()
Z
where τ > is a constant delay and the coefficients of equation () satisfy Assumptions .-.. Obviously, if we define ˜ ϕ(–τ ) , D(ϕ) = D
f (t, ϕ) = f˜ t, ϕ(), ϕ(–τ ) ,
and g(t, ϕ) = g˜ t, ϕ(), ϕ(–τ ) ,
h(t, ϕ, v) = h˜ t, ϕ(), ϕ(–τ ), v ,
then equation () will become equation (). It is naturally seen that equation () has a unique solution in the sense of Lp . Meanwhile, similar to () and (), we can get the
Mao and Mao Advances in Difference Equations (2016) 2016:77
Page 16 of 18
standard form of equation () xε (t) = x() + D xε (t – τ ) – D x(–τ ) + +
√
t
f s, xε (s), xε (s – τ ) ds
t
ε
g s, xε (s), xε (s – τ ) dw(s)
+
√
t ε
h s, xε (s), xε (s – τ ), v N(ds, dv),
()
Z
and the averaging form of equation () yε (t) = x() + D yε (t – τ ) – D y(–τ ) + +
√
t
f¯ yε (s), yε (s – τ ) ds
t
ε
f¯ yε (s), yε (s – τ ) dw(s)
+
√
t ε
h¯ yε (s), yε (s – τ ), v N(ds, dv).
()
Z
Similar to the proof of Theorem . and Corollary ., we can show the convergence of the standard solution of equation () and the averaged one of equation () in pth moment and in probability. Example . Let N(t) be a scalar Poisson processes. Consider neutral SFDEs with Poisson processes of the form √ d xε (t) – D(xε,t ) = εf (t, xε,t ) dt + εh(t, xε,t ) dN(t),
()
with initial data xε, = x = ξ (t), when –τ ≤ t ≤ . Here f (t, x) = cos tx,
D(x) = .x, and
⎧ ⎪ if x = , ⎨, h(t, x) = ρ(x) = cx(log x– )α , if < x ≤ δ, ⎪ ⎩ cδ(log δ – )α , if x > δ, where α ≤ , c ≥ , and δ ∈ (, ) is sufficiently small. Let f¯ (yε,t ) = π
π
f (t, yε,t ) dt = yε,t
and ¯ ε,t ) = h(y π
π
h(t, yε,t ) dt = ρ(yε,t ).
Hence, we have the corresponding averaged equation √ d yε (t) – .yε,t = εyε,t dt + ερ(yε,t ) dN(t).
()
Mao and Mao Advances in Difference Equations (2016) 2016:77
Page 17 of 18
Clearly, the coefficient ρ(·) does not satisfy the Lipschitz condition. It is a concave nondecreasing continuous function on [, ∞] with ρ() = and +
+
dx = – d(log x) + + c log x x log x
= – log | log x| + = ∞, if α = , c x dx = dx = – d(– log x) α ρ (x) c + x(– log x) c + (– log x)α
(– log x)–α+ + = ∞, if α < . =– c –α + x dx = – ρ (x) c
Therefore, it follows that Assumption . is satisfied. Consequently, by Theorem . and Corollary ., we see that the solutions of averaged equation () will converge to that of the standard equation () in the sense of L and probability.
Competing interests The authors declare that they have no competing interests. Authors’ contributions All authors contributed equally to the manuscript and typed, read, and approved the final manuscript. Author details 1 School of Mathematics and Information Technology, Jiangsu Second Normal University, Nanjing, 210013, China. 2 Department of Mathematics and Statistics, University of Strathclyde, Glasgow, G1 1XH, UK. Acknowledgements The authors would like to thank the referees for their valuable comments and suggestions. The authors would also like to thank the National Natural Science Foundation of China under NSFC grant (11401261) and the NSF of Higher Education Institutions of Jiangsu Province (13KJB110005) for their financial support. Received: 11 January 2016 Accepted: 6 March 2016 References 1. Krylov, NM, Bogolyubov, NN: Les proprietes ergodiques des suites des probabilites en chaine. C. R. Math. Acad. Sci. 204, 1454-1546 (1937) 2. Besjes, JG: On the asymptotic methods for non-linear differential equations. J. Méc. 8, 357-373 (1969) 3. Volosov, VM: Averaging in systems of ordinary differential equations. Russ. Math. Surv. 17, 1-126 (1962) 4. Matthies, K: Time-averaging under fast periodic forcing of parabolic partial differential equations: exponential estimates. J. Differ. Equ. 174, 133-180 (2001) 5. Mierczynski, J, Shen, W: Time averaging for non-autonomous random linear parabolic equations. Discrete Contin. Dyn. Syst., Ser. B 9, 661-699 (2008) 6. Khasminskii, RZ: On the principle of averaging the Ito stochastic differential equations. Kibernetika 4, 260-279 (1968) 7. Freidlin, M, Wentzell, A: Random Perturbations of Dynamical Systems. Springer, New York (1998) 8. Golec, J, Ladde, G: Averaging principle and systems of singularly perturbed stochastic differential equations. J. Math. Phys. 31, 1116-1123 (1990) 9. Veretennikov, AY: On the averaging principle for systems of stochastic differential equations. Math. USSR Sb. 69, 271-284 (1991) 10. Khasminskii, RZ, Yin, G: On averaging principles: an asymptotic expansion approach. SIAM J. Math. Anal. 35, 1534-1560 (2004) 11. Givon, D, Kevrekidis, IG, Kupferman, R: Strong convergence of projective integration schemes for singular perturbed stochastic differential systems. Commun. Math. Sci. 4, 707-729 (2006) 12. Stoyanov, IM, Bainov, DD: The averaging method for a class of stochastic differential equations. Ukr. Math. J. 26, 186-194 (1974) 13. Kolomiets, VG, Melnikov, AI: Averaging of stochastic systems of integral-differential equations with Poisson noise. Ukr. Math. J. 43, 242-246 (1991) 14. Givon, D: Strong convergence rate for two-time-scale jump-diffusion stochastic differential systems. SIAM J. Multiscale Model. Simul. 6, 577-594 (2007) 15. Xu, Y, Duan, JQ, Xu, W: An averaging principle for stochastic dynamical systems with Lévy noise. Physica D 240, 1395-1401 (2011) 16. Yin, G, Ramachandran, KM: A differential delay equation with wideband noise perturbation. Stoch. Process. Appl. 35, 231-249 (1990) 17. Tan, L, Lei, D: The averaging method for stochastic differential delay equations under non-Lipschitz conditions. Adv. Differ. Equ. 2013, 38 (2013)
Mao and Mao Advances in Difference Equations (2016) 2016:77
Page 18 of 18
18. Xu, Y, Pei, B, Li, Y: Approximation properties for solutions to non-Lipschitz stochastic differential equations with Lévy noise. Math. Methods Appl. Sci. 38, 2120-2131 (2015) 19. Mao, W, You, S, Wu, X, Mao, X: On the averaging principle for stochastic delay differential equations with jumps. Adv. Differ. Equ. 2015, 70 (2015) 20. Bao, J, Yuan, C: Large deviations for neutral functional SDEs with jumps. Stoch. Int. J. Probab. Stoch. Process. 87, 48-70 (2015) 21. Jankovic, S, Randjelovic, J, Jovanovic, M: Razumikhin-type exponential stability criteria of neutral stochastic functional differential equations. J. Math. Anal. Appl. 355, 811-820 (2009) 22. Mao, X: Exponential stability in mean square of neutral stochastic differential functional equations. Syst. Control Lett. 26, 245-251 (1995) 23. Mao, X: Razumikhin-type theorems on exponential stability of neutral stochastic differential equations. SIAM J. Math. Anal. 28, 389-401 (1997) 24. Wu, F, Mao, X: Numerical solutions of neutral stochastic functional differential equations. SIAM J. Numer. Anal. 46, 1821-1841 (2008) 25. Zong, X, Wu, F, Huang, C: Exponential mean square stability of the theta approximations for neutral stochastic differential delay equations. J. Comput. Appl. Math. 286, 172-185 (2015) 26. Applebaum, D: Lévy Process and Stochastic Calculus. Cambridge University Press, Cambridge (2009) 27. Gikhman, II, Skorokhod, AV: Stochastic Differential Equations. Springer, Berlin (1972) 28. Kunita, H: Stochastic differential equations based on Lévy processes and stochastic flows of diffeomorphisms. In: Real and Stochastic Analysis. New Perspectives, pp. 305-373. Birkhäuser, Basel (2004) 29. Mao, W, Zhu, Q, Mao, X: Existence, uniqueness and almost surely asymptotic estimations of the solutions to neutral stochastic functional differential equations driven by pure jumps. Appl. Math. Comput. 254, 252-265 (2015) 30. Bao, J, Hou, Z: Existence of mild solutions to stochastic neutral partial functional differential equations with non-Lipschitz coefficients. Comput. Math. Appl. 59, 207-214 (2010) 31. Ren, Y, Xia, N: Existence, uniqueness and stability of the solutions to neutral stochastic functional differential equations with infinite delay. Appl. Math. Comput. 210, 72-79 (2009) 32. Wei, F, Cai, Y: Existence, uniqueness and stability of the solution to neutral stochastic functional differential equations with infinite delay under non-Lipschitz conditions. Adv. Differ. Equ. 2013, 151 (2013) 33. Mao, X: Stochastic Differential Equations and Applications. Ellis Horwood, Chichester (2008)