The G-Brownian motion was introduced by [1] in a sublinear expectation space ( Ω , H , E ^ ) , which has been applied in finance. Peng also established new sublinear distributions for the G-Brownian motion and the related stochastic calculus of Itô type [1] [2] [3]. However, G-Brownian motion is considered inadequate to apply in finance because both G-Brownian motion and the standard Brownian motion are continuous processes with independent and stationary increments. In this paper, we study the following stochastic differential equation driven by G-Lévy process.

d X t = b ( t , X t ) d t + k ( t , X t ) d N ˜ t ,   t ∈ [ 0, T ] , (1)

where N ˜ t is a G-Lévy process under the G-framework. The operator b is the drift coefficient and k is the jump coefficient.

The research of stochastic differential equations (SDEs) with classical Brownian motion and G-Brownian motion has been widely studied [4]. Meanwhile, numerical simulation of G-Brownian motion can refer to [5]. Zhou [6] propose a new order-2.0 numerical scheme for Solving Forward-Backward SDEs with Jumps. In [7], Hu focused on the numerical method for solving forward-backward stochastic differential equations driven by G-Brownian motion. Moreover, Hu also gave an approximate conditional G-expectation, which gets methods to calculate the distribution of G-Brownian motion. Up to now, almost all the existing works focus on the above Brownian motion.

However, G-Brownian motion is considered inadequate to apply in finance because both above Brownian motion is a continuous processes with independent and stationary increments. There is little research concerning stochastic differential equations driven by G-Lévy process and its numerical scheme. Therefore, Hu develop the theory of G-Lévy process and its specific case G-Poisson process in [8]. And this process is under sublinear expectations with independent and stationary increments but not continuous. In [9], the author concentrated on establishing the integration theory for G-Lévy process with finite activity, introduced the Itô formula for general G-Itô Lèvy process.

The aim of this paper is to appropriate numerical schemes for solving SDEs driven by G-Lévy process under the G-expectation framework. We firstly give the G-Itô formula and propose Euler scheme to approximate the SDEs with G-Lévy process. For comparison purposes, we also gave Milstein Scheme, which also follows from G-Itô formula. Then we give two numerical examples including Ornstein-Uhlenbeck and Black-Scholes cases. In particular, we set the function λ ( t ) changes with t, applying G-expectation property to verify the result that can reach global order-1.0. Moreover, comparative experiments are given through Euler scheme and Milstein Scheme.

The outline of the paper is organized as follows. We introduce some preliminaries such as G-Lévy process, its G-Itô formula and G-expectation in Section 2. In Section 3, we propose Euler scheme and Milstein Scheme for solving the SDEs with G-Poisson process. The numerical example is given in Section 4, which is shown to be consistent with the theoretical results.

In this section, we will introduce some Preliminaries and notations in the theory of G-Lévy process. The G-Itô formula is given in this section. More details can be seen in [1] [8]. Let Ω be a given set and let H be a vector lattice of real functions defined on Ω , which means if X ∈ H , then | X | ∈ H . We will define elements of H as random variables and there is definition as follow.

Definition 1. (Sublinear expectation) Sublinear expectation E ^ is a functional E ^ : H → ℝ . If all X , Y ∈ H , there are some properties as follows:

● Monotonicity: If X ≥ Y then E ^ [ X ] ≥ E ^ [ Y ] ;

● Constant preserving: E ^ [ c ] = c where all c ∈ ℝ ;

● Sub-additivity: E ^ [ X ] − E ^ [ Y ] ≥ E ^ [ X − Y ] ;

● Positive homogeneity: E ^ [ λ X ] = λ E ^ [ X ] for λ ≥ 0 .

Let’s define a sublinear expectation space ( Ω , H , E ^ ) , ( X t ) t ≥ 0 is called a d-dimensional process if X t ∈ H d for each t ≥ 0 . And then we will give the definition of G-Lévy process under sublinear expectation.

Definition 2. [2] (G-Lévy process) Assume X = ( X s ) s ≥ 0 defined on a sublinear expectation space ( Ω , H , E ^ ) is a Lévy process, X s f is a generalized G-Brownian motion and X s g is of finite variation. We define the X as a G-Lévy process if the following properties are satisfied:

● for s ≥ 0 , there exists a Lévy process ( X s f , X s g ) satisfies X s = X s f + X s g .

● X s f and X s g satisfy the following growth conditions:

