Next Article in Journal
Research on Broadband Oscillation Mode Identification Based on Improved Symplectic Geometry Algorithm
Previous Article in Journal
Restoring Spectral Symmetry in Gradients: A Normalization Approach for Efficient Neural Network Training
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

An Explicit Positivity-Preserving Method for Nonlinear Aït-Sahalia Model Driven by Fractional Brownian Motion

Department of Mathematics, Shanghai Normal University, Shanghai 200234, China
Symmetry 2025, 17(10), 1649; https://doi.org/10.3390/sym17101649
Submission received: 16 July 2025 / Revised: 26 August 2025 / Accepted: 2 September 2025 / Published: 4 October 2025

Abstract

This paper develops an explicit positivity-preserving method for the nonlinear Aït-Sahalia interest rate model driven by fractional Brownian motion. To overcome the difficulties in obtaining the convergence rate of this positivity-preserving method, the Lamperti transformation is utilized, which gives an auxiliary equation. And the convergence rate of the numerical method for this auxiliary equation is obtained by virtue of Malliavin calculus. Naturally, the target follows from the inverse of the Lamperti transformation. As a byproduct, the convergence rate of the explicit positivity-preserving method for stochastic differential equations driven by fractional Brownian motion with symmetric coefficients is obtained. Finally, several numerical experiments are performed to verify the theoretical results and demonstrate the advantage of the explicit method.

1. Introduction

Based on the exploration of some continuous-time interest rate models, the well-known Aït-Sahalia interest rate model (ASIRM) was proposed in [1], which was extensively employed in the quantitative analysis of real financial markets [2,3]. Given its application value, many scholars have analyzed the ASIRM. In addition, due to the difficulty in obtaining analytical solutions, the necessity of a numerical method for ASIRM is evident. Assuming the nonlinear ASIRM is driven by standard Brownian motion, the backward Euler–Maruyama (EM) method [4], the truncated EM method [5], and the positivity-preserving method [6,7] have been discussed. And stochastic differential equations (SDEs) with irregular coefficients are studied in [8,9,10]. Moreover, for both theoretical and practical reasons, modeling the dynamics of interest rates and asset prices is crucial for analyzing and understanding their characteristics [11,12,13].
In light of the memory impact of fractional Brownian motion (FBM) on models, which often appears in the real market, it is more meaningful to investigate financial models driven by FBM [14,15]. This investigation enhances our ability to characterize the complex behavior of financial markets. Similarly, fractional-order systems provide a powerful framework for modeling dynamical systems [16]. Thus, in this paper, we focus on the numerical methods for nonlinear scalar ASIRM driven by FBM of the following form:
d X t = a 1 X t 1 a 0 + a 1 X t a 2 X t η d t + σ X t λ d B t H , t [ 0 , T ] ,
with the initial value X 0 > 0 , where η + 1 > 2 λ , η 2 λ + 1 > 2 , and a 1 , a 0 , a 1 , a 2 , σ > 0 . And B t H is an FBM with Hurst parameter H ( 1 / 2 , 1 ) . Since the solution of ASIRM has practical significance, the development of a positivity-preserving method for (1) is of critical importance. The well-posedness of ASIRM (1) was studied in [17], and the implicit numerical method was also applied, without presenting numerical simulations. Moreover, it should also be noted that the Cox–Ingersoll–Ross models driven by FBM have been approximated using the backward EM method [18] and truncated EM method [19], which guarantee the positivity of the numerical solutions. The theories of SDEs driven by FBM have been investigated in [20,21,22,23,24]. For work about fractional analysis, see [25,26].
Motivated by [17,27], in this paper, we utilize the positivity-preserving method to approximate the ASIRM driven by FBM. As an explicit numerical method, it offers distinct advantages over the implicit EM method in [17], like easy implementation and more relaxed constraints on step size. We compare its runtime with that of the backward EM method through numerical simulations in Section 5. In contrast to standard Brownian motion, analyzing SDEs driven by FBM presents two fundamental challenges: the dependence between increments and the absence of the martingale property. To overcome the challenges, we first use the Lamperti transformation to show the corresponding auxiliary Equation (2), and construct the numerical method for this auxiliary equation. Then, a strong convergence rate is obtained by Malliavin calculus. Next, the strong convergence rate of the positivity-preserving method for ASIRM (1) is achieved by virtue of the inverse of the Lamperti transformation, which is dependent on the Hurst parameter H.
The paper is structured as follows. Some notations and necessary lemmas are presented in Section 2. After using the Lamperti transformation, the positivity-preserving method for auxiliary Equation (2) is studied in Section 3. Then, the strong convergence of the positivity-preserving method for ASIRM (1) is established by exploiting the inverse of the Lamperti transformation in Section 4. In Section 5, several numerical simulations are demonstrated to verify the theories.

2. Preliminaries

