Mao et al. Advances in Difference Equations (2015) 2015:70 DOI 10.1186/s13662-015-0411-0
RESEARCH
Open Access
On the averaging principle for stochastic delay differential equations with jumps Wei Mao1* , Surong You2 , Xiaoqian Wu2 and Xuerong Mao3 *
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 investigate the averaging principle for stochastic delay differential equations (SDDEs) and SDDEs with pure jumps. By the Itô formula, the Taylor formula, and the Burkholder-Davis-Gundy inequality, we show that the solution of the averaged SDDEs converges to that of the standard SDDEs in the sense of pth moment and also in probability. Finally, two examples are provided to illustrate the theory. Keywords: averaging principle; stochastic delay differential equations; Poisson random measure; Lp convergence
1 Introduction The averaging principle for dynamical system is important in problems of mechanics, control and many other areas. It was first put forward by Krylov and Bogolyubov [], then by Gikhman [] and Volosov [] for non-linear ordinary differential equations. With the developing of the theory of stochastic analysis, many authors began to study the averaging principle for stochastic differential equations (SDEs). See, for instance, Khasminskii [], Khasminskii and Yin [], Golec and Ladde [], Veretennikov [, ], Givon et al. [], Tan and Lei []. On the other hand, in real phenomena, many real systems may be perturbed by abrupt pulses or extreme events and these systems with white noise are not always appropriate to interpret real data in a reasonable way. A more natural mathematical framework for these phenomena has been taken into account other than purely Brownian perturbations. It is recognized that SDEs with jumps are quite suitable to describe such discontinuous systems. In the meantime, the averaging method for a class of stochastic equations with jumps has received much attention from many authors and there exists some literature [–] concerned with the averaging method for SDEs with jumps. Motivated by the above discussion, in this paper we study the averaging principle for a class of stochastic delay differential equations (SDDEs) with variable delays and jumps. To the best of our knowledge, the published papers on the averaging method are concentrated on the case of SDEs, there are few results concerning the averaging principle for SDDEs with jumps. What is more, associated with all the work mentioned above, we pay special attention to the fact that most authors just focus on the mean-square convergence of the solution of the averaged stochastic equations and that of the standard stochastic equations. They do not consider the general pth (p > ) moment convergence case. In order to close this gap, the main aim of this paper is to study the solution of the averaged © 2015 Mao et al.; licensee Springer. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly credited.
Mao et al. Advances in Difference Equations (2015) 2015:70
Page 2 of 19
SDDEs converging to that of the standard SDDEs in the sense of pth moment. By using the Itô formula, the Taylor formula, and stochastic inequalities, we give the proof of the pth moment convergence results. It should be pointed out that we will not get the pth moment convergence results by using the proof of [–] and we need to develop several new techniques to deal with the pth moment case and the term with Poisson random measure. The results obtained are a generalization and improvement of some results in [–]. The rest of this paper is organized as follows. In Section , we prove that the solution of the averaged SDDEs converges to that of the standard SDDEs in the sense of pth moment and also in probability; in Section we also consider the above results as regards the pure jump case. Finally, we give two examples to illustrate the theory in Section .
2 Averaging principle for Brownian motion case 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 C([–τ , ]; Rn ) denote the family of all continuous functions ϕ from [–τ , ] → Rn . The space C([–τ , ]; Rn ) b ([–τ , ]; Rn ) deis assumed to be equipped with the norm ϕ = sup–τ ≤t≤ |ϕ(t)|. CF note the family of all almost surely bounded, F -measurable, C([–τ , ]; Rn ) valued ranp dom variables ξ = {ξ (θ ) : –τ ≤ θ ≤ }. Let p ≥ , LF ([–τ , ]; Rn ) denote the family of all F measurable, C([–τ , ]; Rn )-valued random variables ϕ = {ϕ(θ ) : –τ ≤ θ ≤ } such that E sup–τ ≤θ≤ |ϕ(θ )|p < ∞. Consider the following SDDEs: dx(t) = f t, x(t), x δ(t) dt + g t, x(t), x δ(t) dwt ,
()
where f : [, T]×Rn ×Rn → Rn and g : [, T]×Rn ×Rn → Rn×m are both Borel-measurable functions. The function δ : [, T] → R is the time delay which satisfies –τ ≤ δ(t) ≤ t. The initial condition x is defined by p x = ξ = ξ (t) : –τ ≤ t ≤ ∈ LF [–τ , ]; Rn , that is, ξ is an F -measurable C([–τ , ]; Rn )-valued random variable and Eξ p < ∞. To study the averaging method of (), we need the following assumptions. (H.) For all x , y , x , y ∈ Rn and t ∈ [, T], there exist two positive constants k and k such that f (t, x , y ) – f (t, x , y ) ∨ g(t, x , y ) – g(t, x , y ) ≤ k |x – x | + |y – y |
()
f (t, , ) ∨ g(t, , ) ≤ k .
()
and
Clearly, condition () together with () implies the linear growth condition f (t, x, y) ∨ g(t, x, y) ≤ K + |x| + |y| , where K = max{k , k }.
()
Mao et al. Advances in Difference Equations (2015) 2015:70
Page 3 of 19
In fact, we have, for any x, y ∈ Rn , f (t, x, y) ≤ f (t, x, y) – f (t, , ) + f (t, , ) ≤ k |x| + |y| + k ≤ max{k , k } + |x| + |y| . Similar to the above derivation, we have g(t, x, y) ≤ max{k , k } + |x| + |y| , which implies condition (). Similar to the proof of [], we have the following existence result. Theorem . Under condition (H.), () has a unique solution in Lp , p ≥ . Moreover, we have p E sup x(t) < C. ≤t≤T
The proof of Theorem . is given in the Appendix. Next, let us consider the standard form of SDDEs (),
t
xε (t) = ξ (t) + ε
√ f s, xε (s), xε δ(s) ds + ε
t
g s, xε (s), xε δ(s) dws ,
()
where the coefficients f , g have the same conditions as in (), () and ε ∈ [, ε ] is a positive small parameter with ε is a fixed number. Let f¯ (x, y) : Rn × Rn → Rn and g¯ (x, y) : Rn × Rn → Rn×m be measurable functions, satisfying condition (H.). We also assume that the following conditions are satisfied. (H.) For any x, y ∈ Rn , there exist two positive bounded functions ϕi (T ), i = , , such that T
T
a(s, x, y) – a¯ (x, y)p ds ≤ ϕi (T ) + |x|p + |y|p ,
where a = f , g and limT →∞ ϕi (T ) = . Then we have the averaging form of the corresponding standard SDDEs
t
yε (t) = ξ (t) + ε
√ f¯ yε (s), yε δ(s) ds + ε
t
g¯ yε (s), yε δ(s) dws .
()
Obviously, under condition (H.), the standard SDDEs () and the averaged SDDEs () has a unique solution on t ∈ [, T], respectively. Now, we present and prove our main results, which are used for revealing the relationship between the xε (t) and yε (t). Theorem . Let the conditions (H.), (H.) hold. For a given arbitrary small number δ > , there exist L > , ε ∈ (, ε ], and β ∈ (, ) such that p Exε (t) – yε (t) ≤ δ , for all ε ∈ (, ε ].
∀t ∈ , Lε–β ,
()
Mao et al. Advances in Difference Equations (2015) 2015:70
Page 4 of 19
Proof For simplicity, denote the difference eε (t) = xε (t) – yε (t). From () and (), we have
t
eε (t) = ε
f s, xε (s), xε δ(s) – f¯ yε (s), yε δ(s) ds
√
+
ε
t
g s, xε (s), xε δ(s) – g¯ yε (s), yε δ(s) dws .
By the Itô formula (see []), we have, for p ≥ , eε (t)p
t
eε (s)p– eε (s) f s, xε (s), xε δ(s) – f¯ yε (s), yε δ(s) ds
= pε
pε +
t
eε (s)p– g s, xε (s), xε δ(s) – g¯ yε (s), yε δ(s) ds
p– p(p – )ε t eε (s) eε (s) g s, xε (s), xε δ(s) – g¯ yε (s), yε δ(s) ds + t p– √ + p ε eε (s) eε (s) g s, xε (s), xε δ(s) – g¯ yε (s), yε δ(s) dws .
()
Using the basic inequality ab ≤ a + b and taking expectation on both sides of (), it follows that, for any u ∈ [, T], p E sup eε (t) ≤t≤u
u
eε (t)p– f t, xε (t), xε δ(t) – f¯ yε (t), yε δ(t) dt
≤ pεE
p– p(p – )ε u + eε (t) g t, xε (t), xε δ(t) – g¯ yε (t), yε δ(t) dt t p– √ + E sup p ε eε (s) eε (s) g s, xε (s), xε δ(s) – g¯ yε (s), yε δ(s) dws ≤t≤u
= pεI +
p(p – )ε I + I .
()
By the Young inequality, it follows that for any > I ≤ E
u
+
p (p – ) eε (t) p
¯ yε (t), yε δ(t) p dt, δ(t) – f f t, x (t), x ε ε p– p
where the second term of () can be written by f t, xε (t), xε δ(t) – f¯ yε (t), yε δ(t) p = f t, xε (t), xε δ(t) – f t, yε (t), yε δ(t) p + f t, yε (t), yε δ(t) – f¯ yε (t), yε δ(t) .
()
Mao et al. Advances in Difference Equations (2015) 2015:70
Page 5 of 19
For any > , we derive that f t, xε (t), xε δ(t) – f¯ yε (t), yε δ(t) p p p– p– f t, xε (t), xε δ(t) – f t, yε (t), yε δ(t) ≤ +
p + f t, yε (t), yε δ(t) – f¯ yε (t), yε δ(t) .
()
By (H.), we have f t, xε (t), xε δ(t) – f¯ yε (t), yε δ(t) p
p p ≤ + k eε (t) + eε δ(t)
p + f t, yε (t), yε δ(t) – f¯ yε (t), yε δ(t) )
p p p– p– ≤ + (k ) sup eε (σ )
≤σ ≤t p ¯ + f t, yε (t), yε δ(t) – f yε (t), yε δ(t) .
p– p–
√ Letting = ( k )p– yields f t, xε (t), xε δ(t) – f¯ yε (t), yε δ(t) p p ≤ ( + k )p– k sup eε (σ ) ≤σ ≤t
p + f t, yε (t), yε δ(t) – f¯ yε (t), yε δ(t) .
()
Inserting () into (), we have u
p p (p – ) eε (t) + p– ( + k )p– k sup eε (σ ) p ≤σ ≤t p p + f t, yε (t), yε δ(t) – f¯ yε (t), yε δ(t) dt.
I ≤ E
By setting = + I ≤ ( +
√
()
k , we get
k )E
p sup eε (σ ) dt
u
≤σ ≤t
+ ( +
k )uE
u
p f t, yε (t), yε δ(t) – f¯ yε (t), yε δ(t) dt. u
From condition (H.), we then see that I ≤ ( +
k )E
+ ( +
u
p sup eε (σ ) dt
≤σ ≤t
p p k )uϕ (u) + E sup yε (t) + E sup yε (t) . –r≤t≤
≤t≤u
()
Mao et al. Advances in Difference Equations (2015) 2015:70
Page 6 of 19
Next, we will estimate I of (). Using the Young inequality again, it follows that for any
> I ≤ E
u
+
p (p – ) eε (t) p
g t, xε (t), xε δ(t) – g¯ yε (t), yε δ(t) p dt. (p–)/
()
p
Similar to the computation of (), we can obtain g t, xε (t), xε δ(t) – g¯ yε (t), yε δ(t) p p ≤ ( + k )p– k sup eε (σ ) ≤σ ≤t
p + g t, yε (t), yε δ(t) – g¯ yε (t), yε δ(t) .
()
Substituting () into (), I ≤ E
u
p (p – ) eε (t) p p ( + k )p– k sup eε (σ ) (p–)/
+
≤σ ≤t
p
p dt. + g t, yε (t), yε δ(t) – g¯ yε (t), yε δ(t) Letting = ( +
√
k ) , we get
u p sup eε (σ ) k ) E
I ≤ ( +
≤σ ≤t
p + g t, yε (t), yε δ(t) – g¯ yε (t), yε δ(t) dt. From condition (H.), it follows that I ≤ ( +
+ ( +
k ) E
p sup eε (σ ) dt
u
≤σ ≤t
p p k ) uϕ (u) + E sup yε (t) + E sup yε (t) . –r≤t≤
()
≤t≤u
On the other hand, by the Burkholder-Davis-Gundy inequality, we have
u
I ≤ E
p– g t, xε (t), xε δ(t) – g¯ yε (t), yε δ(t) ds p εeε (t)
p ≤ E sup eε (t) ≤t≤u
u
p– p εeε (t) g t, xε (t), xε δ(t)
– g¯ yε (t), yε δ(t) ds
Mao et al. Advances in Difference Equations (2015) 2015:70
Page 7 of 19
p ≤ E sup eε (t) + Kp εE ≤t≤u – g¯ yε (t), yε δ(t) ds.
eε (t)p– g t, xε (t), xε δ(t)
u
Similar to the estimation of I , we derive that I ≤
u p p sup eε (σ ) dt E sup eε (t) + Kp ε( + k ) E ≤t≤u ≤σ ≤t p p + ( + k ) uϕ (u) + E sup yε (t) + E sup yε (t) . –r≤t≤
()
≤t≤u
Hence, combing (), (), and (), p E sup eε (t) ≤ c εE ≤t≤u
u
p sup eε (σ ) dt
≤σ ≤t
p p + c εu + E sup yε (t) + E sup yε (t) , –r≤t≤
≤t≤u
where k )p + (Kp + p – )( + k ) , c = ( + k )p ϕ (u) + (Kp + p – )( + k )ϕ (u) .
c = ( +
By Theorem ., we have the following fact: for each t ≥ , if Eξ p < ∞, then E|yε (t)|p < ∞. Hence condition (H.) implies that p E sup eε (t) ≤ c εu + Eξ p + C + c εE ≤t≤u
u
p sup eε (σ ) dt.
≤σ ≤t
Finally, by the Gronwall inequality, we have p E sup eε (t) ≤ c εu + Eξ p + C ec εu . ≤t≤u
Choose β ∈ (, ) and L > such that for every t ∈ [, Lε–β ] ⊆ [, T], E
p sup xε (t) – yε (t) ≤ cLε–β , t∈[,Lε–β ] –β
where c = c ( + Eξ p + C)ec Lε . Consequently, given any number δ , we can choose ε ∈ [, ε ] such that for each ε ∈ [, ε ] and for t ∈ [, Lε–β ], E
p sup xε (t) – yε (t) ≤ δ . t∈[,Lε–β ]
The proof is completed.
With Theorem ., it is easy to show the convergence in probability between xε (t) and yε (t).
Mao et al. Advances in Difference Equations (2015) 2015:70
Page 8 of 19
Corollary . Let the conditions (H.) and (H.) 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 .. 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.
3 Averaging principle for pure jump case In this section we turn to the counterpart for SDDEs with jumps. We further need to introduce some notations. 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 variables ξ = {ξ (θ ) : –τ ≤ θ ≤ }. p Let p ≥ , LF ([–τ , ]; Rn ) denote the family of all F measurable, D([–τ , ]; Rn )-valued random variables ϕ = {ϕ(θ ) : –τ ≤ θ ≤ } such that E sup–τ ≤θ≤ |ϕ(θ )|p < ∞. Let (Z, B (Z)) be a measurable space and π(dv) a σ -finite measure on it. Let {¯p = p¯ (t), t ≥ } be a stationary Ft -Poisson point process on Z with characteristic measure π . Then, for A ∈ B (Z – {}), here ∈ the closure of A, the Poisson counting measure N is defined by IA p¯ (s) = # N (, t] × A :=
< s ≤ t, p¯ (s) ∈ A .
By [], we find that there exists a σ -finite measure π such that E N(t, A) = π(A)t,
e(–tπ(A))(π(A)t)n P N(t, A) = n = , n!
where N(t, A) := N((, t] × A). This measure π is said the Lévy measure. Then the compensated Poisson random measure N˜ is defined by N˜ [, t], A := N [, t], A – tπ(A),
t > .
We refer to Ikeda and Watanable [] and Applebaum [] for the details of Poisson point processes and Lévy processes. In this section, we consider the SDDEs with pure jumps: dx(t) = f t, x(t), x δ(t) dt +
Z
˜ h t, x(t), x δ(t) , v N(ds, dv),
()
Mao et al. Advances in Difference Equations (2015) 2015:70
Page 9 of 19
where f : [, T] × Rn × Rn → Rn and h : [, T] × Rn × Rn × Z → Rn are both Borelmeasurable functions. The initial condition x is defined by p x = ξ = ξ (t) : –τ ≤ t ≤ ∈ LF [–τ , ]; Rn . To guarantee the existence and uniqueness of the solution, we introduce the following conditions on the jump term. (H.) For all x , y , x , y ∈ Rn and v ∈ Z, there exist two positive constants k and k such that
h(t, x , y , v) – h(t, x , y , v) π(dv) ≤ k |x – x | + |y – y | ,
()
h(t, x, y, v) π(dv) ≤ k + |x| + |y| .
()
Z
Z
(H.) For all x , x , y , y ∈ Rn , v ∈ Z and p > , there exists L > such that h(t, x , y , v) – h(t, x , y , v) ≤ L |x – x | + |y – y | |v| , with
Z
()
|v|p π(dv) < ∞.
Theorem . Under conditions (H.), (H.), and (H.), () has a unique solution in Lp , p ≥ . Moreover, we have p E sup x(t) < C. ≤t≤T
Proof Similar to the proof of [], we find that () has a unique solution in Lp .
Let us consider the standard form of SDDEs with pure jumps (),
f s, xε (s), xε δ(s) ds
t
xε (t) = ξ (t) + ε
+
√
t ε
˜ h s, xε (s), xε δ(s) , v N(ds, dv),
()
Z
where the coefficients f , h have the same conditions as in (H.), (H.), and (H.) and ε ∈ [, ε ] is a positive small parameter with ε is a fixed number. ¯ y, v) : Rn ×Rn ×Z → Rn be measurable functions, satisLet f¯ (x, y) : Rn ×Rn → Rn and h(x, fying conditions (H.), (H.), and (H.). We also assume that the following inequalities are satisfied. (H.) For any x, y ∈ Rn and v ∈ Z, there exists a positive bounded function ϕ (T ), such that T
T
h(t, x, y, v) – h(x, ¯ y, v)p π(dv) dt ≤ ϕ (T ) + |x|p + |y|p , Z
where limT →∞ ϕ (T ) = .
Mao et al. Advances in Difference Equations (2015) 2015:70
Page 10 of 19
Then the averaging form of () is given by
f¯ yε (s), yε δ(s) ds
t
yε (t) = ξ (t) + ε
√
+
t ε
˜ h¯ yε (s), yε δ(s) , v N(ds, dv).
()
Z
Obviously, under conditions (H.), (H.), and (H.), the standard SDDEs with pure jumps () and the averaged SDDEs with pure jumps () have unique solutions on t ∈ [, T], respectively. Now, we present and prove our main results. Theorem . Let the conditions (H.) and (H.)-(H.) hold. For a given arbitrary small number δ > and p ≥ , there exist L > , ε ∈ (, ε ], and β ∈ (, ) such that p Exε (t) – yε (t) ≤ δ ,
∀t ∈ , Lε–β ,
()
for all ε ∈ (, ε ]. Proof For simplicity, denote the difference eε (t) = xε (t) – yε (t). From () and (), we have
t
eε (t) = ε
+
√
f s, xε (s), xε δ(s) – f¯ yε (s), yε δ(s) ds t
˜ h s, xε (s), xε δ(s) , v – h¯ yε (s), yε δ(s) , v N(ds, dv).
ε
()
Z
By the Itô formula (see [, ]), we obtain eε (t)p
t
eε (s)p– eε (s) f s, xε (s), xε δ(s) – f¯ yε (s), yε δ(s) ds
= pε
t
√ eε (s) + ε h s, xε (s), xε δ(s) , v – h¯ yε (s), yε δ(s) , v p
+
Z
Z
p p– √ – eε (s) – p ε eε (s) eε (s) h s, xε (s), xε δ(s) , v – h¯ yε (s), yε δ(s) , v π(dv) ds t √ eε (s) + ε h s, xε (s), xε δ(s) , v – h¯ yε (s), yε δ(s) , v p + p ˜ – eε (s) N(ds, dv).
()
Using the basic inequality ab ≤ a + b and taking expectations on both sides of (), it follows that p E sup eε (t) ≤t≤u
u
eε (t)p– f t, xε (t), xε δ(t) – f¯ yε (t), yε δ(t) dt
≤ pεE
Mao et al. Advances in Difference Equations (2015) 2015:70
√ + p εE sup
t
≤t≤u
Page 11 of 19
eε (s)p– eε (s) h s, xε (s), xε δ(s) , v
Z
˜ – h¯ yε (s), yε δ(s) , v N(ds, dv) t √ eε (s) + ε h s, xε (s), xε δ(s) , v – h¯ yε (s), yε δ(s) , v p + E sup ≤t≤u
Z
p p– √ – eε (s) – p ε eε (s) eε (s) h s, xε (s), xε δ(s) , v – h¯ yε (s), yε δ(s) , v N(ds, dv) = pεI + J + J .
()
By the Burkholder-Davis-Gundy inequality, there exists a positive constant cp such that
u
J ≤ cp E
p– h t, xε (t), xε δ(t) , v p εeε (t) Z
– h¯ yε (t), yε δ(t) , v π(dv) dt
p ≤ cp E sup eε (t) ≤t≤u
u
p– p εeε (t) h t, xε (t), xε δ(t) , v Z
– h¯ yε (t), yε δ(t) , v π(dv) dt
.
Next, the Young inequality implies that
u p p– E p εeε (t) h t, xε (t), xε δ(t) , v J ≤ cp E sup eε (t)
Z ≤t≤u ¯ – h yε (t), yε δ(t) , v π(dv) dt u p cp p ε cp eε (t)p– h t, xε (t), xε δ(t) , v E sup eε (t) + ≤ E ≤t≤u Z – h¯ yε (t), yε δ(t) , v π(dv) dt, where > . By setting = c– p , we get J ≤
u p cp p ε eε (t)p– h t, xε (t), xε δ(t) , v E sup eε (t) + E ≤t≤u Z – h¯ yε (t), yε δ(t) , v π(dv) dt.
Similar to the estimate of I , we have u
p p p + |v| π(dv) J ≤ E sup eε (t) + c ε E sup eε (σ ) dt ≤t≤u ≤σ ≤t Z u c h t, yε (t), yε δ(t) , v – h¯ yε (t), yε δ(t) , v p π(dv) dt, + εE Z
Mao et al. Advances in Difference Equations (2015) 2015:70
where c = cp p ( +
√
Page 12 of 19
L) . Condition (H.) implies that
u p p p + |v| π(dv) E sup eε (σ ) dt J ≤ E sup eε (t) + c ≤t≤u ≤σ ≤t Z p p c + uϕ (u) + E sup yε (t) + E sup yε (t) . –r≤t≤ ≤t≤u
()
˜ Finally, let us estimate J . Since N(dt, du) is a martingale measure and N(dt, du) = ˜ N(dt, du) + π(du) dt, we have
u
√ eε (t) + ε h t, xε (t), xε δ(t) , v – h¯ yε (t), yε δ(t) , v p
J = E
Z
p p– √ – eε (t) – p ε eε (t) eε (t) h t, xε (t), xε δ(t) , v – h¯ yε (t), yε δ(t) , v N(dt, dv). Note that J has the form
u
E
Z
f eε (t) + h˜ vε (t) – f eε (t) – f eε (t) h˜ vε (t) π(dv) dt,
√ ¯ ε (t), yε (δ(t)), v)]. By the Taylor where f (x) = |x|p and h˜ vε (t) = ε[h(t, xε (t), xε (δ(t)), v) – h(y formula, there exists a positive constant M(p) such that f eε (t) + h˜ vε (t) – f eε (t) – f eε (t) h˜ vε (t) p p– p = eε (t) + h˜ vε – eε (t) – peε (t) eε (t) h˜ vε (t) p– ≤ M(p)eε (t) + h˜ vε (t) ˜hvε (t) . Applying the basic inequality |a + b|p– ≤ p– (|a|p– + |b|p– ), we have
u
J ≤ M(p)p– E
Z
eε (t)p– h˜ v (t) + h˜ v (t)p π(dv) dt. ε ε
Similar to J , we derive that
J ≤ c ε
+ |v|p π(dv)
u
Z
p E sup eε (σ ) dt ≤σ ≤t
p p + c εuϕ (u) + E sup yε (t) + E sup yε (t) , –r≤t≤
where c = M(p)p– ( + p E sup eε (t) ≤ c ε ≤t≤u
√
L)p . Combing () and (), we have
u
≤t≤u
p E sup eε (σ ) dt ≤σ ≤t
p p + c ε + E sup yε (t) + E sup yε (t) ,
–r≤t≤
≤t≤u
()
Mao et al. Advances in Difference Equations (2015) 2015:70
Page 13 of 19
where c = p( + c = p( +
k ) + (c + c )
+ |v|p π(dv) ,
Z
k )uϕ (u) + (c + c )uϕ (u).
By Theorem ., we have the following fact: for each t ≥ , if Eξ p < ∞, then E|yε (t)|p < ∞. Hence, condition (H.) implies that p E sup eε (t) ≤ c ε + Eξ p + C + c εE ≤t≤u
u
p sup eε (σ ) dt.
≤σ ≤t
By the Gronwall inequality, we obtain p E sup eε (t) ≤ c ε + Eξ p + C ec εu . ≤t≤u
Consequently, given any number δ , we can choose ε ∈ [, ε ] such that for each ε ∈ [, ε ] and for t ∈ [, Lε–β ], p sup xε (t) – yε (t) ≤ δ .
E
t∈[,Lε–β ]
The proof is completed.
Similarly, we have the following results as regards the convergence in probability between xε (t) and yε (t). Corollary . Let the conditions (H.) and (H.)-(H.) 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 .. Remark . When the time delay δ(t) = t, () will reduce to SDEs with jumps, which have been studied by [–]. In particularly, if p = in (), then we have the mean-square sense convergence of the standard solution of () and the averaged solution of (). So the corresponding results in [–] are generalized and improved. Remark . In [], Tan and Lei studied the averaging method for SDDEs under nonLipschitz conditions. In particular, we see that the Lipschitz condition is a special case of non-Lipschitz conditions which are studied by many scholars [–]. Similarly, by applying the proof of Theorem ., we can prove the standard solution of () converges to the averaged solution of () in the pth moment under non-Lipschitz conditions. In other words, we obtain a more general result on the averaging principle for SDDEs with jumps than Theorem ..
Mao et al. Advances in Difference Equations (2015) 2015:70
Page 14 of 19
4 Examples In this section, we construct two examples to demonstrate the averaging principle results. ˜ Example . Let N(dt, dv) be a compensated Poisson random measures and is given by π(du) dt = λf (v) dv dt, where λ > is a constant and f (v) = √
π v
e–
(ln v)
≤ v < ∞,
,
is the density function of a lognormal random variable. Consider the following SDEs with pure jumps: √ dxε (t) = εf t, xε (t) dt + ε
∞
˜ φ(v)h t, xε (t) N(dt, dv),
()
with initial data xε () = x , where δ(t) = t. Here f (t, xε (t)) = sin txε (t) and h(t, xε (t)) = –xε (t) log xε (t). Let f¯ t, yε (t) = π
f t, yε (t) dt = yε (t) π
π
and h¯ t, yε (t), v = π
φ(v)h t, yε (t) dt = –φ(v)yε (t) log yε (t).
π
Hence, we have the corresponding averaged SDEs with pure jumps √ dyε (t) = ε yε (t) dt – ε π
∞
˜ φ(v)yε (t) log yε (t)N(dt, dv).
()
Now, we impose the non-Lipschitz condition on (). (H.) For all x, y ∈ Rn , v ∈ Z, and p ≥ , f (t, x) – f (t, y)p ∨
h(t, x, v) – h(t, y, v)p π(dv) ≤ ρ |x – y|p ,
()
Z
where ρ(·) is a concave nondecreasing function from R+ to R+ such that ρ() = , ρ(u) > du = ∞. for u > and ρ(u) Let us return to (). It is easy to see that h(t, ·) is a nondecreasing, positive and concave function on [, ∞] with h(t, ) = . Moreover, by a straight computation, we have
du = – h(t, u)
du = – lim ε→ u log u
ε
du = – lim ε→ u log u
log ε
dv = ∞. v
Hence, the coefficients of () and () satisfy our condition (H.). Similar to the proof of [–], we find that () and () have unique solutions in Lp , p ≥ , respectively. Similar to the proof of Theorem ., we find that the standard solution of () converges to the averaged solution of () in the sense of the pth moment.
Mao et al. Advances in Difference Equations (2015) 2015:70
Page 15 of 19
Corollary . Let the conditions (H.), (H.), and (H.) hold and δ(t) = t. For a given arbitrary small number δ > and p ≥ , there exist L > , ε ∈ (, ε ], and β ∈ (, ) such that p Exε (t) – yε (t) ≤ δ ,
∀t ∈ , Lε–β ,
()
for all ε ∈ (, ε ]. The proof of Corollary . is given in the Appendix. Remark . Similarly to Corollary ., we can show the convergence in probability of the standard solution of () and the averaged solution of (). Example . Let wt be a one-dimensional Brownian motion and the compensated Pois˜ ˜ son random measure N(dt, dv) is defined by Example .. Of course N(dt, dv) and wt are assumed to be independent. Consider the following linear SDDEs with jumps: √ dxε (t) = ε axε (t) + bxε (t – τ ) dt + ε sin txε (t – τ ) dwt ∞ √ ˜ +c ε vxε (t)N(dt, dv),
()
with initial data xε (t) = ξ (t), when t ∈ [–τ , ], τ is a fixed delay, where δ(t) = t – τ , T = Nτ , N ∈ Z+ , a, b, c ∈ R. Here f t, xε (t), xε (t – τ ) = axε (t) + bxε (t – τ ),
√ g t, xε (t), xε (t – τ ) = ε sin txε (t – τ )
and h t, xε (t), xε (t – τ ), v = cvxε (t). Let f¯ yε (t), yε (t – τ ) = π
g¯ yε (t), yε (t – τ ) =
π
π
f t, yε (t), yε (t – τ ) dt = ayε (t) + byε (t – τ ),
π
g t, yε (t), yε (t – τ ) dt = yε (t – τ ),
h¯ yε (t), yε (t – τ ), v = π
π
h t, yε (t), yε (t – τ ), v dt = cvyε (t).
Hence, we have the corresponding averaged SDDEs with jumps √ dyε (t) = ε ayε (t) + byε (t – τ ) dt + εyε (t – τ ) dwt ∞ √ ˜ +c ε vyε (t)N(dt, dv).
()
When t ∈ [, τ ], the explicit solution of SDDEs with jumps is given by t t √ yε (t) = φ (t) ξ () + εb φ– (s)ξ (s – τ ) ds + ε φ– (s)ξ (s – τ ) dws ,
()
Mao et al. Advances in Difference Equations (2015) 2015:70
Page 16 of 19
where t φ (t) = exp at +
t
∞
+
∞
√ √ ln( + c εv) – c εv π(dv) ds
√ ˜ ln( + c εv)N(dt, dv) .
When t ∈ [τ , τ ], the explicit solution of SDDEs with jumps is given by t t √ – – φτ (s)yε (s – τ ) ds + ε φτ (s)yε (s – τ ) dws , yε (t) = φτ (t) yε (τ ) + εb τ
()
τ
where t φτ (t) = exp a(t – τ ) + τ
t
∞
+ τ
∞
√ √ ln( + c εv) – c εv π(dv) ds
√ ˜ ln( + c εv)N(dt, dv) .
Repeating this procedure over the interval [τ , τ ], [τ , τ ], etc. we can obtain the explicit solution yε (t) on the entire interval [, T]. On the other hand, it is easy to find that the conditions of Theorems . and . are satisfied, so the solution of averaged SDDEs with jumps () will converge to that of the standard SDDEs with jumps () in the sense of the pth moment and in probability.
5 Conclusion In this paper, we study the averaging method for SDDEs and SDDEs with pure jumps. By applying the Itô formula, the Taylor formula, and the BDG inequality, we prove that the solution of the averaged SDDEs converges to that of the standard SDDEs in the sense of the pth moment and also in probability. Finally, two examples are provided to demonstrate the proposed results. Appendix Proof of Theorem . Let x (t) = ξ () for t ∈ [, T] and define the sequence of successive approximations to () xn (t) = ξ () +
t
f s, xn– (s), xn– δ(s) ds +
t
g s, xn– (s), xn– δ(s) dws .
()
The proof will be split into the following steps. Step . Let us show that {xn (t)}n≥ is bounded. Let ftn = f (t, xn (t), xn (δ(t))), gtn = g(t, xn (t), xn (δ(t))). From (), by the inequality |a + b + c|p ≤ p– [|a|p + |b|p + |c|p ], we have t p s p n p p– p p– n– p– n– E sup x (s) ≤ Eξ + E fs ds + E sup gσ dwσ . ≤s≤t
≤s≤t
Using the Hölder inequality and the BDG inequality, we get p E sup xn (s) ≤ p– Eξ p + p– t p– E ≤s≤t
t
p f n– p ds + p– cp t – E s
t
g n– p ds. s
Mao et al. Advances in Difference Equations (2015) 2015:70
Page 17 of 19
By condition (H.), we obtain p E sup xn (s) ≤ c + c
≤s≤t
t
p E sup xn– (σ ) ds. ≤σ ≤s
For any r ≥ , we have p max E sup xn (s) ≤ c + c
≤n≤r
t
≤s≤t
p Eξ p + max E sup xn (σ ) ds. ≤n≤r
≤σ ≤s
From the Gronwall inequality, we derive that p max E sup xn (t) ≤ c + c TEξ p ec (T) .
≤n≤r
≤t≤T
Step . Let us show that {xn (t)}n≥ is Cauchy. For n ≥ and t ∈ [, T], we derive that, from (), x
n+
t
n
fsn,n– ds +
(t) – x (t) =
t
gsn,n– dws ,
where fsn,n– = f s, xn (s), xn δ(s) – f s, xn– (s), xn– δ(s) , gsn,n– = g s, xn (s), xn δ(s) – g s, xn– (s), xn– δ(s) . By the Hölder inequality and the BDG inequality, we have t p p E sup xn (σ ) – xn– (σ ) ds. E sup xn+ (s) – xn (s) ≤ c ≤s≤t
≤σ ≤s
Setting ϕn (t) = E sup≤s≤t |xn+ (s) – xn (s)|p , we have
t
ϕn (t) ≤ c
≤ ··· ≤ cn
ϕn– (s ) ds ≤ c
t
ds
s
s
ϕn– (s ) ds
ds
sn–
ds · · ·
t
ϕ (sn ) dsn .
()
By () and ϕ (t) ≤ c KEξ p = c˜ , we obtain p (c t)n . E sup xn+ (s) – xn (s) ≤ c˜ n! ≤s≤t
()
Hence () implies that for each t, {xn (t)}n=,,... is a Cauchy sequence on [t , T]. Step . Uniqueness. Let x(t) and y(t) be two solutions of (). Then, for t ∈ [, T], we have p E sup x(s) – y(s) ≤ c ≤s≤t
t
p E sup x(u) – y(u) ds. ≤u≤s
Mao et al. Advances in Difference Equations (2015) 2015:70
Page 18 of 19
Therefore, the Gronwall inequality implies p E sup x(s) – y(s) = , ≤s≤t
t ∈ [t , T].
The above expression means that x(t) = y(t) for all t ∈ [, T]. Existence. We derive from () that {xn (t)}n=,,... is a Cauchy sequence. Hence there exists a unique x(t) such that xn (t) → x(t) as n → ∞. For all t ∈ [, T], taking the limits on both sides of () and letting n → ∞, we then can show that x(t) is the solution of (). So the proof of Theorem . is complete. Proof of Corollary . The key technique to prove this corollary is already presented in the proofs of Theorems . and ., so we here only highlight some parts which need to be modified. We use the same notations as in the proofs of Theorems . and .. It is easy to see that inequality () should become f t, xε (t) – f¯ yε (t) p ≤ + p– p–
p ρ xε (t) – yε (t)
p ¯ . + f t, yε (t) – f yε (t)
()
In fact, since the function ρ(·) is concave and increasing, there must exist a positive number k p such that on x ≥ .
ρ(x) ≤ k p ( + x), Hence,
p f t, xε (t) – f¯ yε (t) p ≤ + p– p– k + xε (t) – yε (t)p
p ¯ + f t, yε (t) – f yε (t) . Letting = k p– , we get f t, xε (t) – f¯ yε (t) p ≤ ( + k)p– k( + xε (t) – yε (t)p p + f t, yε (t) – f¯ yε (t) . Inserting () into (), it follows that u
p p (p – ) eε (t) + p– ( + k)p– k + eε (t) p p p dt. + f t, yε (t) – f¯ yε (t)
I ≤ E
By setting = + k, we have I ≤ ( + k)E
u
p + eε (t) dt + E
u
f t, yε (t) – f¯ yε (t) p dt.
()
Mao et al. Advances in Difference Equations (2015) 2015:70
Page 19 of 19
Similarly, J and J can be estimated as I . Finally, all of required assertions can be obtained in the same way as the proof of Theorems . and .. The proof is therefore complete.
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 Applied Mathematics, Donghua University, Shanghai, 201620, China. 3 Department of Mathematics and Statistics, University of Strathclyde, Glasgow, G1 1XH, UK. Acknowledgements This paper is completed when the first author visits the Department of Mathematics and Statistics in the University of Strathclyde, whose hospitality is highly appreciated. The authors would like to thank the Royal Society of Edinburgh, the National Natural Science Foundation of China under NSFC grant (No. 11401261), Qing Lan Project of Jiangsu Province (2012), the NSF of Higher Education Institutions of Jiangsu Province (13KJB110005), the grant of Jiangsu Second Normal University (JSNU-ZY-02) and the Jiangsu Government Overseas Study Scholarship for their financial support. Received: 5 November 2014 Accepted: 10 February 2015 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. Gikhman, II: On a theorem of N.N. Bogoliubov. Ukr. Mat. Zh. 4, 215-219 (1952) 3. Volosov, VM: Averaging in systems of ordinary differential equations. Russ. Math. Surv. 17, 1-126 (1962) 4. Khasminskii, RZ: On the principle of averaging the Itô stochastic differential equations. Kibernetika 4, 260-279 (1968) 5. Khasminskii, RZ, Yin, G: On averaging principles: an asymptotic expansion approach. SIAM J. Math. Anal. 35, 1534-1560 (2004) 6. Golec, J, Ladde, G: Averaging principle and systems of singularly perturbed stochastic differential equations. J. Math. Phys. 31, 1116-1123 (1990) 7. Veretennikov, AY: On the averaging principle for systems of stochastic differential equations. Math. USSR Sb. 69, 271-284 (1991) 8. Veretennikov, AY: On large deviations in the averaging principle for SDEs with full dependence. Ann. Probab. 27, 284-296 (1999) 9. 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) 10. Tan, L, Lei, D: The averaging method for stochastic differential delay equations under non-Lipschitz conditions. Adv. Differ. Equ. 2013, 38 (2013) 11. Stoyanov, IM, Bainov, DD: The averaging method for a class of stochastic differential equations. Ukr. Math. J. 26, 186-194 (1974) 12. Kolomiets, VG, Melnikov, AI: Averaging of stochastic systems of integral-differential equations with Poisson noise. Ukr. Math. J. 43, 242-246 (1991) 13. Givon, D: Strong convergence rate for two-time-scale jump-diffusion stochastic differential systems. SIAM J. Multiscale Model. Simul. 6, 577-594 (2007) 14. Xu, Y, Duan, JQ, Xu, W: An averaging principle for stochastic dynamical systems with Lévy noise. Physica D 240, 1395-1401 (2011) 15. Mao, X: Stochastic Differential Equations and Their Applications. Ellis Horwood, Chichester (1997) 16. Ikeda, N, Watanable, S: Stochastic Differential Equations and Diffusion Processes. North-Holland, Amsterdam (1989) 17. Applebaum, D: Lévy Process and Stochastic Calculus. Cambridge University Press, Cambridge (2009) 18. Yuan, C, Bao, J: On the exponential stability of switching-diffusion processes with jumps. Q. Appl. Math. 2, 311-329 (2013) 19. Peszat, S, Zabczyk, J: Stochastic Partial Differential Equations with Lévy Noise: An Evolution Equation Approach. Cambridge University Press, Cambridge (2007) 20. Taniguchi, T: Successive approximations to solutions of stochastic differential equations. J. Differ. Equ. 96, 152-169 (1992) 21. Mao, X: Adapted solutions of backward stochastic differential equations with non-Lipschitz coefficients. Stoch. Process. Appl. 58, 281-292 (1995) 22. Vinodkumar, A: Existence, uniqueness and stability results of impulsive stochastic semilinear functional differential equations with infinite delays. J. Nonlinear Sci. Appl. 4, 236-246 (2011) 23. Negrea, R, Preda, C: Fixed point technique for a class of backward stochastic differential equations. J. Nonlinear Sci. Appl. 6, 41-50 (2013)