lim s ↓ 0 E ^ [ | X s f | 3 ] s − 1 = 0 ;   E ^ [ | X s g | ] < C s   forall s ≥ 0,

where C is a positive constant.

Now we will give the G-Itô formula.

Lemma 1. [9] (G-Itô formula) For 1 ≤ i ≤ d , X t i is the k-th component of X t and it satisfies the following form:

X t i = X 0 i + ∫ 0 t     b s i d s + ∑ j = 1 d   ∫ 0 t     σ s i , j d B s j + ∫ 0 t     ∫ E     k ( e , s ) N ˜ ( d e , d s ) ,

where E ∈ ℝ q \ { 0 } , B s is a G-Brownian motion and N ˜ ( d e , d s ) is a G-Lévy process. For h ∈ C b 2 ( ℝ q ) , we deduce

g ( X t ) = g ( X 0 ) + ∑ i = 1 d   ∫ 0 t     b s i ∂ g ( X s ) ∂ x i d s + 1 2 ∑ i , k = 1 d   ∑ j = 1 d   ∫ 0 t     σ s i , j σ s k , j ∂ 2 g ( X s ) ∂ x i ∂ x k d 〈 B 〉 s + ∑ i = 1 d   ∑ j = 1 d   ∫ 0 t     σ s i , j ∂ g ( X s ) ∂ x i d B s j + ∫ 0 t     ∫ E [ g ( X s − + k ( e , s ) ) − g ( X s − ) ] N ˜ ( d e , d s ) .

Lemma 2. [7] (G-expectation) For a function η , we define the approximate G-expectation E ^ t n X n [ η ] by

E ^ t n X n [ η ] : = sup E t n X n [ η ] , (2)

under which ( N ˜ t ) t ≥ 0 is the G-Lévy process. Similarly, we define the associated discrete sublinear expectation

E ^ G [ η t n + 1 ] = E ^ t 0 G , x 0 [ E ^ t 1 G , x 1 [ ⋯ E ^ t n G , x n [ η t n + 1 ] ] ] , (3)

The numerical method for the approximate solution of the SDE with G-Lévy process is the Euler scheme. Due to Lemma 1, we now introduce the Euler scheme for solving equation.

Scheme 1. (Euler Scheme) [7] For a given partition: 0 = t 0 < ⋯ < t N − 1 < t N = T with Δ t = T N . And we set the initial condition X 0 . For 0 ≤ n ≤ N − 1 , we have

X n + 1 = X n + b ( t n , X n ) Δ t + k ( t n , X n ) Δ N ˜ n (4)

where Δ N ˜ n = N ˜ t n + 1 − N ˜ t n is G-Lévy process and Δ t = t n + 1 − t n .

Scheme 2. (Milstein Scheme) [10] For a given partition:

0 = t 0 < ⋯ < t N − 1 < t N = T with Δ t = T N . And we set the initial condition X 0 . For 0 ≤ n ≤ N − 1 , we have

X n + 1 = X n + b ( t n , X n ) Δ t + k ( t n , X n ) Δ N ˜ n   + 1 2 k 2 ( t n , X n ) ( ( Δ N ˜ n ) 2 − λ Δ t − Δ N ˜ n ) . (5)

where Δ N ˜ n = N ˜ t n + 1 − N ˜ t n is G-Lévy process and Δ t = t n + 1 − t n .

Remark 1. Thanks to G-Itô formula expansion, we can obtain above two weak convergence schemes for solving Equations (1). The first numerical method for solving SDEs with G-Lévy process is the Euler scheme, which is the most important and basic method. Thus, we introduce the Euler Scheme for solving SDE with G-Lévy process. Then, we also give Milstein Scheme and both Schemes converge to order 1.0. Moreover, in the next section, numerical results are given to verify that our schemes have order-1.0 convergence rate.

In this section, we consider two one-dimensional SDEs with G-Lévy process including Ornstein-Uhlenbeck and Black-Scholes cases to verify the results. Assume terminal time T = 1 , the number of sample paths N s p = 5000 in the numerical experiment, and the number of time steps is denoted N ∈ { 2 3 ,2 4 ,2 5 ,2 6 ,2 7 } . We measure the errors of global weak convergence as the following methods:

e Δ t g l o b a l : = | 1 N s p ∑ i = 1 N s p ( φ ( X i N ) − φ ( X i , t N ) ) |

Therefore, we get the experimental results consistent with the Scheme.

Example 1. Consider the O-U process:

( X t = X 0 − ∫ 0 t     b X s d s + k ∫ 0 t     ∫ E     e N ˜ ( d e , d s ) , X 0 = 1 , (6)

where N ˜ ( d e , d s ) is one-dimensional G-poisson process with E = [ 0,1 ] and λ E = λ ( t ) . Let b = − 1.5 , k = 0.01 , and e ∈ U ( 0,1 ) , which is Uniform distribution. We apply G-Itô formula and G-expectation proposition, Equation (6) has the explicit solution

X t = X 0 e − b t + k e − b t ∫ 0 t     ∫ E     e b s e N ˜ ( d e , d s ) .

In this example, since λ ( t ) is the function of t. We utilize the G-expectation proposition, taking the maximum φ ( X n ) , φ ( X t n ) value in [ t n , t n + 1 ] . In Order to show the advantages of Scheme 1 in computational efficiency, we also use different coefficients to solve Equation (6). The global errors and convergence rates (CR) of the schemes can be seen in Table 1. We notice that as the time steps increase, the calculated CR approaches 1. It indicates that we need as large time steps N as possible in numerical experiments, which have stable results. We set λ ( t ) = t , and Case 1 with the parameters of X 0 = 7.5 , b = − 0.6 , k = 0.01 , and Case 2 with the parameters of X 0 = 1 , b = − 1.5 , k = 0.01 in Table 1.

Furthermore, we set λ ( t ) = t , t 2 , t 1 / 2 . And the left of Figure 1 shows that even if as λ ( t ) changes, the convergence rate of Scheme 1 can still have order-1.0.

Then, we testify mean-square convergence stability with G-expectation of global errors with the Euler scheme under three kinds of time steps Δ t = 1 / 8 , Δ t = 1 / 16 , and Δ t = 1 / 32 in the right side of Figure 1.

Example 2. Consider the Black-Scholes model with G-pure jump:

( X t = X 0 + ∫ 0 t     b X s d s + ∫ 0 t     ∫ E     k X s N ˜ ( d e , d s ) , X 0 = 1, (7)

where N ˜ ( d e , d s ) is G-poisson process with λ E = λ ( t ) . Let b = − 2 , k = 0.01 , and e ∈ U ( 0,1 ) . We set λ ( t ) = t , t 2 , t 1 / 2 , applying G-Itô formula and G-expectation proposition, Equation (6) has the explicit solution:

X t = X 0 exp { ∫ 0 t ( b − λ ( t ) k ) d s + ∫ 0 t     ∫ E ln ( 1 + k ) N ( d e , d s ) } .

In this Black-Scholes model, we also take the maximum φ ( X n ) , φ ( X t n ) value in [ t n , t n + 1 ] . In Table 2, we obtain the scheme errors with different coefficients and set λ ( t ) = t . Case 1 with the parameters of b = 2 , k = 0.01 , and Case 2 with the parameters of b = − 2 , k = 0.01 in Table 2.

In addition, we show the change of λ ( t ) of the scheme have the convergence rates of global order-1.0 from the left of Figure 2. On the other hand, from the right of Figure 2, we verify the result of the stability of mean-square convergence under G-expectation. The results indicate that Ornstein-Uhlenbeck and Black-Scholes processes show that two examples can achieve order-1.0 convergence under different coefficients. To illustrate the advantages of Scheme in computational efficiency, we also apply Milstein Scheme to solve Equation (7). The convergence rates of Euler Scheme and Milstein Scheme are 1.178 and 1.176 respectively. In particular, for Example 1, its Milstein scheme is Euler scheme. The sample global errors and the corresponding CPU time of the Euler Scheme and Milstein Scheme are displayed in Figure 3. For almost the same order-1.0 of convergence, the Euler scheme takes less CPU time.

In this paper, we propose Euler scheme for solving stochastic differential equations with G-Lévy process. In numerical experiments, we used two examples including Ornstein-Uhlenbeck and Black-Scholes processes to verify that the convergence of scheme is order-1.0. Furthermore, we compared the different coefficients and the change of λ ( t ) , applying G-Itô formula and G-expectation proposition, and got that the scheme has order-1.0.

The authors declare no conflicts of interest regarding the publication of this paper.

Mei, J.W. and Xin, Y.F. (2022) Numerical Scheme for Solving Stochastic Differential Equations with G-Lévy Process. Journal of Applied Mathematics and Physics, 10, 466-474. https://doi.org/10.4236/jamp.2022.102035