Let Ω , F , P be a filtered probability space satisfying the usual conditions. Denote B H = { B t H , t [ 0 , T ] } by a one-dimensional FBM with Hurst parameter H ( 1 2 , 1 ) defined on Ω , F , P , i.e., B H is a Gaussian process centered on the covariance function
E B t H B s H = R H ( t , s ) = 1 2 t 2 H + s 2 H | t s | 2 H .
Moreover, one can see that E | B t H B s H | p = C p | t s | p H for all p 1 . For each t [ 0 , T ] , let F t be the σ -algebra generated by the random variables { B s H : s [ 0 , t ] } and the null sets. The stochastic integral of FBM in this paper is defined through the techniques of fractional calculus developed by Zähle in [28], under which (1) is regarded as a pathwise Riemann–Stieltjes integral equation.
For any a , b R , let a b = min { a , b } and a b = max { a , b } . For a set S, let I S ( x ) = 1 if x S and 0 otherwise. Let C be a suitable constant independent of the step size Δ . Let E be the set of step functions on [ 0 , T ] . Denote by H the Hilbert space defined as the closure of E with respect to the scalar product
c H 0 T 0 T I [ 0 , t ] ( u ) I [ 0 , s ] ( v ) | u v | 2 H 2 d u d v ,
where c H = H ( 2 H 1 ) . Let
| H | = ψ H | ψ | H | 2 = c H 0 T 0 T | ψ ( s ) | | ψ ( t ) | | t s | 2 H 2 d s d t <
and | H | | H | be the set of all measurable function such that
ψ | H | | H | 2 : = c H 2 [ 0 , T ] 4 | ψ ( u , s ) | | ψ ( v , t ) | | u v | 2 H 2 | t s | 2 H 2 d u d v d t d s < .
For p > 1 , we denote by D | H | 1 , p all the random variables u such that u | H | a.s., its Malliavin derivative D u | H | | H | a.s., and
E u | H | p + E D u | H | | H | p < .
We now show the following lemma connecting the stochastic integral about FBM with the Skorohod integral · δ B H ; see [29,30].
Lemma 1. 
Let { u t } t [ 0 , T ] be a stochastic process in D | H | 1 , 2 with H > 1 2 such that a.s.
0 T 0 T | D s u t | | t s | 2 H 2 d t d s < .
Then,
0 T u t d B t H = 0 T u t δ B t H + c H 0 T 0 T D s u t | t s | 2 H 2 d t d s .
For p > 1 / H ,
E sup t [ 0 , T ] | 0 t u s δ B s H | p C E 0 T | u s | p d s + E 0 T 0 T | D r u s | 1 / H d r p H d s .
We now describe some conclusions from [17] as the following lemma.
Lemma 2. 
Under the given conditions on parameters, ASIRM (1) possesses a unique solution Y t C [ 0 , T ] , ( 0 , ) . For any p > 0 , we have
E sup 0 t T X t p < , E sup 0 t T X t p < .
Then, the Lamperti transformation Y t = X t 1 λ for (2) leads to an auxiliary equation:
d Y t = ( λ 1 ) a 2 Y t η λ λ 1 a 1 Y t + a 0 Y t λ λ 1 a 1 Y t λ + 1 λ 1 d t + σ ( 1 λ ) d B t H ,
with the initial value Y 0 = X 0 1 λ . Obviously, the conclusions in Lemma 2 also hold for (2). For simplicity, define
μ ( y ) = ( λ 1 ) a 2 y η λ λ 1 a 1 y + a 0 y λ λ 1 a 1 y λ + 1 λ 1 .
Thus, we know that
μ ( y ) = a 2 ( η + λ ) y η 1 λ 1 a 1 ( λ 1 ) + a 0 λ y 1 λ 1 a 1 ( λ + 1 ) y 2 λ 1 ,
μ ( y ) = a 2 ( η + λ ) ( η 1 λ 1 ) y η + λ 2 λ 1 + a 0 λ λ 1 y 2 λ λ 1 a 1 2 ( λ + 1 ) λ 1 y 3 λ λ 1 .
Recall a crucial equality: for a , b R + and ϱ 1 ,
a ϱ b ϱ = ϱ ( a b ) 0 1 ( 1 r ) b + r a ϱ 1 d r .
By (6), we arrive at
n η λ λ 1 m η λ λ 1 ( m n ) η λ λ 1 C | m n | 1 + m η λ λ 1 1 + n η λ λ 1 1 ( m n ) η λ λ 1 C 1 + 1 2 m 2 ( η λ ) λ 1 + 1 2 n 2 ( η λ ) λ 1 | m n | ,
Thus, there exists a constant L 1 > 0 such that
| μ ( m ) μ ( n ) | L 1 1 + 1 m 2 ( η λ ) λ 1 + 1 n 2 ( η λ ) λ 1 + m 2 λ 1 + n 2 λ 1 | m n | .
From (4), we can observe that lim y 0 + μ ( y ) = lim y μ ( y ) = . Due to continuity, sup y ( 0 , ) μ ( y ) is finite. Then, the drift coefficient μ is one-sided Lipschitz continuous, and we assume that this Lipschitz constant is L 2 > 0 . That is, there exists a constant L 2 > 0 such that
( m n ) ( μ ( m ) μ ( n ) ) L 2 | m n | 2 , m , n R + .

3. Numerical Method for Auxiliary Equation (2)

