Next Article in Journal
Cauchy Problem for an Abstract Evolution Equation of Fractional Order
Next Article in Special Issue
A Compact Scheme Combining the Fast Time Stepping Method for Solving 2D Fractional Subdiffusion Equations
Previous Article in Journal
Self-Similar Growth and Synergistic Link Prediction in Technology-Convergence Networks: The Case of Intelligent Transportation Systems
Previous Article in Special Issue
Conservative Continuous-Stage Stochastic Runge–Kutta Methods for Stochastic Differential Equations
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Class of Fractional Stochastic Differential Equations with a Soft Wall

by
Kęstutis Kubilius
and
Aidas Medžiūnas
*,†
Faculty of Mathematics and Informatics, Vilnius University, Akademijos g. 4, 08412 Vilnius, Lithuania
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Fractal Fract. 2023, 7(2), 110; https://doi.org/10.3390/fractalfract7020110
Submission received: 1 December 2022 / Revised: 16 January 2023 / Accepted: 19 January 2023 / Published: 21 January 2023
(This article belongs to the Special Issue Fractional Differential Equations in Anomalous Diffusion)

Abstract

:
In this paper we are interested in fractional stochactic differential equations (SDEs) with a soft wall. What do we mean by such a type of equation? It has been established that SDE with reflection can be imagined as equations having a hard wall. Now, by introducing repulsion instead of reflection, one obtains an SDE with a soft wall. In contrast to the SDE with reflection, where the process cannot pass the hard wall, the soft wall is repulsive but not impenetrable. As the process crosses the soft wall boundary, it experiences the force of a chosen magnitude in the opposite direction. When the process is far from the wall, the force acts weakly. We find conditions under which SDE with a soft wall has a unique solution and construct an implicit Euler approximation with a rate of convergence for this equation. Using the example of the fractional Vasicek process with soft walls, we illustrate the dependence of the behaviour of the solution on the repulsion force.

1. Introduction

Stochastic processes-based modelling has a long and rich history in a variety of fields. For the last decade, there was an effort to expand classical stochastic differential equations (SDEs) driven by Brownian motion into SDEs driven by fractional Brownian motion (fBm) (see, e.g., [1,2,3], etc.). A majority of these efforts were driven by problems, which arose in financial applications of SDEs (e.g., option pricing, stochastic volatility, interest rate modelling).
However, mathematicians are yet to fully explore potential application possibilities of stochastic processes in material sciences, especially biology/medicine. According to Fulinski [4], certain findings in these fields “seem to open the whole new chapter in the Brownian motions story”. Upon closer inspection, natural sciences offer a unique set of requirements and challenges in the application of SDEs. For example, cellular growth can be accelerated/decelerated/changed or even stopped by proteins, hormones, oxygen, temperature, spacial geometries, etc. For instance, when modelling retinal angiogenesis, Capasso and Wieczorek [5] emphasised seven main features/behaviours, which had to be accounted for in their stochastic model. This plethora of influencing factors is one of the defining traits of SDE application in biology. For mathematical purposes, these effects can be seen as an influence of a medium on a behaviour of a process. Vojta et al. [6] presented us with a list of such behaviours, which they call walls, and classify them depending on process discrete expressions. Many of these types are variations of well-known stochastic objects (e.g., Skorohod problem). Yet, one of the proposed types —soft wall— described by recursion relation
x n + 1 = x n + ξ n + G ( x n ) ,
where x n —process value, ξ n —discrete fractional Gaussian noise, G—repulsive force, is far less investigated and demonstrates a more subtle behaviour. The subtlety is produced by introduction of repulsion instead of reflection. In contrast to the standard SDEs with reflection, where the process cannot pass the hard wall, the soft wall is repulsive but not impenetrable. As the process crosses the soft wall boundary, it experiences the force of a chosen magnitude in the opposite direction. When the process is far from the wall, the force acts weakly. Since this muffled deflection of process trajectories avoids elasticity or inelasticity assumptions, it is a much more accurate mathematical model for many actual natural processes.
Therefore, we consider a one-dimensional SDE
Y t = Y 0 + G ( Y t ) G ( Y 0 ) + 0 t f ( s , Y s ) d s + Z t , t [ 0 , T ] ,
driven by an arbitrary stochastic process Z = ( Z t ) t 0 , Z 0 = 0 , with continuous paths, where functions G : R [ 0 , ) , f : [ 0 , T ] × R R are continuous. As a special case, we can take Z = B H , where B H is a fBm.
We will call such equation SDE with a soft wall, where the function G is interpreted as a repulsive force, which adjusts as the process position with respect to the wall changes. For instance, we can take the exponential repulsive force profile with a wall boundary at the point w, defined as
G ( x ) = G 0 exp { λ ( x w ) } ,
characterised by amplitude G 0 and decay constant λ (see [6]).
It has to be noted that the task of finding conditions under which SDE in the form
Y t = Y 0 + 0 t f ( s , Y s ) d s + 0 t g ( s , Y s ) d B s H , t [ 0 , T ]
or mixed SDE has a unique solution was considered by many authors [1,2,3,7,8,9,10,11,12,13] under a variety of condition sets and methods of proof. However, the introduction of force term G presents new challenges, where the previous approaches are not applicable.
Hence, the aim of this paper is to examine SDE (1) and to apply the obtained results for a more general class of SDEs. First, we explore conditions under which Equation (1) admits a unique solution. Then, we find a pathwise convergence rate for the implicit Euler scheme of the considered SDE solution. In addition, for SDE (1) with Z = B H and known function G, we construct a strongly consistent and asymptotically normal estimator of the Hurst parameter 0 < H < 1 , based on discrete observations of the underlying process. Moreover, we specify the rate of convergence of this estimator to the true value of H, when the diameter of the partition of the observation interval tends to zero.
It should be noted that in contrast to previous research (e.g., [6,14]), the results demonstrated in this work are much more mathematically rigid and synthetic in their nature. Since all approximation schemes presented are iterative, they are easy to use, control and analyse (as demonstrated in Section 6). The pathwise approach does not “hide” the process trajectories behind complicated mathematical structures; hence, it enables easy first-hand use of all statistical analysis tools available. Moreover, approximation convergence rates produced in our research assure the validity of the generated data, which guarantees genuine basis for any other research, without any further error analysis needed.
The paper is organised in the following way. In Section 2, we present the main results of the paper. In Section 3, we discuss condition (E), which at first glance appears to be unusual and restrictive. Section 4 contains proofs of these main theorems. Section 4.1 contains existence and uniqueness proofs of the Equation (1) solution and the convergence rate of its approximation. In Section 4.2, we find the existence and uniqueness conditions for SDEs that have a strictly positive diffusion coefficient. Moreover, we obtain the convergence rate of its approximation. In Section 5, a fractional Pearson diffusion process with a soft wall was considered an example of a stochastic process, satisfying conditions (A)–(E). In Section 6, the fractional Vasicek with the soft wall is considered as a modeling example. Finally, in the Appendix A, we investigate the asymptotic behaviour of the Hurst index estimator and in Appendix B we recall CLT for fBm, a discrete version of Gronwall’s lemma, and the chain rule formula for Hölder-continuous functions.

