Abstract
The truncated Euler–Maruyama (EM) method for stochastic differential equations with Poisson jumps (SDEwPJs) has been proposed by Deng et al. in 2019. Although the finite-time -convergence theory has been established, the strong convergence theory remains absent. In this paper, the strong convergence refers to the use of an measure and places the supremum over time inside the expectation operation. Our version can be used to justify the method within Monte Carlo simulations that compute the expected payoff of financial products. Noting that the conditions imposed are too strict, this paper presents an existence and uniqueness theorem for SDEwPJs under general conditions and proves the convergence of the truncated EM method for these equations. Finally, two examples are considered to illustrate the application of the truncated EM method in option price calculation.
Keywords:
truncated EM method; strong convergence; Poisson jumps; local Lipschitz condition; Khasminskii-type condition MSC:
37A50; 65C05; 65C30
1. Introduction
Stochastic differential equations (SDEs) have become a potent tool applied to mathematics, physics, chemistry, biology, medical science, finance, stochastic control, and so on (see, e.g., [1,2,3]). In real life, however, most SDEs have no explicit solution as their coefficients do not satisfy the global Lipschitz condition. Several authors have found some methods to solve this issue when studying the numerical methods of stochastic differential equations, including the EM method, the Milstein method, the tamed EM method, the tamed Milstein method, the stopped EM, the backward EM, and the backward–forward EM. For the background of these methods, we refer the reader to the papers [4,5,6,7,8,9,10,11,12,13] and the book [14]. The convergence of numerical solutions must be considered, especially the strong convergence, most of which, however, require that the coefficients of SDEs satisfy the global Lipschitz condition. Therefore, it is of great significance to study the strong convergence theory of nonlinear SDEs whose coefficients do not satisfy the global Lipschitz condition.
Mao [15] proposed the truncated EM method to establish the strong convergence theory of nonlinear SDE, a new explicit method. A d-dimensional SDE
was studied, but f and g only satisfy the local Lipschitz condition. A Khasminskii-type condition
was added to guarantee a global solution (see [16,17]). Afterward, the truncated EM method for SDEs was reported. One can refer to [18,19,20,21,22,23], to name a few examples.
Although Deng et al. [23] have studied the finite-time convergence for SDEwPJs under some additional conditions using the truncated EM method, their technical requirements remain overly restrictive (see Remark 1). Furthermore, the authors did not establish stronger convergence properties beyond fundamental results. To address these limitations, this work develops innovative mathematical methodologies to derive both convergence and strong convergence criteria under substantially weakened assumptions. Notably, while our convergence analysis focuses specifically on the framework, this level of convergence proves fully adequate for practical implementations in quantitative finance, as demonstrated in existing applications by Higham and Mao [24].
Hu et al. [20] compared the truncated EM method with some modified EM methods for SDEs without jumps. To achieve the same accuracy, the runtime of the truncated EM method is much shorter than that of the implicit EM method. Although the runtime of the truncated EM method and of the tamed EM method are almost equivalent, the step size of the tamed EM method needs to be smaller to achieve the same accuracy. Thus, the truncated EM method has obvious advantages in applications. In this paper we intend to consider two examples to illustrate the application of the truncated EM method in option price calculation. It turns out that the truncated EM method is not only convenient for computations, but also has an acceptable convergence rate. Furthermore, these two examples illustrate that our main results could cover many nonlinear SDEwPJs.
The rest of the paper is organized as follows. Section 2 outlines some assumptions and details of the truncated EM method. Section 3 examines the moment bounds of the truncated EM solutions. Section 4 shows the convergence of the truncated EM solutions. Section 5 represents some strong convergence results. Finally, Section 6 provides some simulated examples to illustrate the theoretical results.
2. The Truncated EM Method
Throughout this paper, denotes the family of non-negative real numbers, denotes the n-dimensional Euclidean space, and denotes the space of matrices with real entries. Let be a complete probability space with a filtration satisfying the usual conditions, that is, it is right, continuous, and increasing while contains all -null sets. Let be an m-dimensional Brownian motion and is a compensated Poisson process, which means in which is a scalar Poisson process with intensity . We assume that and are independent and defined on . If G is a vector or matrix, its transpose is denoted by . If , then is the Euclidean norm. If A is a set, its indicator function is denoted by , namely if and 0 otherwise. We set (∅ denotes the empty set). For two real numbers, a and b, we use and . Moreover, let denote the largest integer which does not exceed k, and let represent the expectation of the random variable Y.
We consider an n-dimensional nonlinear SDE with Poisson jumps
on with the initial value , where denotes , f: , g: , u: . It should be noted that (3) could also be written as
In this paper, we propose two standing hypotheses.
Assumption 1
(Local Lipschitz condition). For any , there is a , such that
for all with .
Assumption 2
(Khasminskii-type condition). There is a , such that
for all .
Remark 1.
A major difference from Assumptions 3.1 and 3.3 in Deng et al. [23] is that our assumptions are more simplified. Evidently, our Assumptions 1 and 2 are derivable from (3.3) and (3.8) in Deng et al. [23], but not vice versa. Therefore, our assumptions are weaker than those in Deng et al. [23].
The following theorem shows that there exists a unique solution to (3).
Theorem 1.
Under Assumptions 1 and 2, Equation (3) has a unique global solution . Moreover, for ,
Proof.
Under Assumptions 1 and 2, the existence and uniqueness of the solution follows immediately from Theorem 1 in [25]. To show (7), we may rewrite (4) as
By the Itô–Doeblin formula for one jump process (see Chapter 11 of [26]), we derive from (8) that, for ,
By Assumption 2, we derive that
Applying the Gronwall inequality yields the required result. □
In what follows, we adopt the similar notation and functions as introduced in [15]. To define the truncated EM scheme, we first choose a strictly increasing continuous function , such that as and
for all . We note that (denoting the inverse function of ) is a strictly increasing continuous function from to , so we can choose a number and a strictly decreasing function , such that
Given stepsize , define the truncated functions
and
for all , where we set when . We could easily observe that
for all .
We can now define the truncated EM numerical solutions for (3). For a given stepsize , define for . The discrete-time truncated EM numerical solutions satisfying the iterative scheme
with initial , where , .
In our analysis, it will be more convenient to use continuous-time truncated EM solutions. We hence introduce the step function , which is defined by
The continuous-time truncated EM approximation is defined by
for .
In addition, for , the continuous-time truncated EM approximation can be written in the following equivalent form:
Noting that , and coincide with the discrete solution at the gridpoints, we have for all .
At the end of this section, we state a lemma. The following lemma shows that the truncated functions , and preserve Assumption 2 for all .
Lemma 1.
Let Assumption 2 hold. Then, for all , we have
for all .
Proof.
Fix any . For , by Assumption 2 and (14), we derive that
and hence, the required assertion (17) follows. If , by Assumption 2, we have
Since is a strictly increasing continuous function and l is a strictly decreasing function, by (10), we have
We also see from Assumption 2 that for any . Therefore, we have
The proof is complete. □
3. Moment Bounds of the Truncated EM Solutions
In this section, we will examine the moment bounds of the discrete approximation solutions. We first present a lemma which gives an upper bound for the second moment of .
Lemma 2.
For any given , we have
Proof.
Lemma 3.
For any and , we have
Consequently,
Proof.
For later use, we will show the following theorem, which gives an upper bound for the second moment of for any .
Theorem 2.
Let Assumptions 1 and 2 hold. For any , we have
Proof.
4. Convergence
In this section, we will prove that
for any . This is sufficient for some applications. For example, we utilize the truncated EM method to approximate the European call or put option value. In the rest of the paper, we always fix arbitrarily.
Lemma 4.
Let Assumptions 1 and 2 hold. For any real number , define the stopping time Then,
Proof.
For any , using the Itô–Doeblin formula, we have
By Assumption 2, we derive that
The Gronwall inequality yields that
Then, by the Chebyshev inequality, we have
This implies
The proof is therefore complete. □
Lemma 5.
Let Assumptions 1 and 2 hold. For any real number and , define the stopping time Then,
Proof.
Theorem 3.
Let Assumptions 1 and 2 hold. Then,
Proof.
Let be arbitrary and . We hence have
By Lemmas 4 and 5, we obtain
where
By Theorems 1 and 2, we can easily find that
Furthermore, for any , we have
Now, choose so large that the first term on the right of this inequality is smaller than . With this value of , the second term goes to zero as by Lebesgue’s dominated convergence theorem. Thus, there are numbers and , such that for all ,
If we can show that for all sufficiently small ,
we then have
In order to prove (26), we define the truncated functions
for all . Without loss of generality, we may assume that is already sufficiently small for . So, for all , we derive that
for all with . Consider the jump-diffusion SDE
on with initial value . By Assumption 1, it is easy to observe that the coefficients of (27) are globally Lipschitz continuous with the Lipschitz constant . Then, in the same way as Theorem 1, we can show that the jump-diffusion SDE (27) has a unique global solution on . For each stepsize , we can apply the EM method to the jump-diffusion SDE (27) and we denote by the continuous-time EM solution. We also denote by the step function. Hence, we have
and
Moreover, for ,
We then have
By (28) and (29), we obtain
For any , we derive that
By the Cauchy–Schwarz inequality, the Doob martingale inequality, and the martingale isometry,
Using (31), we get
Applying the Gronwall inequality yields that
Consequently,
Since
for all , we have
which implies
We therefore have
This implies (26) as desired. Finally, by Lemma 3, we can easily show that
The proof is therefore complete. □
5. Strong Convergence
The convergence of the previous section is not sufficient for approximating quantities that are path-dependent, for example, the European barrier option value. In these situations, we will need two stronger convergence results. In this section, we will show that
for any . For this purpose, we should impose an additional condition.
Assumption 3.
Suppose that there is a , such that
Lemma 6.
Let Assumptions 1, 2, and 3 hold. Then
Proof.
For any , by the Itô–Doeblin formula and Assumption 2, we have
Thus,
By the Burkholder–Davis–Gundy inequality, the Hölder inequality, the Doob martingale inequality, and the martingale isometry, we derive that
By Theorem 1 and Assumption 3, we may obtain
This implies the required assertion (34) easily. □
Lemma 7.
Let Assumptions 1, 2, and 3 hold. Then
where
Proof.
Fix any . Using the Itô–Doeblin formula, Lemma 1, and (12), we can derive that
By Lemma 3, Theorem 2, the Burkholder–Davis–Gundy inequality, the Hölder inequality, the Doob martingale inequality, and the martingale isometry, we have
However, we may easily observe that . Therefore, we have
which means
This is the desired assertion. □
Theorem 4.
Let Assumptions 1, 2, and 3 hold. Then
Proof.
We can easily verify that it is much easier to estimate than in practice. It is therefore more desirable to obtain the following theorem.
Theorem 5.
Let Assumptions 1, 2, and 3 hold. Then
To prove the theorem, we need the following lemma.
Lemma 8.
Let . Then
Consequently
Proof.
Let , . For any , we have
Thus, we derive that
By the Hölder inequality and the Doob martingale inequality, we obtain
By the Doob maximal inequality and the Doob martingale inequality, we have
Substituting (41) and (42) into (40) yields
Consequently, the required assertion (38) follows by applying (10). Letting , (39) is obtained. The proof is complete. □
Using the elementary inequality , we can show . Therefore, Theorem 5 follows from Theorem 4 and Lemma 8 immediately.
6. Examples
In this section, two examples are considered, and their simulation results are given to to illustrate our theoretical results of Theorems 4 and 5. Due to the strong convergence result, which can be used to justify the method within Monte Carlo simulations that compute the expected payoff of financial products (see [24]), we can discuss the Monte Carlo simulation of European put option prices.
Example 1.
Consider the scalar SDEwPJs
on with the initial value , where α, β, δ, and γ are four positive numbers; is a scalar Brownian motion; and is a compensated Poisson process, which means that , in which is a scalar Poisson process with intensity λ. Clearly, its coefficients , , and are locally Lipschitz-continuous for . Also, for any , we have
which is bounded above by a positive constant. This implies that Assumption 2 is satisfied. Moreover, Assumption 3 is satisfied with . Hence, we can conclude that the truncated EM solutions of the SDEwPJs (43) satisfy Theorems 4 and 5.
Let us start the simulation. We set , and . Hence, for , the SDEwPJs (43) can be expressed as
To apply the truncated EM method, we need to find functions ϕ and l. Noting that
we choose and its inverse function for . We let for . Therefore, . To simplify our analysis, we only consider a European put option whose exercise price is . The expected payoff at expiry time T is given by . By Theorem 3, it is not hard to prove that converges to as . The proof is standard and hence, we omit it (see [24,27]). Therefore, we can use Monte Carlo simulation to estimate the value of European put option. Table 1 shows the corresponding simulation results. The simulation results clearly verify the effectiveness of theoretical results. We remark that the expected payoff from the truncated EM method for a path-dependent option is also convergent to the real expected payoff by Theorems 4 and 5. So Monte Carlo simulation is still effective for a path-dependent option (see also [27]).
Table 1.
Simulation results under the SDEwPJs (44) for a European put option.
Example 2.
Consider the mean-reverting square root process with Poisson jumps
on , with the initial value , where and are the same as that in Example 1; κ, θ, σ, and τ are non-negative constants; and is a sufficiently small positive constant. By Theorem 2.1 in [27], we know that for any initial value , there is a unique solution to Equation (45) and the solution will never become negative with probability one. Its coefficients , , and are clearly locally Lipschitz-continuous for . For , we have
Thus, Assumption 2 holds. Furthermore, it is easy to show that
This means that Assumption 3 is satisfied with . Therefore, we can conclude by Theorems 4 and 5 that the assertions (36) and (37) hold.
Now let us start the simulation. We set , , and . Hence, for , the SDEwPJs (45) can be written as
Noting that
we choose and its inverse function for . We let for . Thus, . Similarly, we consider a European put option whose exercise price is . The expected payoff at expiry time T is given by . The corresponding simulation results are listed in Table 2, from which we see that the effectiveness of theoretical results.
Table 2.
Simulation results under the SDEwPJs (46) for a European put option.
Author Contributions
Conceptualization, W.S.; methodology, W.S.; software, W.S. and W.L.; writing—original draft, W.S.; writing—review and editing, W.S.; funding acquisition, W.S. and W.L. All authors have read and agreed to the published version of the manuscript.
Funding
This work was partially supported by the Talent Research Launch Fund Project of Tongling University (2024tlxyrc024), the Key Project of Anhui Provincial Scientific Research Plan: Research on the Construction and Promotion of an Intelligent Decision-Making Platform for the Copper Industry Chain (2023AH051640), the Program for talents introduction of Sichuan University of Science and Engineering (2024RC08), and the Opening Project of Sichuan Province University Key Laboratory of Bridge Nondestruction Detecting and Engineering Computing (2024QZJ02).
Data Availability Statement
Data sharing not applicable to this article as no datasets were generated or analyzed during the current study.
Conflicts of Interest
The authors declare no conflicts of interest.
References
- Ma, S.; Gao, J.; Yang, Z. Strong convergence of the Euler–Maruyama method for nonlinear stochastic convolution Itô–Volterra integral equations with constant delay. Methodol. Comput. Appl. Probab. 2020, 22, 223–235. [Google Scholar] [CrossRef]
- Øksendal, B. Stochastic Differential Equations: An Introduction with Applications; Springer: Berlin/Heidelberg, Germany, 2003. [Google Scholar]
- Situ, R. Theory of Stochastic Differential Equations with Jumps and Applications; Springer: New York, NY, USA, 2005. [Google Scholar]
- Burrage, K.; Burrage, P.M.; Tian, T. Numerical methods for strong solutions of stochastic differential equations: An overview. Proc. Roy. Soc. Lond. Ser. A 2004, 460, 373–402. [Google Scholar] [CrossRef]
- Gardoń, A. The order of approximations for solutions of Itô-type stochastic differential equations with jumps. Stoch. Anal. Appl. 2004, 22, 679–699. [Google Scholar] [CrossRef]
- Higham, D.J.; Kloeden, P.E. Numerical methods for nonlinear stochastic differential equations with jumps. Numer. Math. 2005, 101, 101–119. [Google Scholar] [CrossRef]
- Hutzenthaler, M.; Jentzen, A.; Kloeden, P.E. Strong convergence of an explicit numerical method for SDEs with non-globally Lipschitz continuous coefficients. Ann. Appl. Probab. 2012, 22, 1611–1641. [Google Scholar] [CrossRef]
- Liu, W.; Mao, X. Strong convergence of the stopped Euler–Maruyama method for nonlinear stochastic differential equations. Appl. Math. Comput. 2013, 223, 389–400. [Google Scholar] [CrossRef]
- Mao, X.; Shen, Y.; Gray, A. Almost sure exponential stability of backward Euler–Maruyama discretizations for hybrid stochastic differential equations. J. Comput. Appl. Math. 2011, 235, 1213–1226. [Google Scholar] [CrossRef]
- Mao, X.; Szpruch, L. Strong convergence and stability of implicit numerical methods for stochastic differential equations with non-globally Lipschitz continuous coefficients. J. Comput. Appl. Math. 2013, 238, 14–28. [Google Scholar] [CrossRef]
- Ngo, H.L.; Luong, D.T. Strong rate of tamed Euler–Maruyama approximation for stochastic differential equations with Hölder continuous diffusion coefficient. Braz. J. Probab. Stat. 2017, 31, 24–40. [Google Scholar] [CrossRef]
- Wang, X.; Gan, S. The tamed Milstein method for commutative stochastic differential equations with non-globally Lipschitz continuous coefficients. J. Differ. Equ. Appl. 2013, 19, 466–490. [Google Scholar] [CrossRef]
- Wang, X.; Wu, J.; Dong, B. Mean-square convergence rates of stochastic theta methods for SDEs under a coupled monotonicity condition. BIT Numer. Math. 2020, 60, 759–790. [Google Scholar] [CrossRef]
- Kloeden, P.E.; Platen, E. Numerical Solution of Stochastic Differential Equations; Springer: Berlin/Heidelberg, Germany, 1992. [Google Scholar]
- Mao, X. The truncated Euler–Maruyama method for stochastic differential equations. J. Comput. Appl. Math. 2015, 290, 370–384. [Google Scholar] [CrossRef]
- Khasminskii, R. Stochastic Stability of Differential Equations; Springer Science & Business Media: Berlin/Heidelberg, Germany, 2011. [Google Scholar]
- Song, M.; Hu, L.; Mao, X.; Zhang, L. Khasminskii-type theorems for stochastic functional differential equations. Discrete Contin. Dyn. Syst. Ser. B 2013, 18, 1697–1714. [Google Scholar] [CrossRef]
- Cong, Y.; Zhan, W.; Guo, Q. The partially truncated Euler–Maruyama method for highly nonlinear stochastic delay differential equations with Markovian switching. Int. J. Comput. Methods 2020, 17, 1950014. [Google Scholar] [CrossRef]
- Guo, Q.; Mao, X.; Yue, R. The truncated Euler–Maruyama method for stochastic differential delay equations. Numer. Algorithms 2018, 78, 599–624. [Google Scholar] [CrossRef]
- Hu, L.; Li, X.; Mao, X. Convergence rate and stability of the truncated Euler–Maruyama method for stochastic differential equations. J. Comput. Appl. Math. 2018, 337, 274–289. [Google Scholar] [CrossRef]
- Mao, X. Convergence rates of the truncated Euler–Maruyama method for stochastic differential equations. J. Comput. Appl. Math. 2016, 296, 362–375. [Google Scholar] [CrossRef]
- Zhang, W.; Song, M.; Liu, M. Strong convergence of the partially truncated Euler-Maruyama method for a class of stochastic differential delay equations. J. Comput. Appl. Math. 2018, 335, 114–128. [Google Scholar] [CrossRef]
- Deng, S.; Fei, W.; Liu, W.; Mao, X. The truncated EM method for stochastic differential equations with Poisson jumps. J. Comput. Appl. Math. 2019, 355, 232–257. [Google Scholar] [CrossRef]
- Higham, D.J.; Mao, X. Convergence of Monte Carlo simulations involving the mean-reverting square root process. J. Comput. Financ. 2005, 8, 35–61. [Google Scholar] [CrossRef]
- Gyöngy, I.; Krylov, N.V. On Stochastic Equations with Respect to Semimartingales I. Stochastics 1980, 4, 1–21. [Google Scholar] [CrossRef]
- Shreve, S.E. Stochastic Calculus for Finance II, Continuous-Time Models; Springer: New York, NY, USA, 2004. [Google Scholar]
- Wu, F.; Mao, X.; Chen, K. Strong convergence of Monte Carlo simulations of the mean-reverting square root process with jump. Appl. Math. Comput. 2008, 206, 494–505. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).