In this section, we give the definition of the explicit positivity-preserving method and discuss its covergence rate. For positive integer M, the step size is denoted by Δ = T M . Set t k = k Δ , k S M : = { 0 , 1 , 2 , , M } . Let Δ ( 0 , 1 ] and α ( 0 , λ 1 4 ( η λ ) ] , β ( 0 , λ 1 4 ] . The truncation mapping φ Δ : R R + is defined as
φ Δ ( y ) = ( K 1 Δ α ) y ( K 2 Δ β ) ,
where K 1 and K 2 are two positive constants independent of Δ with K 1 Y 0 and K 2 Y 0 . Moreover, we can derive that | φ Δ ( y ) | | y | and | φ Δ ( y 1 ) φ Δ ( y 2 ) | C | y 1 y 2 | for some positive constant C. Now, define the explicit positivity-preserving method as
Z k + 1 = Z k + μ Δ ( Z k ) Δ + σ ( 1 λ ) Δ B k + 1 H , k S M ,
where μ Δ ( · ) : = μ φ Δ ( · ) and Δ B k + 1 H = B t k + 1 H B t k H .
Remark 1. 
We get from Lemma 2.1 in [27] that μ Δ is Lipschitz continuous with the Lipschitz constant L ( Δ ) = 2 L 1 1 + Δ 2 α ( η λ ) λ 1 + Δ 2 β λ 1 , and μ Δ is one-sided Lipschitz continuous with the Lipschitz constant L 2 . Moreover, we see L 2 ( Δ ) Δ C .
Lemma 3. 
Under the conditions of Lemma 2 with p > 4 ( η λ ) λ 1 2 λ + 2 λ 1 , for any t [ 0 , T ] , we derive that
E | μ ( Y t ) μ Δ ( Y t ) | 2 C Δ [ α ( p λ p 4 η + 6 λ 2 ) ] [ β ( p λ p 2 λ 2 ) ] λ 1 .
Proof. 
We get from (7) and the definition of μ Δ that
| μ ( Y t ) μ Δ ( Y t ) | 2 C 1 + | Y t | 4 ( η λ ) λ 1 + | φ Δ ( Y t ) | 4 ( η λ ) λ 1 + | Y t | 4 λ 1 | + | φ Δ ( Y t ) | 4 λ 1 | Y t φ Δ ( Y t ) | 2 C ( 1 + | Y t | 4 ( η λ ) λ 1 ) | Y t K 1 Δ α | 2 I { Y t < K 1 Δ α } + C 1 + | Y t | 4 λ 1 | Y t K 2 Δ β | 2 I { Y t > K 2 Δ β } C Δ 2 α 1 + | Y t | 4 ( η λ ) λ 1 I { Y t < K 1 Δ α } + C 1 + | Y t | 4 λ 1 | Y t | 2 I { Y t > K 2 Δ β } .
Applying Hölder’s inequality, Markov’s inequality, and Lemma 2 with p > 4 ( η λ ) λ 1 2 λ + 2 λ 1 gives that
E [ 1 + | Y t | 4 ( η λ ) λ 1 I { Y t < K 1 Δ α } ] C ( P [ Y t < K 1 Δ α ] + E | Y t | 4 ( η λ ) λ 1 I { Y t < K 1 Δ α } ) C P [ Y t 1 > K 1 1 Δ α ] + C E | Y t | p 4 ( η λ ) p ( λ 1 ) E I { Y t < K 1 Δ α } 1 4 ( η λ ) p ( λ 1 ) C K 1 p Δ p α E | Y t | p + C E | Y t | p 4 ( η λ ) p ( λ 1 ) P [ Y t 1 > K 1 1 Δ α ] 1 4 ( η λ ) p ( λ 1 ) C Δ p α + C Δ α ( p λ p 4 η + 4 λ ) λ 1 C Δ α ( p λ p 4 η + 4 λ ) λ 1 .
and
E 1 + | Y t | 4 λ 1 | Y t | 2 I { Y t > K 2 Δ β } E | Y t | 2 I { Y t > K 2 Δ β } + E | Y t | 2 λ + 2 λ 1 I { Y t > K 2 Δ β } E | Y t | p 2 p E I { Y t > K 2 Δ β } 1 2 p + E | Y t | p 2 λ + 2 p ( λ 1 ) E I { Y t > K 2 Δ β } 1 2 λ + 2 p ( λ 1 ) C Δ p β ( 1 2 p ) + C Δ p β ( 1 2 λ + 2 p ( λ 1 ) ) C Δ β ( p λ p 2 λ 2 ) λ 1 .
Thus,
E | μ ( Y t ) μ Δ ( Y t ) | 2 C Δ 2 α Δ α ( p λ p 4 η + 4 λ ) λ 1 + C Δ β ( p λ p 2 λ 2 ) λ 1 C Δ [ α ( p λ p 4 η + 6 λ 2 ) ] [ β ( p λ p 2 λ 2 ) ] λ 1 .
Lemma 4. 
Under the conditions of Lemma 2 with p 2 [ ( 2 η λ 1 ) ( λ + 3 ) ] λ 1 , for any n S M 1 , we get that
E | t n t n + 1 μ ( Y s ) μ ( Y t n ) d s | 2 C Δ 2 H + 2 .
Proof. 
Using Fubini’s theorem, the chain rule, and integration by parts for the Riemann–Stieltjes integral gives that
t n t n + 1 μ ( Y s ) μ ( Y t n ) d s = t n t n + 1 t n s μ ( Y r ) μ ( Y r ) d r + σ ( 1 λ ) d B r H d s = t n t n + 1 ( t n + 1 r ) μ ( Y r ) μ ( Y r ) d r + σ ( 1 λ ) d B r H t n t n + 1 ( t n + 1 r ) μ ( Y r ) μ ( Y r ) d r + t n t n + 1 0 T c H σ ( 1 λ ) ( t n + 1 r ) D τ [ μ ( Y r ) ] ϕ ( τ , r ) d τ d r + t n t n + 1 σ ( 1 λ ) ( t n + 1 r ) μ ( Y r ) δ B r H = : Q 1 + Q 2 + Q 3 ,
where Lemma 1 is used, and D τ [ μ ( Y r ) ] is the Malliavin derivative. Using (4) and Lemma 2 with p 2 [ ( 2 η λ 1 ) ( λ + 3 ) ] λ 1 leads to
E | Q 1 | 2 C Δ 2 E t n t n + 1 | μ ( Y r ) μ ( Y r ) | d r 2 C Δ 2 t n t n + 1 E | μ ( Y r ) μ ( Y r ) | 2 1 2 d r 2 C Δ 2 t n t n + 1 E | Y r 2 η λ 1 λ 1 + Y r λ + 3 λ 1 | 2 1 2 d r 2 C Δ 2 t n t n + 1 E | Y r | 2 ( 2 η λ 1 ) λ 1 + E | Y r | 2 ( λ + 3 ) λ 1 1 2 d r 2 C Δ 4 .
We now estimate Q 2 . The chain rule of the Malliavin derivative in Section 1.2 of [29] means that
D τ [ μ ( Y r ) ] = μ ( Y r ) D τ Y r C | μ ( Y r ) | exp τ r μ ( Y u ) d u I [ 0 , r ] ( τ ) .
Notice that 0 T ϕ ( τ , r ) d τ 2 H T 2 H 1 for r [ 0 , T ] . Then, by (5) and (10), we get that
E | Q 2 | 2 C E t n t n + 1 0 T | ( t n + 1 r ) μ ( Y r ) exp ( τ r μ ( Y u ) d u ) I [ 0 , r ] ( τ ) ϕ ( τ , r ) | d τ d r 2 C Δ 2 E t n t n + 1 | μ ( Y r ) | 0 T | ϕ ( τ , r ) | d τ d r 2 C Δ 2 E t n t n + 1 | μ ( Y r ) | 2 H T 2 H 1 I [ 0 , r ] ( r ) d r 2 C Δ 2 t n t n + 1 E | μ ( Y r ) | 2 1 2 d r 2 C Δ 2 t n t n + 1 E | Y r 2 ( η + λ 2 ) λ 1 | + E | Y r 2 ( 2 λ ) λ 1 | + E | Y r 2 ( 3 λ ) λ 1 | 1 2 d r 2 C Δ 4 ,
where the last inequality holds using Lemma 2 with p 2 [ ( 2 η λ 1 ) ( λ + 3 ) ] λ 1 2 [ ( η + λ 2 ) ( 3 λ ) ] λ 1 . As for Q 3 , applying Proposition 1.5.8 in [29] yields that
E | Q 3 | 2 C t n t n + 1 t n t n + 1 ( t n + 1 s ) ( t n + 1 l ) E | μ ( Y s ) | E | μ ( Y l ) | ϕ ( s , r ) d s d l + C E t n t n + 1 t n t n + 1 0 T 0 T | ( t n + 1 s ) ( t n + 1 l ) D u [ μ ( Y s ) ] D r [ μ ( Y l ) ] | ϕ ( u , r ) ϕ ( s , l ) d u d r d s d l C Δ 2 t n t n + 1 t n t n + 1 ϕ ( s , r ) d s d l + C Δ 2 E t n t n + 1 t n t n + 1 0 T 0 T | μ ( Y s ) | I [ 0 , s ] ( u ) | μ ( Y l ) | I [ 0 , l ] ( r ) ϕ ( u , r ) ϕ ( s , l ) d u d r d s d l C Δ 2 H + 2 + C Δ 2 t n t n + 1 t n t n + 1 0 T 0 T E | μ ( Y s ) | 2 1 2 E | μ ( Y l ) | 2 1 2 ϕ ( u , r ) ϕ ( s , l ) d u d r d s d l C Δ 2 H + 2 .
Then, combining these inequalities leads to
E | t n t n + 1 μ ( Y s ) μ ( Y t n ) d s | 2 C E | Q 1 | 2 + E | Q 2 | 2 + E | Q 3 | 2 C Δ 2 H + 2 .
Thus, (9) holds. □
Lemma 5. 
Let the conditions in Lemma 3 and Lemma 4 hold. Then, one can see that
max k S M sup Δ ( 0 , 1 ) E | Y t k Z k | 2 C Δ 2 H + C Δ [ α ( p λ p 4 η + 6 λ 2 ) ] [ β ( p λ p 2 λ 2 ) ] λ 1 .
Proof. 
Set Γ k = Y t k Z k . Using Young’s inequality and Remark 1 leads to
| Γ k + 1 | 2 | Γ k | 2 + 2 | t k t k + 1 μ ( Y s ) μ Δ ( Y t k ) d s | 2 + 2 | μ Δ ( Y t k ) μ Δ ( Z k ) | 2 Δ 2 + 2 Γ k t k t k + 1 μ ( Y s ) μ Δ ( Y t k ) d s + 2 Γ k μ Δ ( Y t k ) μ Δ ( Z k ) Δ ( 1 + Δ ) | Γ k | 2 + ( 2 + 1 Δ ) | t k t k + 1 μ ( Y s ) μ Δ ( Y t k ) d s | 2 + 2 | μ Δ ( Y t k ) μ Δ ( Z k ) | 2 Δ 2 + 2 Γ k μ Δ ( Y t k ) μ Δ ( Z k ) Δ 1 + Δ + 2 L 2 ( Δ ) Δ 2 + 2 L 2 Δ | Γ k | 2 + ( 2 + 1 Δ ) | t k t k + 1 μ ( Y s ) μ Δ ( Y t k ) d s | 2 1 + C Δ | Γ k | 2 + ( 2 + 1 Δ ) | t k t k + 1 μ ( Y s ) μ Δ ( Y t k ) d s | 2 .
By integration, we see that
| Γ k + 1 | 2 C Δ n = 0 k | Γ n | 2 + ( 2 + 1 Δ ) n = 0 k | t n t n + 1 μ ( Y s ) μ Δ ( Y t n ) d s | 2 .
Then, the discrete-type Gronwall inequality leads to
E | Γ k | 2 C ( 2 + 1 Δ ) n = 0 k E | t n t n + 1 μ ( Y s ) μ Δ ( Y t n ) d s | 2 C Δ 2 H + C Δ [ α ( p λ p 4 η + 6 λ 2 ) ] [ β ( p λ p 2 λ 2 ) ] λ 1 .
From Lemma 3.1 in [27], we get the following lemma.
Lemma 6. 
Under the conditions of Lemma 2, we have, for any t [ 0 , T ] ,
E | Y t φ Δ ( Y t ) | 2 C Δ ( p + 2 ) α + C Δ ( p 2 ) β .
Theorem 1. 
Let the conditions in Lemma 5 hold. Then,
max k S M sup Δ ( 0 , 1 ) E | Y t k φ Δ ( Z k ) | 2 C Δ 2 H + C Δ [ α ( p λ p 4 η + 6 λ 2 ) ] [ β ( p λ p 2 λ 2 ) ] λ 1 .
Proof. 
For any k S M and Δ ( 0 , 1 ) , we get from Lemmas 5 and 6 that
E | Y t k φ Δ ( Z k ) | 2 C E | Y t k φ Δ ( Y t k ) | 2 + E | φ Δ ( Y t k ) φ Δ ( Z k ) | 2 C Δ ( p + 2 ) α + Δ ( p 2 ) β + C E | Y t k Z k | 2 C Δ ( p + 2 ) α + Δ ( p 2 ) β + Δ 2 H + Δ [ α ( p λ p 4 η + 6 λ 2 ) ] [ β ( p λ p 2 λ 2 ) ] λ 1 C Δ 2 H + C Δ [ α ( p λ p 4 η + 6 λ 2 ) ] [ β ( p λ p 2 λ 2 ) ] λ 1 .
When stronger conditions are imposed to the parameters, we can obtain the H-order convergence in mean square sense.
Corollary 1. 
Let the conditions in Theorem 1 hold with α = λ 1 4 ( η λ ) , β = λ 1 4 , and p 8 H ( η λ ) + 4 η 6 λ + 2 λ 1 8 H + 2 λ + 2 λ 1 . Then,
max k S M sup Δ ( 0 , 1 ) E | Y t k φ Δ ( Z k ) | 2 C Δ 2 H .
Furthermore, we can observe that in the proof process, we mainly utilize conditions (7) and (8). Therefore, we can obtain the following result. Consider the d-dimensional SDEs with symmetric coefficients:
d X t = F ( X t ) d t + G d B t H , t [ 0 , T ] ,
with initial value X 0 > 0 , where B t H is a d-dimensional FBM. The symmetric coefficients here refer to the drift coefficient containing a symmetric matrix and the diffusion coefficient being a real symmetric matrix. For example, let F ( X t ) = 4 1 1 4 ( X t 1 , X t 2 ) and G = 1 0 0 1 . When the coefficient of (11) satisfies F ( x ) F ( y ) L 1 1 + x q + y q x y and ( x y ) ( F ( x ) F ( y ) ) L 2 x y 2 for some positive constants L 1 , L 2 , the well-posedness of solution for (11) is given in [31]. Then, one can similarly prove that the strong convergence rate of the corresponding explicit method for (11) is H. And the numerical experiments for such SDEs driven by FBM with symmetric coefficients are presented in Section 5.