2. Main Results

C ( [ a , b ] ) : a < b denotes the space of continuous R -valued functions defined on [ a , b ] . For λ ( 0 , 1 ] , C λ ( [ a , b ] ) denotes the space of Hölder continuous functions equipped with a norm
g λ : = | f | + | g | λ , | g | λ = sup s , t [ a , b ] s t | g ( t ) g ( s ) | | s t | λ , | g | = sup t [ a , b ] | g ( t ) | .
We consider SDE of the form
Y t = Y 0 + G ( Y t ) G ( y 0 ) + 0 t f ( s , Y s ) d s + Z t , t [ 0 , T ] ,
driven by an arbitrary stochastic process Z = ( Z t ) t 0 , Z 0 = 0 , with continuous paths.
Using function D ( x ) : = x G ( x ) , Equation (3) can be simplified to
D ( Y t ) = D ( Y 0 ) + 0 t f ( s , Y s ) d s + Z t .
We proceed by introducing a set of conditions:
(A)
Linear growth of f for any t [ 0 , T ] and any x R
| f ( t , x ) | K ( 1 + | x | ) .
(B)
Lipschitz continuity of fin space: for any t [ 0 , T ] and x , y R
| f ( t , x ) f ( t , y ) | K | x y | .
(C)
Hölder continuity in time: there exists β ( 0 , 1 ] such that for any s , t [ 0 , T ] and any x R
| f ( s , x ) f ( t , x ) | K | s t | β .
(D)
Function D is strictly monotonic and surjective.
(E)
Constant d > 0 exists, such that
| D ( x ) D ( y ) | d | x y | .
Now, we formulate the solution existence and uniqueness theorem for the SDE (3).
Theorem 1.
Assume that conditions (A), (B), (D) and (E) are satisfied. Then, the Equation (3) has a unique solution Y C ( [ 0 , T ] ) . If stochastic process Z = ( Z t ) t 0 , Z 0 = 0 , has a Hölder continuous paths of order 0 < γ < 1 , then Y C γ ( [ 0 , T ] ) , γ ( 0 , 1 ) .
Continuing, we introduce the implicit Euler scheme associated with (3). Let π = { t k n = ( k / n ) T , 1 k n } be a sequence of uniform partitions of the interval [ 0 , T ] and h n = t k n t k 1 n , 1 k n . We define the following implicit Euler approximation scheme:
D ( Y n , k + 1 ) = D ( Y n , k ) + f ( t k n , Y n , k ) h n + ( Z t k + 1 n Z t k n ) , Y n , 0 = Y 0 .
For the simplicity of notation, we introduce the symbol O ω . Let ( ξ n ) be a sequence of r.v.s, let ς be an a.s. non-negative r.v. and ( a n ) ( 0 , ) be a vanishing sequence. Then ξ n = O ω ( a n ) means that | ξ n | ς · a n for all n. In particular, ξ n = O ω ( 1 ) signifies that the sequence ( ξ n ) is a.s. bounded.
Theorem 2.
Assume assumptions ( A ) ( E ) are satisfied, and Y is a solution of Equation (3) such that Y C γ ( [ 0 , T ] ) , γ ( 0 , 1 ) . Then,
max 1 k n Y t k n Y n , k = O ω ( h n θ ) ,
where θ = β γ .
Corollary 3.
Under conditions of Theorem 2, it follows that
sup 0 t T | Y t Y t n | = O ω h n θ , γ ( 0 , 1 ) ,
where
Y t n = Y n , k + t t k n h n ( Y n , k + 1 Y n , k ) , t t k n , t k + 1 n , k = 0 , , n 1 .
We now proceed by application of the results obtained for Equation (1) to equations with additional restrictions on the diffusion coefficient. Let us consider SDE
X t = X 0 + Φ ( X t ) Φ ( X 0 ) + 0 t α ( X s ) d s + 0 t σ ( X s ) d Z s , t [ 0 , T ] ,
where Φ , α , σ are continuous functions, Z is a process with Hölder continuous paths of order 1 / 2 < γ < 1 and strictly positive diffusion coefficient, i.e., inf x R σ ( x ) > 0 . The stochastic integral in Equation (8) is a pathwise Riemann–Stieltjes integral, and thus, the whole equation is understood as a pathwise Riemann–Stieltjes integral equation. A pathwise Riemann–Stieltjes integral is well defined if σ ( X ) is Hölder continuous with order λ and such that λ + γ > 1 .
For the following theorem, we need condition:
( H ) Φ : R R is a continuously differentiable function, and there exists a constant 0 c < 1 such that Φ ( x ) c for all x R .
Theorem 4.
Assume that α ( x ) and σ ( x ) are continuously differentiable functions and
inf x R σ ( x ) > 0 . If the function Φ ( x ) satisfies condition (H) and for some constant C > 0 and any x R ,
| α ( x ) | C , | σ ( x ) | C , α ( x ) σ ( x ) C
then SDE (8) has a unique solution X C γ ( [ 0 , T ] ) , 1 / 2 < γ < 1 .
Function
F ( x ) = 0 x 1 σ ( y ) d y ,
is called the Lamperti transform, and F 1 is the inverse Lamperti transform.
Theorem 5.
Assume that conditions of Theorem 4 hold. Then,
max 1 k n X t k n X n , k = O ω ( h n γ ) , γ ( 1 / 2 , 1 ) ,
where X n , k = F 1 ( Y n , k ) .

3. Remarks on the Condition (E)