4. Numerical Method for ASIRM (1)

In Section 3, the convergence rates of the numerical method for auxiliary Equation (2) are given. Then, the inverse of the Lamperti transformation is exploited to obtain the convergence rates of the numerical method for the ASIRM driven by FBM (1) in this section.
Lemma 7. 
Let the conditions in Corollary 1 hold. Then, for any q [ 1 , 3 + 8 H ( η λ ) / ( λ 1 ) ] , one has
max k S M sup Δ ( 0 , 1 ) E ( φ Δ ( Z k ) ) q C .
Proof. 
Let sets A k = { Y t k K 1 Δ α } and B k = { | Y t k φ Δ ( Z k ) | > K 1 2 Δ 2 α } . Obviously,
E ( φ Δ ( Z k ) ) q = E ( φ Δ ( Z k ) ) q I { A k c } + E ( φ Δ ( Z k ) ) q I { A k B k c } + E ( φ Δ ( Z k ) ) q I { A k B n } .
For the complementary set A k c = { Y t k < K 1 Δ α } , the estimate E ( φ Δ ( Z k ) ) q I { A k c } C is apparent. Then,
E ( φ Δ ( Z k ) ) q I { A k B k c } C E Y t k q I { A k B k c } + ( φ Δ ( Z k ) ) 1 Y t k 1 q I { A k B k c } C E C + | Y t k φ Δ ( Z k ) φ Δ ( Z k ) Y t k | q I { A k B k c } C C + K 1 2 q Δ 2 q α K 1 q Δ q α K 1 q Δ q α C .
By Hölder’s inequality, Markov’s inequality, Corollary 1, and (6), we see that
E ( φ Δ ( Z k ) ) q I { A k B k } C E ( φ Δ ( Z k ) ) q 1 + Y t k q 1 | φ Δ ( Z k ) Y t k | I { A k B k } + Y t k q I { A k B k } C E K 1 q 1 Δ α ( q 1 ) + K 1 q 1 Δ α ( q 1 ) | φ Δ ( Z k ) Y t k | I { B k } + Y t k q I { A k B k } C + C K 1 q 1 Δ α ( q 1 ) E | φ Δ ( Z k ) Y t k | I { B k } C + C K 1 q 1 Δ α ( q 1 ) E | φ Δ ( Z k ) Y t k | 2 1 2 P [ | φ Δ ( Z k ) Y t k | > K 1 2 Δ 2 α ] 1 2 C + C K 1 q 1 Δ α ( q 1 ) K 1 2 Δ 2 α E | φ Δ ( Z k ) Y t k | 2 1 2 E | φ Δ ( Z k ) Y t k | 2 1 2 C + C Δ α ( q + 3 ) E | φ Δ ( Z k ) Y t k | 2 C + C Δ α ( q + 3 ) + 2 H C .
Thus, the desired result holds. □
Theorem 2. 
Let the conditions in Lemma 7 hold with 2 λ p ( λ 1 ) . Then,
max k S M sup Δ ( 0 , 1 ) E | X t k ( φ Δ ( Z k ) ) 1 λ 1 | C Δ H λ 4 ( η λ ) .
Proof. 
Let ϖ = 1 λ 1 . By (6) and Hölder’s inequality,
E | Y t k ϖ ( φ Δ ( Z k ) ) ϖ | C E ( Y t k ϖ 1 + ( φ Δ ( Z k ) ) ϖ 1 ) | Y t k φ Δ ( Z k ) | C E ( Y t k ϖ 1 + ( φ Δ ( Z k ) ) ϖ 1 ) 2 1 2 E | Y t k φ Δ ( Z k ) | 2 1 2 .
Note that φ Δ ( Z k ) K 1 Δ α and 2 λ p ( λ 1 ) . We derive from Corollary 1 that
E | Y t k ϖ ( φ Δ ( Z k ) ) ϖ | C E Y t k 2 ( ϖ + 1 ) + E ( φ Δ ( Z k ) ) 2 ( ϖ + 1 ) 1 2 Δ H C 1 + Δ α ( ϖ + 1 ) Δ H C Δ H λ 4 ( η λ ) .
When the stronger condition 4 η > 9 λ + 3 holds, the following corollary can be obtained.
Corollary 2. 
Let the conditions in Theorem 2 hold with 4 η > 9 λ + 3 . Then, we have
max k S M sup Δ ( 0 , Δ * ) E | X t k ( φ Δ ( Z k ) ) 1 λ 1 | C Δ H .
Proof. 
If 4 η > 9 λ + 3 holds, we get from Lemma 7 that
E | Y t k ϖ ( φ Δ ( Z k ) ) ϖ | C E Y t k 2 ( ϖ + 1 ) + E ( φ Δ ( Z k ) ) 2 ( ϖ + 1 ) 1 2 Δ H C Δ H .

5. Numerical Experiments

In order to verify the validity of the explicit positivity-preserving method, we present several numerical simulations in this section.

5.1. Example 1

Consider the following ASIRM:
d X t = 1.5 X t 1 2 + X t 2 X t 4 d t + X t 2 d B t H , t [ 0 , T ] ,
with the initial value X 0 = 1 , where all parameters in (15) meet the required conditions. And the corresponding auxiliary equation after using the Lamperti transformation reads as
d Y t = 2 Y t 2 Y t + 2 Y t 2 1.5 Y t 3 d t d B t H ,
where Y t = X t 1 and the initial value Y 0 = 1 . Next, let α = 1 / 16 , β = 1 / 8 , and K 1 = K 2 = 1 , so the truncation mapping φ Δ : R R + is
φ Δ ( y ) = Δ 1 16 y Δ 1 8 .
Then, the explicit positivity-preserving method to (16) is
Z k + 1 = Z k + 2 φ Δ ( Z k ) 2 φ Δ ( Z k ) + 2 φ Δ ( Z k ) 2 1.5 φ Δ ( Z k ) 3 Δ Δ B k + 1 H ,
where Δ B k + 1 H = B t k + 1 H B t k H . Figure 1 displays the behaviors of E [ Z k ] for Hurst parameters H = 0.1, 0.2, ⋯, 0.9, with T = 10 , Δ = 2 10 , and the number of paths M = 1000 , while Figure 2 characterizes the corresponding inverse moment E [ Z k 1 ] . The expectation is estimated by computing the average of 1000 sample paths.