At first glance, condition (E) can seem unusual and restrictive (especially in conjunction with condition (D)). However, a wide class of functions satisfies it. We will propose only several more interesting examples of such functions.
Remark 6.
Assume that the function D : R R is bi-Lipschitz (i.e., D is Lipschitz, and its inverse function D 1 is also Lipschitz). Then, inequality (5) is satisfied.
For any x ^ , y ^ R there exsist x , y R such that D 1 ( x ^ ) = x and D 1 ( y ^ ) = y . Since D 1 is a Lipschitz function, then for some L,
| x y | = D 1 ( x ^ ) D 1 ( y ^ ) L | x ^ y ^ | = L D ( x ) D ( y ) .
Remark 7.
Assume that the function D : R R is differentiable, invertable and such that | D | c > 0 , then inequality (5) is satisfied.
Since | D | c > 0 , and by using the Inverse Function Theorem, we obtain
( D 1 ) ( x ) = 1 D ( D 1 ( x ) ) 1 c .
Thus, the function D 1 ( x ) is Lipschitz, and inequality (5) is satisfied.
Remark 8.
If G : R R is a continuously differentiable function and there exists a constant 0 c < 1 such that G ( x ) c , for all x R , then D ( x ) is strictly increasing and | D ( x ) D ( y ) | ( 1 c ) | x y | . Indeed, since D ( x ) 1 c for all x R , then D ( x ) is strictly increasing, and from Lagrange’s mean value theorem, it follows that
( 1 c ) | x y | ( D ( x ) D ( y ) .
Remark 9.
If G ( x ) is Lipschitz continuous with Lipschitz constant 0 c < 1 , then | D ( x ) D ( y ) | ( 1 c ) | x y | . Since | G ( x ) G ( y ) | c | x y | , we see at once that
| D ( x ) D ( y ) | | x y | | G ( x ) G ( y ) | ( 1 c ) | x y | .

4. Proofs of Theorems

To start with, we will construct and prove one auxiliary result. Consider the deterministic differential equation on R
x t = x 0 + G ( x t ) G ( x 0 ) + 0 t f ( s , x s ) d s + φ t , t [ 0 , T ] ,
where x 0 R , φ C ( [ 0 , T ] ) , T > 0 , φ ( 0 ) = 0 , functions f : [ 0 , T ] × R R and G : R R are continuous.
Theorem 10.
Assume that conditions (A), (B), (D) and (E) are satisfied. Then, the Equation (11) has a unique solution x C ( [ 0 , T ] ) . If φ C γ ( [ 0 , T ] ) , γ ( 0 , 1 ) , then x C γ ( [ 0 , T ] ) , γ ( 0 , 1 ) .
Proof. 
Recall that the function D ( x ) = x G ( x ) is strictly monotonic and continuous. Then, it has the inverse D 1 ( x ) , which is strictly monotonic and continuous too.
Existence. We will apply the Picard iteration method. Define the Picard iterations sequence as follows. Let
D ( x t m + 1 ) = D ( x 0 ) + 0 t f ( s , x s m ) d s + φ t , x t 0 = x 0 , x 0 m = x 0 , m 0 .
Let y t m + 1 : = D ( x t m + 1 ) . Then
y t m + 1 = D ( x 0 ) + 0 t f ( s , x s m ) d s + φ t
is a continuous function. Since y t 1 = D ( x 0 ) + 0 t f ( s , x 0 ) d s + φ t , it is evident that y 1 is a continuous function. By this and continuity of the inverse D 1 one obtains that x t 1 = D 1 ( y t 1 ) is continuous too. In the general case, if x t m is a continuous function, then y t m + 1 is a continuous function too. Thus, x t m + 1 = D 1 ( y t m + 1 ) is continuous.
We now turn to the proof that the sequence ( x t m ) 0 t T converges uniformly on [ 0 , T ] to a continuous limiting function x ˜ C ( [ 0 , T ] ) .
Note that
D ( x t m + 1 ) D ( x t m ) = 0 t [ f ( s , x s m ) f ( s , x s m 1 ) ] d s .
Thus, from the conditions (B) and ( D ) , we obtain
d | x t m + 1 x t m | ( D ( x t m + 1 ) D ( x t m )
and
x t m + 1 x t m K d 0 t x s m x s m 1 d s .
By this inequality, we have
x t m + 1 x t m K 2 d 2 0 t 0 s 1 x s 2 m 1 x s 2 m 2 d s 2 d s 1 K m d m 0 t 0 s 1 0 s m 1 x s m 1 x s m 0 d s m d s 2 d s 1 .
From inequality
| x t 1 x 0 | 1 d 0 t | f ( s , x 0 ) | d s + | φ t | ,
it follows that
sup 0 t T | x t 1 x 0 | C T , C T : = d 1 T sup 0 t T | f ( t , x 0 ) | + sup 0 t T | φ t | .
Consequently,
x t m + 1 x t m ( K t ) m d m m ! C T .
Thus,
m = 0 sup 0 t T x t m + 1 x t m <
and the sequence x m = ( x t m ) 0 t T converge uniformly on [ 0 , T ] to a continuous limiting function x ˜ C ( [ 0 , T ] ) .
D is a continuous function, and for all t [ 0 , T ] ,
D ( x ˜ t ) D ( x 0 ) 0 t f ( s , x ˜ s ) d s φ t D ( x t m ) D ( x ˜ t ) + 0 t | f ( s , x s m 1 ) f ( s , x ˜ s ) | d s sup 0 t T D ( x t m ) D ( x ˜ t ) + T K sup 0 t T x ˜ t x t m 1 m 0 ;
hence, x ˜ is a solution of Equation (11).
Next, we prove that x ˜ C γ ( [ 0 , T ] ) , γ ( 0 , 1 ) , if φ C γ ( [ 0 , T ] ) , γ ( 0 , 1 ) . By the similar method as above, it follows that
| x ˜ t x ˜ s | 1 d s t | f ( u , x ˜ u ) | d u + d 1 | φ t φ s | .
Finally, from condition (A), we obtain that
| x ˜ t x ˜ s | K d 1 s t ( 1 + | x ˜ u | ) d u + d 1 | φ | γ ( t s ) γ K d 1 1 + | x ˜ | ( t s ) + d 1 | φ | γ ( t s ) γ d 1 K 1 + | x ˜ | ( T 1 ) + | φ | γ ( t s ) γ
and the proof is complete.
Uniqueness. Assume that y is another solution of (11). The uniqueness of the solution x ˜ of (11) follows from the inequality
sup 0 t T | x ˜ t y t | K d 1 0 T sup 0 s t | x ˜ s y s | d s
and Gronwall’s lemma. □

4.1. Proof of Theorems 1 and 2

Proof of Theorem 1.
The existence and uniqueness of a solution of Equation (3) is derived directly from the deterministic version of Theorem 10.
Proof of Theorem 2.
We rewrite the approximation (6) in the following way
D ( Y n , k + 1 ) = D ( Y n , k ) + f ( t k n , Y n , k ) h n + ( Z t k + 1 n Z t k n ) = D ( Y 0 ) + h n j = 0 k f ( t j n , Y n , j ) + Z t k + 1 n
and discretise the process Y by
D ( Y t k + 1 n ) = D ( Y t k n ) + f ( t k n , Y t k n ) h n + ( Z t k + 1 n Z t k n ) + t k n t k + 1 n ( f ( s , Y s ) f ( t k n , Y t k n ) ) d s = D ( Y 0 ) + h n j = 0 k f ( t j n , Y t j n ) + Z t k + 1 n + R n , k + 1 ,
where
R n , k + 1 : = j = 0 k t k n t k + 1 n ( f ( s , Y s ) f ( t j n , Y t j n ) ) d s .
Then,
D ( Y t k + 1 n ) D ( Y n , k + 1 ) = h n j = 1 k [ f ( t j n , Y n , j ) f ( t j n , Y t j n ) ] + R n , k + 1 .
Similarly, as in proof of Theorem 10, we obtain
Y t k + 1 n Y n , k + 1 K h n d j = 1 k Y t j n Y n , j + d 1 R n , k + 1 .
It remains to estimate | R n , k + 1 | . Assume that t [ t k n , t k + 1 n ) . Then (see (12)),
Y t Y t k n d 1 K 1 + | Y | + | Z | γ h n γ .
Thus,
| R n , k + 1 | n max 0 k n 1 t k n t k + 1 n | f ( s , Y s ) f ( t k n , Y t k n ) | d s K n max 0 k n 1 t k n t k + 1 n ( s t k n ) β d s + K n max 0 k n 1 t k n t k + 1 n | Y s Y t k n | d s K T 1 + β h n β + K T d [ K ( 1 + | Y | 2 ) + | Z | γ ] h n γ C ω h n θ ,
where θ = β γ ,
C ω : = K T 1 + β h n β θ + K T d [ K ( 1 + | Y | 2 ) + | Z | γ ] h n γ θ .
Combining inequalities (15), (16) and the discrete version of Gronwall’s Lemma A1 (see Appendix B), we obtain
max 0 k n 1 | Y t k + 1 n Y n , k + 1 | C ω e K T ( 1 c ) 1 h n θ .
Proof of Corollary 3.
By definition of Y n , for any t ( t k n , t k + 1 n ] ,
Y t Y t n = Y t t t k n h n Y n , k + 1 t k + 1 n t h n Y n , k = t k n t h n [ t t k + 1 n f ( s , Y s ) d s + Z t k + 1 n Z t ] + t k + 1 n t h n [ t k n t f ( s , X s ) d s + Z t Z t k n ] + t t k n h n ( Y t k + 1 n Y n , k + 1 ) + t k + 1 n t h n ( Y t k n Y n , k ) .
We see at once that the asymptotic behaviour of the first two terms is O ω ( n γ ) , which is clear from inequality (12), and the estimation of the last two terms follows from Theorem 2. This completes the proof. □

4.2. Proof of Theorems 4 and 5

If coefficients α ( x ) and σ ( x ) of Equation (8) are Lipschitz functions and X C γ ( 0 , T ) , 1 / 2 < γ < 1 , then Equation (8) is well defined. We need to find a process X C γ ( 0 , T ) , 1 / 2 < γ < 1 satisfying Equation (8).
Consider SDE
Y t = Y 0 + V ( Y t ) V ( Y 0 ) + 0 t f ( Y s ) d s + Z t ,
where
f ( x ) = α ( F 1 ( x ) ) σ ( F 1 ( x ) ) , V ( x ) = 0 x g ( u ) d u ,
g ( u ) = Φ ( F 1 ( u ) ) , F ( x ) = 0 x 1 σ ( y ) d y .
Recall that the Lamperti transform F ( x ) has the inverse function F 1 : R R , which is strictly increasing and differentiable.
The proof of Theorem 4 consists of two steps. First, we find the conditions under which the Equation (17) has a unique solution in C γ ( 0 , T ) : 1 / 2 < γ < 1 . Secondly, we prove that X t = F 1 ( Y t ) : Y 0 = F ( X 0 ) satisfies Equation (8).
Proof of Corollary 4.
We find requirements for coefficients α ( x ) and σ ( x ) in (17) to satisfy condition (B).
Denote
f ( x ) = f ^ ( F 1 ( x ) ) , f ^ ( x ) = α ( x ) σ ( x ) .
Since the inverse function F 1 : R R is differentiable, then
( F 1 ) ( x ) = σ ( F 1 ( x ) ) , x R
and
f ( x ) = f ^ ( F 1 ( x ) ) = f ^ ( F 1 ( x ) ) F 1 ( x ) = f ^ ( F 1 ( x ) ) σ ( F 1 ( x ) ) = α α σ σ ( F 1 ( x ) ) .
Conditions of the theorem imply that
f ( x ) = α α σ σ ( F 1 ( x ) ) C + C 2 .
Thus, conditions (A) and (B) are satisfied at the same time. Finally, condition (H) is satisfied for the function V ( x ) . Indeed, since V ( x ) = Φ ( F 1 ( x ) ) and Φ ( x ) c , then V ( x ) c . From Remark 8, we obtain that conditions (D)–(E) are satisfied.
Thus, Y C γ ( 0 , T ) : 1 / 2 < γ < 1 and is a unique solution of Equation (17).
Now, we return to the consideration of the process X t = F 1 ( Y t ) . Function σ ( F 1 ( x ) ) is continuously differentiable. Indeed,
( σ ( F 1 ( x ) ) ) = σ F 1 ( x ) σ F 1 ( x )
and the right side of equality is a composition of two continuous functions σ ( x ) σ ( x ) and F 1 ( x ) . Thus, function ( F 1 ) ( x ) = σ ( F 1 ( x ) ) is locally Lipschitz, and the process σ ( F 1 ( Y t ) ) is bounded on [ 0 , T ] , i.e., there exists a random variable M ( ω ) such that
sup 0 t T σ F 1 ( Y t ) M ( ω ) .
Consequently,
| X t X s | = F 1 ( Y t ) F 1 ( Y s ) M | Y t Y s | M G γ , T | t s | γ ,
where G γ , T is a random variable (see Appendix B.2). Therefore, we obtain X C γ ( [ 0 , T ] ) , 1 / 2 < γ < 1 .
Now, we prove that the process X t = F 1 ( Y t ) , Y 0 = F ( X 0 ) satisfies Equation (8). Note that the function F ( x ) is locally Lipschitz. Indeed,
F ( x ) = σ ( x ) σ 2 ( x ) , inf x R σ ( x ) > 0 ,
and σ ( x ) is a continuous function, then F ( x ) is a continuous function, and therefore, F ( x ) is locally Lipschitz. In addition, we will note that functions V ( x ) and Φ ( x ) are Lipschitz.
For X , Y C γ ( [ 0 , T ] ) , 1 / 2 < γ < 1 , the processes ( F 1 ) ( Y t ) , V ( Y t ) , F ( X t ) , and Φ ( X t ) are Riemann–Stieltjes integrable with respect to X and Y (see Theorem A3 in Appendix B). Now, we can apply the chain rule formula for F 1 ( X t ) , V ( Y t ) and Φ ( X t ) (see Theorem A3 in Appendix B). By the chain rule and substitution rule (see Proposition A1 in Appendix B), we obtain
V ( Y t ) V ( Y 0 ) = 0 t V ( Y s ) d Y s = 0 t g ( Y s ) d Y s , Φ ( X t ) Φ ( X 0 ) = 0 t Φ ( X s ) d X s ,
and
X t = X 0 + 0 t ( F 1 ) ( Y s ) d Y s = ( F 1 ) ( Y 0 ) + 0 t σ ( F 1 ( Y s ) ) d Y s = X 0 + 0 t σ ( X s ) d V ( Y s ) + 0 t σ ( X s ) f ( F ( X s ) ) d s + 0 t σ ( X s ) d Z s = X 0 + 0 t σ ( X s ) g ( F ( X s ) ) d F ( X s ) + 0 t α ( X s ) d s + 0 t σ ( X s ) d Z s = X 0 + 0 t σ ( X s ) g ( F ( X s ) ) σ 1 ( X s ) d X s + 0 t α ( X s ) d s + 0 t σ ( X s ) d Z s = X 0 + 0 t g ( F ( X s ) ) d X s + 0 t α ( X s ) d s + 0 t σ ( X s ) d Z s = X 0 + 0 t Φ ( X s ) d X s + 0 t α ( X s ) d s + 0 t σ ( X s ) d Z s = X 0 + Φ ( X t ) Φ ( x 0 ) + 0 t α ( X s ) d s + 0 t σ ( X s ) d Z s .
Thus, X is a solution of the Equation (8), and this solution is unique (it follows from the uniqueness of the solution Y and properties of the Lamperti transform F). □
Proof of Corollary 5.
First, observe that
X t k n F 1 ( Y n , k ) = F 1 ( Y t k n ) F 1 ( Y n , k ) = σ ( F 1 ( Y t k n + θ n , k ( Y t k n Y n , k ) ) ) · Y t k n Y n , k ,
where θ n , k ( 0 , 1 ) . Theorem 2 implies that
max 1 k n | Y t k n + θ n , k ( Y t k n Y n , k ) | sup 0 t T | Y t | + C ω h γ ,
where C ω is a random variable. Since the function σ ( F 1 ( x ) ) is locally Lipschitz, we have
σ F 1 Y t k n + θ n , k ( Y t k n Y n , k )
is bounded for almost all ω . Applying Theorem 2, we conclude that
max 1 k n X t k n F 1 ( Y n , k ) = O ω ( h n γ ) , γ ( 1 / 2 , 1 ) .

5. Example: Fractional Pearson Diffusion Process with Soft Wall

First, as an example of a stochastic process, which satisfies conditions (A)–(E), we will consider the fractional version of the Pearson diffusion process. This process is widely used in physical and chemical sciences, engineering, rheology, environmental sciences and financial mathematics [15].
Let
X t = x 0 + Φ ( X t ) Φ ( x 0 ) + 0 t α ( X t ) d t + 0 t σ ( X t ) d B t H , t 0 ,
with
α ( x ) = b a x , σ ( x ) = σ 0 + σ 1 x + σ 2 x 2 , σ 2 > 0 .
Assume that σ i , i = 0 , 1 , 2 are such that the square root is well defined and inf x R σ ( x ) > 0 , i.e., σ 0 + σ 1 x + σ 2 x 2 > 0 .
Note that
| α ( x ) | | a | , σ ( x ) = σ 1 + 2 σ 2 x 2 σ 0 + σ 1 x + σ 2 x 2 .
Since
σ 0 + σ 1 x + σ 2 x 2 σ 2 x + σ 1 2 σ 2 2 ,
then
σ ( x ) | σ 1 + 2 σ 2 x | 2 σ 2 x + σ 1 2 σ 2 = σ 2 .
It remains to prove the existence of a constant K > 0 : | α ( x ) | | σ ( x ) | K . By function
b a x σ 0 + σ 1 x + σ 2 x 2
being continuous and therefore bounded on a compact set, we obtain
α ( x ) σ ( x ) K
for some constant K > 0 .
Applying the Lamperti transform F to Equation (18), we obtain
Y t = y 0 + V ( Y t ) V ( y 0 ) + 0 t b a Y t σ 0 + σ 1 Y s + σ 2 Y s 2 d s + B t H ,
where y 0 = F ( x 0 ) and
V ( x ) = 0 x g ( u ) d u , g ( u ) = Φ ( F 1 ( u ) ) .
The approximation scheme for the process (18) has a form
X n , k = F 1 ( Y n , k ) ,
where
Y n , k + 1 V ( Y n , k + 1 ) = Y n , k V ( Y n , k ) + b a Y n , k σ 0 + σ 1 Y n , k + σ 2 Y n , k 2 h n + ( B t k + 1 n H B t k n H ) .

6. Modelling: Fractional Vasicek Process

The Vasicek model is one of the earliest classical stochastic models. Usually, it used to describe the fluctuation of interest rates, but it also can be utilised in many other fields such as biology, medical and environmental sciences [16]. Since the fractional Vasicek model admits to conditions (A)–(B) and has a far less bulky expression with fewer parameters than the Pearson diffusion process, we have chosen it as our modeling example.
Let
X t = x 0 + 0 t ( β α X ( s ) ) d s + σ B H ( t ) , t 0 , α , β R , σ 0 .

6.1. Profile of Soft-Wall Resistant Force

We introduce a soft-wall resistant force G into the process (19) and obtain
X t = x 0 + G ( X t ) G ( x 0 ) + 0 t ( β α X ( s ) ) d s + σ B H ( t ) , t 0 , α , β R , σ 0 .
Force G has the following conditions (D)–(E), satisfying profile
G ( x ) = G 1 ( x ) = k 1 e λ ( x a 1 ) , i f x > a 1 G 2 ( x ) = k 2 ( a 1 x ) + G 1 ( a 1 ) , i f x a 1 ,
where λ ( 0 , 1 ) ; a 1 , k 1 , k 2 > 0 .
This specific construction of force G is chosen in order to simulate the rapid change of properties in a process surrounding medium by the simplest controllable means—linear function.
As we can see from Figure 1a, profile (21) produces a rapid increase of resistance after crossing a soft-wall boundary at a 1 . However, conditions for function G and its derivative G do not limit the number of these changes. For example, we can have a two-step change in the force profile. Naturally, these two steps can both increase the force change rate (Figure 1b), or the first step can increase the rate and the second one decrease it (Figure 1c).
Adding another inflection point a 2 to profile (21), we obtain the following two-step profile
G ( x ) = G 1 ( x ) = k 1 e λ ( x a 1 ) , i f x > a 1 G 2 ( x ) = k 2 ( a 1 x ) + G 1 ( a 1 ) , i f a 2 x a 1 k 3 ( a 2 x ) + G 2 ( a 2 ) , i f x < a 2 ,
where λ ( 0 , 1 ) ; a 1 , a 2 , k 1 , k 2 , k 3 > 0 .

6.2. Process Trajectories Simulation under Soft-Wall conditions

Using process approximation scheme (6) for the fractional Vasicek process (20) and soft-wall resistant force profiles (21) and (22) illustrated bellow in Figure 2 we obtain the following trajectories of the fractional Vasicek process.
As we can see from Figure 3 by comparing soft-wall process trajectories with trajectories without soft-wall resistance force, force G “pushes” the process trajectories towards the boundary. The strength of this “push” is dependent on the magnitude of derivative G (large enough derivatives have almost a straightening effect on the trajectories).
Even more fascinating soft-wall behaviour can be observed for a double “increase–decrease” soft-wall force profile.
In Figure 4 we clearly see that the volatility of trajectories is not dependent on the value of G, but on the magnitude of its derivative G . Hence, the double soft-wall force profile (Figure 5) simulates some kind of resistant membrane between boundaries a 1 and a 2 being punctured by the fractional Vasicek process (Figure 4). Notice how, after leaving the area [ a 2 , a 1 ] , the increments of the the soft-wall affected trajectories become almost identical to the increments of the standard process.

7. Conclusions

In this work, we formed a mathematically rigid framework from a stochastic point of view to describe processes with a soft-wall condition in the form of fractional SDE. Subsequently, we proposed and proved the validity of conditions set for FSDE solution existence and uniqueness. This condition set covers a wide class of functions and processes. Furthermore, we presented and investigated a process approximation scheme, which has a good convergence rate and is easy to use for process trajectories simulations. This fact was proven and explored by simulating the Vasicek process with soft-wall conditions of varying levels of complexity. Therefore, our results are a new and original addition in the field of fractional SDE and have broad application perspectives in a variety of fields.

Author Contributions

Conceptualization, K.K.; methodology, K.K.; software, A.M.; validation, K.K. and A.M.; formal analysis, K.K. and A.M.; investigation, K.K. and A.M.; data curation, A.M.; writing—original draft preparation, K.K. and A.M.; writing—review and editing, K.K. and A.M.; visualization, A.M.; supervision, K.K. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

The article authors wish to express their gratitude to Vigirdas Mackevičius for his several helpful comments concerning the formulation of initial conditions.

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A. Estimation of Hurst Parameter

The Hurst parameter is fundamental in the control of the process underlying fractional Brownian motion. Knowing its value might provide us with the essential knowledge about the nature of process trajectories (trend, erraticism, irregularity). Hence, we will consider the asymptotic behaviour of the Hurst index estimate H for SDE (3), when Z = B H .
Assume that in (3), function G ( x ) is known. Denote D ( x ) = x G ( x ) . For a real-valued process Y = ( Y t ) t 0 , we define the second-order increments of D ( Y ) along uniform partitions as
Δ n , k ( 2 ) D ( Y ) = D ( Y t k + 1 n ) 2 D ( Y t k n ) + D ( Y t k 1 n ) , 1 k n 1 .
Theorem A1.
Let Y be a solution of Equation (3), where Z = B H is a fBm with 0 < H < 1 . Define the Hurst index estimator
H ^ n = 1 2 1 2 ln 2 ln k = 1 2 n 1 Δ 2 n , k ( 2 ) D ( Y ) 2 k = 1 n 1 Δ n , k ( 2 ) D ( Y ) 2 .
Then,
H ^ n a . s . H , i f 0 < β 1 H ^ n = H + O ω ln n n 1 / 2 , i f 0 ( H 1 / 4 ) < β 1 , 2 ln 2 n ( H ^ n H ) d N ( 0 , σ H 2 ) , i f 0 < β 1 ,
with a known variance σ H 2 defined below in Appendix B.1.
Proof. 
Fix 0 < γ < H , sufficiently close to H, and such that γ = H ε , where 0 < ε < 1 / 4 . Denote θ = β γ . Due to Y C γ ( [ 0 , T ] ) , it follows that (see [17], p. 78)
| f ( s , Y s ) f ( t , Y t ) | K | s t | β + K | Y s Y t | K ( T β θ + | Y | γ T γ θ ) | s t | θ ,
for s , t [ 0 , T ] , where the constant K is defined in (B) and (C). From (A1), it follows that
Δ n , k ( 2 ) D ( Y ) = t k n t k + 1 n f ( t , Y t ) d t t k 1 n t k n f ( t , Y t ) d t + Δ n , k ( 2 ) B H = O ω ( h n 1 + θ ) + Δ n , k ( 2 ) B H ,
where
Δ n , k ( 2 ) B H = B t k + 1 n H 2 B t k n H + B t k 1 n H .
Therefore,
k = 1 n 1 Δ n , k ( 2 ) D ( Y ) 2 = k = 1 n 1 Δ n , k ( 2 ) B H 2 + O ω h n θ + γ = h n 2 H ( 4 2 2 H ) V n , T ( 2 ) B ^ H + O ω h n θ + γ = T h n 2 H 1 ( 4 2 2 H ) n 1 V n , T ( 2 ) B ^ H + O ω h n θ + γ = T h n 2 H 1 ( 4 2 2 H ) n 1 V n , T ( 2 ) B ^ H + O ω h n 1 2 H + θ + γ ,
where
V n , T ( 2 ) B ^ H : = h n 2 H 4 2 2 H k = 1 n 1 Δ n , k ( 2 ) B H 2 .
Note that
1 2 H + θ + γ = 1 2 H + 2 ( H ε ) > 0 , i f θ = γ , 0 < ε < 1 / 2 , 1 2 H + 2 ( H ε ) > 1 / 2 , i f θ = γ , 0 < ε < 1 / 4 , 1 H ε + β > 0 , i f θ = β , 0 < β 1 , 1 2 H + β + γ > 1 2 H + 2 β > 1 / 2 , i f θ = β , 0 ( H 1 / 4 ) < β 1 .
We next turn to estimate the strong consistency of the estimator H n . Note that
ln k = 1 2 n 1 Δ 2 n , k ( 2 ) D ( Y ) 2 k = 1 n 1 Δ n , k ( 2 ) D ( Y ) 2 = ln T h 2 n 2 H 1 ( 4 2 2 H ) ( 2 n ) 1 V 2 n , T ( 2 ) B ^ H + O ω h 2 n 1 2 H + θ + γ T h n 2 H 1 ( 4 2 2 H ) n 1 V n , T ( 2 ) B ^ H + O ω h n 1 2 H + θ + γ = ( 1 2 H ) ln 2 + ln ( 2 n ) 1 V 2 n , T ( 2 ) B ^ H + O ω h 2 n 1 2 H + θ + γ n 1 V n , T ( 2 ) B ^ H + O ω h n 1 2 H + θ + γ .
If 0 < β 1 , then h n 1 2 H + θ + γ 0 . Moreover, since n 1 V n , T ( 2 ) B ^ H a . s . 1 (see (see Appendix B.1), then
H ^ n = 1 2 1 2 ln 2 ln k = 1 2 n 1 Δ 2 n , k ( 2 ) D ( Y ) 2 k = 1 n 1 Δ n , k ( 2 ) D ( Y ) 2 a . s . H .
To estimate the rate of convergence of H n to H, assume that 0 ( H 1 / 4 ) < β 1 . From (A2) and (A4), one obtains
h n 1 2 H k = 1 n 1 Δ n , k ( 2 ) D ( Y ) 2 = ( 4 2 2 H ) T 1 + O ω n 1 / 2 ln 1 / 2 n + O ω 1 n 1 2 H + θ + γ = ( 4 2 2 H ) T 1 + O ω n 1 / 2 ln 1 / 2 n
and by Maclaurin’s expansion,
ln k = 1 2 n 1 Δ 2 n , k ( 2 ) D ( Y ) 2 k = 1 n 1 Δ n , k ( 2 ) D ( Y ) 2 = ln 2 ( 2 H 1 ) ( 4 2 2 H ) T 1 + O ω ln n n 1 / 2 ( 4 2 2 H ) T 1 + O ω ln n n 1 / 2 = ( 2 H 1 ) ln 2 1 + ln 1 + O ω ln n n 1 / 2 1 + O ω ln n n 1 / 2 = ( 2 H 1 ) ln 2 1 + ln 1 + O ω ln n n 1 / 2 = ( 2 H 1 ) ln 2 1 + O ω ln n n 1 / 2 .
Consequently,
H ^ n = 1 2 1 2 ln 2 ( 2 H 1 ) ln 2 1 + O ω ln n n 1 / 2 = 1 2 + 1 2 ( 2 H 1 ) + O ω ln n n 1 / 2 = H + O ω ln n n 1 / 2 .
Now, we investigate the asymptotic normality of the estimator H ^ n . From (A2), it follows that
H ^ n = 1 2 1 2 ln 2 ln ( 2 n ) 1 V 2 n , T ( 2 ) B ^ H 2 2 H 1 n 1 V n , T ( 2 ) B ^ H 1 + O ω h 2 n 1 2 H + θ + γ 1 + O ω h n 1 2 H + θ + γ = H ˜ n 1 2 ln 2 ln 1 + O ω h n 1 2 H + θ + γ = H ˜ n + O ω h n 1 2 H + θ + γ ,
where
H ˜ n = 1 2 1 2 ln 2 ln ( 2 n ) 1 V 2 n , T ( 2 ) B ^ H 2 2 H 1 n 1 V n , T ( 2 ) B ^ H = H 1 2 ln 2 ln ( 2 n ) 1 V 2 n , T ( 2 ) B ^ H n 1 V n , T ( 2 ) B ^ H .
By the limit results of Appendix B.1, we obtain
2 ln 2 n ( H ˜ n H ) d N ( 0 , σ H 2 ) .
Assume that 0 < β 1 . Now, the application of the Slutsky’s theorem and results obtained above completes the proof. Note that the limit variance σ H 2 of H ^ n equals to that of H ˜ n . □

Appendix B. Supplementary Results

Appendix B.1. Limit Results on fBm

Let
V n , T ( 2 ) B ^ H = n 2 H 1 T 2 H ( 4 2 2 H ) k = 1 n 1 Δ n , k ( 2 ) B H 2 , H 1 2 .
Then V n , T ( 2 ) B ^ H 1 a.s. as n [17] (p. 46) and [17] (p. 58)
n V n , T ( 2 ) B ^ H 1 V 2 n , T ( 2 ) B ^ H 1 d N ( 0 ; Σ H ) , Σ H = Σ 11 Σ 12 Σ 12 Σ 22 ,
where N ( 0 ; Σ H ) is a Gaussian vector with
Σ 11 = 2 1 + 2 ( 4 2 2 H ) 2 j = 1 ρ ^ H 2 ( j ) , Σ 22 = 1 2 Σ 11 , Σ 12 = Σ 21 = 1 2 2 H ( 4 2 2 H ) 2 j Z ρ ˜ H 2 ( j ) , ρ ^ H ( j ) = 1 2 6 | j | 2 H | j 2 | 2 H | j + 2 | 2 H + 4 | j 1 | 2 H + 4 | j + 1 | 2 H , ρ ˜ H ( j ) = 1 2 [ | j + 1 | 2 H + 2 | j + 2 | 2 H | j + 3 | 2 H + | j 1 | 2 H 4 | j | 2 H | j 3 | 2 H + 2 | j 2 | 2 H ] .
Moreover, [17] (p. 52)
V n , T ( 2 ) B ^ H = 1 + O ω n 1 / 2 ln 1 / 2 n
and [17] (p. 66)
n ln V 2 n , T B ^ H V n , T B ^ H d N 0 , σ H 2
with σ H 2 = ( 3 / 2 ) Σ 11 2 Σ 12 .

Appendix B.2. Hölder Continuous Paths

If process Z has Hölder continuous paths of order 0 < γ < 1 , i.e., Z C γ ( [ 0 , T ] ) , then there exists a random variable G γ , T = G γ , T ( ω ) ( 0 , ) such that
Z t Z s G γ , T | t s | γ , s , t [ 0 , T ] .
Hölder-continuity of B H . It is known that almost all sample paths of an fBm B H are locally Hölder of an order strictly less than H, H ( 0 , 1 ) . To be more precise, for all T > 0 there exists a nonnegative random variable G γ , T such that E ( | G γ , T | p ) < for all p 1 , and
| B t H B s H | G γ , T | t s | γ a . s .
for all s , t [ 0 , T ] , where γ ( 0 , H ) (see [17] p. 4).

Appendix B.3. Pathwise Integration

Theorem A2
(Young-Kondurar). Let f C β ( [ a , b ] ) , g C γ ( [ a , b ] ) . If β + γ > 1 , then 0 t f d g exists as a Stieltjes integral for all t [ a , b ] .
Let ϕ be a locally Lipschitz function and let f C λ ( [ a , b ] ) . Then, the composite ϕ f C λ ( [ a , b ] ) .
Theorem A3
(Chain rule (see [17], p. 10)). Let f = ( f 1 , , f d ) : [ a , b ] R d be a function such that for each k = 1 , , d , f k C λ ( [ a , b ] ) , λ ( 1 / 2 , 1 ] . Let g : R d R be a differentiable function with locally Lipschitz partial derivatives g k , k = 1 , , d . Then, each g l f is Riemann–Stieltjes integrable with respect to f k and
( g f ) ( b ) ( g f ) ( a ) = k = 1 d a b ( g k f ) d f k .
Proposition A1
(Substitution rule (see [17], p. 11)). Let f , g and h be functions in C λ ( [ a , b ] ) , λ ( 1 / 2 , 1 ] . Then, for the Riemann–Stieltjes integral, the following equality holds:
a b f ( x ) d a x g ( y ) d h ( y ) = a b f ( x ) g ( x ) d h ( x ) .

Appendix B.4. Gronwall’s lemma

Lemma A1
(Discrete version [18]). Let ( y n ) and ( g n ) be non-negative sequences and c a non-negative constant. If
y n c + j = 0 n 1 g j y j f o r n 0 ,
then
y n c 0 j < n ( 1 + g j ) c exp 0 j < n g j f o r n 0 .

References

  1. Nualart, D.; Ouknine, Y. Regularization of differential equations by fractional noise. Stoch. Process Their Appl. 2002, 102, 103–116. [Google Scholar] [CrossRef] [Green Version]
  2. Nualart, D.; Rǎşcanu, A. Differential equations driven by fractional Brownian motion. Collect. Math. 2002, 53, 55–81. [Google Scholar]
  3. Xu, L.; Luo, J. Stochastic differential equations driven by fractional Brownian motion. Stat. Probab. Lett. 2018, 142, 102–108. [Google Scholar] [CrossRef]
  4. Fuliński, A. Fractional Brownian Motions. Acta Phys. Pol. B 2020, 51, 1097–1129. [Google Scholar] [CrossRef]
  5. Capasso, V.; Wieczorek, R. A hybrid stochastic model of retinal angiogenesis. Math. Methods Appl. Sci. 2020, 43, 10578–10592. [Google Scholar] [CrossRef]
  6. Vojta, T.; Halladay, S.; Skinner, S.; Janušonis, S.; Guggenberger, T.; Metzler, R. Reflected fractional Brownian motion in one and higher dimensions. Phys. Rev. E 2020, 102, 032108. [Google Scholar] [CrossRef] [PubMed]
  7. Duncan, T.; Nualart, D. Existence of strong solutions and uniqueness in law for stochastic differential equations driven by fractional Brownian motion. Stoch. Dyn. 2009, 9, 423–435. [Google Scholar] [CrossRef]
  8. Guerra, J.; Nualart, D. Stochastic differential equations driven by fractional Brownian motion and standard Brownian motion. Stoch. Anal. Appl. 2008, 26, 1053–1075. [Google Scholar] [CrossRef] [Green Version]
  9. Kubilius, K. The existence and uniqueness of the solution of an integral equation driven by a p-semimartingale of special type. Stoch. Process. Appl. 2002, 98, 289–315. [Google Scholar] [CrossRef] [Green Version]
  10. Li, Z.; Zhan, W.; Xu, L. Stochastic differential equations with time-dependent coefficients driven by fractional Brownian motion. Phys. A 2019, 530, 121565. [Google Scholar] [CrossRef]
  11. Mishura, Y.; Shevchenko, G. Mixed stochastic differential equations with long-range dependence: Existence, uniqueness and convergence of solutions. Comput. Math. Appl. 2012, 64, 3217–3227. [Google Scholar] [CrossRef]
  12. Pei, B.; Xu, Y. On the non-Lipschitz stochastic differential equations driven by fractional Brownian motion. Adv. Differ. Equ. 2016, 194. [Google Scholar] [CrossRef] [Green Version]
  13. Da Silva, J.L.; Erraoui, M.; Essaky, E.H. Mixed Stochastic Differential Equations: Existence and Uniqueness Result. J. Theor. Probab. 2018, 31, 1119–1141. [Google Scholar] [CrossRef] [Green Version]
  14. Vojta, T.; Wada, A.H.O. Fractional Brownian motion with a reflecting wall. Phys. Rev. E 2018, 97, 020102. [Google Scholar]
  15. Leonenko, G.M.; Phillips, T.N. High-order approximation of Pearson diffusion processes. J. Comput. Appl. Math. 2012, 236, 2853–2868. [Google Scholar] [CrossRef] [Green Version]
  16. Chen, Y.; Ying, L.; Pei, X. Parameter estimation for Vasicek model driven by a general Gaussian noise. Commun. Stat.-Theory Methods 2021, 1–17. [Google Scholar] [CrossRef]
  17. Kubilius, K.; Mishura, Y.; Ralchenko, K. Parameter Estimation in Fractional Diffusion Models; Bocconi & Springer Series; Springer: Berlin/Heidelberg, Germany, 2017. [Google Scholar]
  18. Holte, J.M. Discrete Gronwall lemma and applications. In Proceedings of the MAA North Central Section Meeting at UND, Grand Forks, ND, USA, 24 October 2009. [Google Scholar]
Figure 1. Force F profiles. (a) Single soft-wall. (b) Double “increase–decrease” soft-wall. (c) Double “increase–increase” soft-wall.
Figure 1. Force F profiles. (a) Single soft-wall. (b) Double “increase–decrease” soft-wall. (c) Double “increase–increase” soft-wall.
Fractalfract 07 00110 g001
Figure 2. Single (21) and double “increase–increase” (22) force G profiles for k 1 = 0.001 , k 2 = 2 , k 3 = 20 , a 1 = 2.3 , a 2 = 1.7 .
Figure 2. Single (21) and double “increase–increase” (22) force G profiles for k 1 = 0.001 , k 2 = 2 , k 3 = 20 , a 1 = 2.3 , a 2 = 1.7 .
Fractalfract 07 00110 g002
Figure 3. Trajectories of the fractional Vasicek process for α = 1 , β = 3 , H = 0.3 , T = 1 , n = 1000 .
Figure 3. Trajectories of the fractional Vasicek process for α = 1 , β = 3 , H = 0.3 , T = 1 , n = 1000 .
Fractalfract 07 00110 g003
Figure 4. Trajectories of the fractional Vasicek process for α = 1 , β = 5 , H = 0.3 , T = 1 , n = 1000 .
Figure 4. Trajectories of the fractional Vasicek process for α = 1 , β = 5 , H = 0.3 , T = 1 , n = 1000 .
Fractalfract 07 00110 g004
Figure 5. Single (21) and double “increase–decrease” (22) force F profiles for k 1 = 0.001 , k 2 = 10 , k 3 = 0.1 , a 1 = 2.3 , a 2 = 1.7 .
Figure 5. Single (21) and double “increase–decrease” (22) force F profiles for k 1 = 0.001 , k 2 = 10 , k 3 = 0.1 , a 1 = 2.3 , a 2 = 1.7 .
Fractalfract 07 00110 g005
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

Kubilius, K.; Medžiūnas, A. A Class of Fractional Stochastic Differential Equations with a Soft Wall. Fractal Fract. 2023, 7, 110. https://doi.org/10.3390/fractalfract7020110

AMA Style

Kubilius K, Medžiūnas A. A Class of Fractional Stochastic Differential Equations with a Soft Wall. Fractal and Fractional. 2023; 7(2):110. https://doi.org/10.3390/fractalfract7020110

Chicago/Turabian Style

Kubilius, Kęstutis, and Aidas Medžiūnas. 2023. "A Class of Fractional Stochastic Differential Equations with a Soft Wall" Fractal and Fractional 7, no. 2: 110. https://doi.org/10.3390/fractalfract7020110

APA Style

Kubilius, K., & Medžiūnas, A. (2023). A Class of Fractional Stochastic Differential Equations with a Soft Wall. Fractal and Fractional, 7(2), 110. https://doi.org/10.3390/fractalfract7020110

Article Metrics

Back to TopTop