5.1.1. Strong Convergence

In order to depict the strong convergence rate of the numerical method, we use the numerical solution with Δ = 2 15 to represent the exact solution of (16). And the mean square approximation error between the exact solution Y · and the numerical solution Z · τ l with the level of time discretization τ l ( l { 1 , 2 , 3 , 4 } ) is defined by
e r r o r Δ = E Y T Z N τ l 2 1 2 1 1000 i = 1 1000 Y T i Z N i , τ l 2 1 2 ,
where the discretization level τ l corresponds to the time step Δ for l = 1 , , 4 , Δ { 2 10 , 2 11 , 2 12 , 2 13 } , and i represents the i- t h sample path. In Figure 3, we show the mean square approximation error with different Hurst parameters, drawn using MATLAB R2024b, where the strong convergence orders of (16) are presented.

5.1.2. Running Times

The following four tables provide the average times of 30 experiments conducted to obtain the convergence rates of explicit and backward EM methods. Table 1 and Table 2 illustrate the running times of (17) and the backward EM method under different numbers of paths ( M = 50 , 100 , 500 , 1000 ) for Hurst parameter H = 0.6 at T = 1 and T = 2 , respectively. Table 3 and Table 4 present analogous comparisons for H = 0.9 at T = 1 and T = 2 , respectively.

5.1.3. Sensitivity Analysis

This subsection conducts a numerical sensitivity analysis of the Hurst parameter H for (16), motivated by the established significance in applications [32,33]. When H = 0.5 , (16) can be written as
d Y ˜ t = 2 Y ˜ t 2 Y ˜ t + 2 Y ˜ t 2 1.5 Y ˜ t 3 d t d B t ,
with the initial value Y 0 = 1 , and B t is the standard Brownian motion. Then, we define the error
e r r o r H = E Y T H Y ˜ T 2 1 2 1 500 i = 1 500 Y T i , H Y ˜ N i 2 1 2 ,
with T = 1 . Here, the subscript H in Y H and e r r o r H distinguishes the solution to (16) and its associated error for different Hurst parameters. The numerical solutions with Δ = 2 15 are regarded as the exact solutions for (16) and (19). We plot the regression line in Figure 4, which reveals a linear relationship between error (20) and H 1 / 2 .

5.2. Example 2

Next, consider the following two-dimensional SDE. Let X t = ( X t 1 , X t 2 ) be a two-dimensional stochastic process that satisfies
d X t = A X t d t + G d B t H , t [ 0 , T ] ,
with initial value X 0 = ( 2 , 2 ) . Here, B t H = ( B t 1 , H , B t 2 , H ) , with B t 1 , H and B t 2 , H as two independent one-dimensional FBMs. A = 4 1 1 4 and G = 1 0 0 1 are symmetric matrices. The numerical solution approximated by the Euler method with Δ = 2 15 is regarded as the exact solution. Figure 5 demonstrates the strong convergence results, computed by (18), between the exact solution and its numerical approximations with Δ { 2 10 , 2 11 , 2 12 , 2 13 } .
The theoretical analysis and numerical experiments show that under specific parameter constraints, the explicit positivity-preserving method is effective. However, if these constraints are violated, the explicit positivity-preserving method may fail.

Funding

This research was funded by the Fundamental Research Funds for the Central Universities, South-Central MinZu University (CZQ25020) and China Scholarship Council (202408310301).

Data Availability Statement

No new data were created or analyzed in this study.

Conflicts of Interest

The author declares no conflicts of interest.

References

  1. Aït-Sahalia, Y. Testing continuous-time models of the spot interest rate. Rev. Financ. Stud. 1996, 9, 385–426. [Google Scholar] [CrossRef]
  2. Hong, Y.; Lin, H.; Wang, S. Modeling the dynamics of Chinese spot interest rates. J. Bank. Financ. 2010, 34, 1047–1061. [Google Scholar] [CrossRef]
  3. Aït-Sahalia, Y. Transition densities for interest rate and other nonlinear diffusions. J. Financ. 1999, 54, 1361–1395. [Google Scholar] [CrossRef]
  4. Szpruch, L.; Mao, X.; Higham, D.J.; Pan, J. Numerical simulation of a strongly nonlinear Aït-Sahalia-type interest rate model. BIT Numer. Math. 2011, 51, 405–425. [Google Scholar] [CrossRef]
  5. Emmanuel, C.; Mao, X. Truncated EM numerical method for generalised Ait-Sahalia-type interest rate model with delay. J. Comput. Appl. Math. 2021, 383, 113137. [Google Scholar] [CrossRef]
  6. Liu, R.; Cao, Y.; Wang, X. Unconditionally positivity-preserving explicit Euler-type schemes for a generalized Aït-Sahalia model. Numer. Algorithms 2025, 98, 651–675. [Google Scholar] [CrossRef]
  7. Deng, S.; Fei, C.; Fei, W.; Mao, X. Positivity-preserving truncated Euler–Maruyama method for generalised Ait-Sahalia-type interest model. BIT Numer. Math. 2023, 63, 59. [Google Scholar] [CrossRef]
  8. Wang, B.; Zhu, Q. The stabilization problem for a class of discrete-time semi-Markov jump singular systems. Automatica 2025, 171, 111960. [Google Scholar] [CrossRef]
  9. Bao, J.; Huang, X. Approximations of McKean–Vlasov Stochastic Differential Equations with Irregular Coefficients. J. Theor. Probab. 2022, 35, 1187–1215. [Google Scholar] [CrossRef]
  10. Xie, L.; Zhang, X. Ergodicity of stochastic differential equations with jumps and singular coefficients. Annales de l’Institut Henri Poincaré, Probabilités et Statistiques. Ann. Inst. H. Poincaré Probab. Statist. 2020, 56, 175–229. [Google Scholar] [CrossRef]
  11. Merton, R.C. Theory of rational option pricing. Bell J. Econ. 1973, 4, 141–183. [Google Scholar] [CrossRef]
  12. Cox, J.C.; Ingersoll, J.E.; Ross, S.A. A theory of the term structure of interest rates. Econometrica 1985, 53, 385–407. [Google Scholar] [CrossRef]
  13. Chen, J.; Li, X.; Shao, Y. Numerical analysis of fractional order Black–Scholes option pricing model with band equation method. J. Comput. Appl. Math. 2024, 451, 115998. [Google Scholar] [CrossRef]
  14. Biagini, F.; Hu, Y.; Øksendal, B.; Zhang, T. Stochastic Calculus for Fractional Brownian Motion and Applications; Springer: London, UK, 2008. [Google Scholar]
  15. Mishura, Y. Stochastic Calculus for Fractional Brownian Motion and Related Processes; Springer: Berlin/Heidelberg, Germany, 2008. [Google Scholar]
  16. Rahman, M.; Karaca, Y.; Agarwal, R.P.; David, S.A. Mathematical modelling with computational fractional order for the unfolding dynamics of the communicable diseases. Appl. Math. Sci. Eng. 2024, 32, 2300330. [Google Scholar] [CrossRef]
  17. Zhang, S.; Yuan, C. Stochastic differential equations driven by fractional Brownian motion with locally Lipschitz drift and their implicit Euler approximation. Proc. R. Soc. Edinburgh Sect. A 2021, 151, 1278–1304. [Google Scholar] [CrossRef]
  18. Hong, J.; Huang, C.; Kamrani, M.; Wang, X. Optimal strong convergence rate of a backward Euler type scheme for the Cox-Ingersoll-Ross model driven by fractional Brownian motion. Stochastic Process. Appl. 2020, 130, 2675–2692. [Google Scholar] [CrossRef]
  19. Gao, X.; Wang, J.; Wang, Y.; Yang, H. The truncated Euler-Maruyama method for CIR model driven by fractional Brownian motion. Stat. Probab. Lett. 2022, 189, 109573. [Google Scholar] [CrossRef]
  20. Gao, S.; Guo, Q.; Liu, Z.; Yuan, C. Euler–Maruyama scheme for delay-type stochastic McKean–Vlasov equations driven by fractional Brownian motion. Commun. Nonlinear Sci. Numer. Simul. 2025, 149, 108927. [Google Scholar] [CrossRef]
  21. Ma, W.; Liu, W.; Zhu, Q.; Shi, K. Dynamics of the Exponential Population Growth System with Mixed Fractional Brownian Motion. Complexity 2021, 2021, 5079147. [Google Scholar] [CrossRef]
  22. Zhou, H.; Hu, Y.; Zhao, J. Numerical method for singular drift stochastic differential equation driven by fractional Brownian motion. J. Comput. Appl. Math. 2024, 447, 115902. [Google Scholar] [CrossRef]
  23. Naserifar, S.; Mirzaee, F. Innovative computational model for variable order fractional Brownian motion and solving stochastic differential equations. Numer. Algorithms 2025, 1–30. [Google Scholar] [CrossRef]
  24. Arthi, G.; Park, J.H.; Jung, H.Y. Existence and exponential stability for neutral stochastic integrodifferential equations with impulses driven by a fractional Brownian motion. Commun. Nonlinear Sci. Numer. Simul. 2016, 32, 145–157. [Google Scholar] [CrossRef]
  25. Li, P.; Han, L.; Xu, C.; Peng, X.; Rahman, M.; Shi, S. Dynamical properties of a meminductor chaotic system with fractal–fractional power law operator. Chaos Solitons Fractals 2023, 175, 114040. [Google Scholar] [CrossRef]
  26. Qu, H.; Rahman, M.; Arfan, M. Fractional model of smoking with relapse and harmonic mean type incidence rate under Caputo operator. Appl. Math. Comput. 2023, 69, 403–420. [Google Scholar]
  27. Chassagneux, J.-F.; Jacquier, A.; Mihaylov, I. An explicit Euler scheme with strong rate of convergence for financial SDEs with non-Lipschitz coefficients. SIAM J. Financ. Math. 2016, 7, 993–1021. [Google Scholar] [CrossRef]
  28. Zähle, M. Integration with respect to fractal functions and stochastic calculus I. Probab. Theory Relat. Fields 1998, 111, 333–374. [Google Scholar] [CrossRef]
  29. Nualart, D. The Malliavin Calculus and Related Topics, 2nd ed.; Springer: Berlin/Heidelberg, Germany, 2006. [Google Scholar]
  30. Alòs, A.; Nualart, D. Stochastic integration with respect to the fractional Brownian motion. Stoch. Stoch. Rep. 2003, 75, 129–152. [Google Scholar] [CrossRef]
  31. Zhou, H.; Hu, Y.; Liu, Y. Backward Euler method for stochastic differential equations with non-Lipschitz coefficients driven by fractional Brownian motion. BIT Numer. Math. 2023, 63, 40. [Google Scholar] [CrossRef]
  32. Haress, E.M.; Richard, A. Long-time Hurst regularity of fractional stochastic differential equations and their ergodic means. J. Theoret. Probab. 2025, 38, 24. [Google Scholar] [CrossRef]
  33. Richard, A.; Talay, D. Lipschitz continuity in the Hurst parameter of functionals of stochastic differential equations driven by a fractional Brownian motion. Electron. J. Probab. 2024, 29, 1–70. [Google Scholar] [CrossRef]
Figure 1. E [ Z k ] for different Hurst parameters: H = 0.1 , 0.2 , 0.3 , 0.4 , 0.5 , 0.6 , 0.7 , 0.8 , 0.9 .
Figure 1. E [ Z k ] for different Hurst parameters: H = 0.1 , 0.2 , 0.3 , 0.4 , 0.5 , 0.6 , 0.7 , 0.8 , 0.9 .
Symmetry 17 01649 g001
Figure 2. E [ Z k 1 ] for different Hurst parameters: H = 0.1 , 0.2 , 0.3 , 0.4 , 0.5 , 0.6 , 0.7 , 0.8 , 0.9 .
Figure 2. E [ Z k 1 ] for different Hurst parameters: H = 0.1 , 0.2 , 0.3 , 0.4 , 0.5 , 0.6 , 0.7 , 0.8 , 0.9 .
Symmetry 17 01649 g002aSymmetry 17 01649 g002b
Figure 3. Convergence rates for Hurst parameters: H = 0.1 , 0.2 , 0.3 , 0.4 , 0.6 , 0.7 , 0.8 , 0.9 .
Figure 3. Convergence rates for Hurst parameters: H = 0.1 , 0.2 , 0.3 , 0.4 , 0.6 , 0.7 , 0.8 , 0.9 .
Symmetry 17 01649 g003
Figure 4. Regression of (20) against H 1 / 2 .
Figure 4. Regression of (20) against H 1 / 2 .
Symmetry 17 01649 g004
Figure 5. Convergence rates for Hurst parameters: H = 0.1 , 0.2 , 0.3 , 0.4 , 0.6 , 0.7 , 0.8 , 0.9 .
Figure 5. Convergence rates for Hurst parameters: H = 0.1 , 0.2 , 0.3 , 0.4 , 0.6 , 0.7 , 0.8 , 0.9 .
Symmetry 17 01649 g005
Table 1. Running times in seconds with H = 0.6 and T = 1 .
Table 1. Running times in seconds with H = 0.6 and T = 1 .
M = 50M = 100M = 500M = 1000
Explicit1.27132.59499.805618.4476
Backward2.41084.761821.001243.7890
Table 2. Running times in seconds with H = 0.6 and T = 2 .
Table 2. Running times in seconds with H = 0.6 and T = 2 .
M = 50M = 100M = 500M = 1000
Explicit1.85933.635118.113935.6824
Backward4.31688.404241.000580.0627
Table 3. Running times in seconds with H = 0.9 and T = 1 .
Table 3. Running times in seconds with H = 0.9 and T = 1 .
M = 50M = 100M = 500M = 1000
Explicit1.29082.143910.111418.3588
Backward2.42384.465020.917141.4412
Table 4. Running times in seconds with H = 0.9 and T = 2 .
Table 4. Running times in seconds with H = 0.9 and T = 2 .
M = 50M = 100M = 500M = 1000
Explicit1.90053.669517.873634.7272
Backward4.38948.511340.335881.1058
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.

Share and Cite

MDPI and ACS Style

Liu, Z. An Explicit Positivity-Preserving Method for Nonlinear Aït-Sahalia Model Driven by Fractional Brownian Motion. Symmetry 2025, 17, 1649. https://doi.org/10.3390/sym17101649

AMA Style

Liu Z. An Explicit Positivity-Preserving Method for Nonlinear Aït-Sahalia Model Driven by Fractional Brownian Motion. Symmetry. 2025; 17(10):1649. https://doi.org/10.3390/sym17101649

Chicago/Turabian Style

Liu, Zhuoqi. 2025. "An Explicit Positivity-Preserving Method for Nonlinear Aït-Sahalia Model Driven by Fractional Brownian Motion" Symmetry 17, no. 10: 1649. https://doi.org/10.3390/sym17101649

APA Style

Liu, Z. (2025). An Explicit Positivity-Preserving Method for Nonlinear Aït-Sahalia Model Driven by Fractional Brownian Motion. Symmetry, 17(10), 1649. https://doi.org/10.3390/sym17101649

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop