Backward Stochastic Differential Equations Driven by Fractional Brownian Motion: Theory and Applications

Abstract

This article develops the theory of backward stochastic differential equations (BSDEs) governed by a fractional Brownian motion with Hurst parameter H( 1/2 ,1 ) . We establish existence, uniqueness, and regularity results for solutions in appropriate Sobolev spaces. In particular, we examine the behavior of solutions depending on the value of the parameter H . We also provide an application to stochastic optimal control through a precise formulation of the maximum principle. Numerical simulations illustrate the dependence of solutions on model parameters.

Share and Cite:

Diop, B. (2025) Backward Stochastic Differential Equations Driven by Fractional Brownian Motion: Theory and Applications. Journal of Applied Mathematics and Physics, 13, 3794-3807. doi: 10.4236/jamp.2025.1311212.

1. Introduction

Backward stochastic differential equations (BSDEs) were introduced by Pardoux and Peng [1] to solve stochastic control problems and financial asset pricing. Fractional Brownian motion, whose increments are correlated, allows modeling phenomena with long memory, such as certain financial time series or physical processes [2] [3].

We have three main contributions:

1) Establishment of sufficient conditions for existence and uniqueness for fractional BSDEs.

2) Analysis of solution regularity via Malliavin calculus.

3) Application to optimal control of dynamical systems perturbed by fractional noise.

The option to work with backward stochastic differential equations (BSDEs) was favored because they allow for the natural integration of terminal conditions and the formulation of the maximum principle in a fractional framework, which is not achievable with strictly forward SDEs.

2. Mathematical Framework and Notations

We consider the complete probability space generated by the Brownian motion B , namely: ( Ω,, { t } t0 , ) where B H is a fractional Brownian motion with parameter H( 1/2 ,1 ) adapted to the filtration { t } . When H>1/2 , the covariance takes the form:

E[ B t H B s H ]= 1 2 ( t 2H + s 2H | ts | 2H )

We define the stochastic integral in the Skorokhod sense. For an adapted process u , the isometry is written as:

E[ ( 0 T u s d B s H ) 2 ]=H( 2H1 ) 0 T 0 T E [ u s u t ] | st | 2H2 dsdt

The studied BSDE is:

Y t =ξ+ t T f( s, Y s , Z s )ds t T Z s d B s H (1)

with:

  • ξ:Ω is T -measurable (terminal condition).

  • f:Ω×[ 0,T ]×× is progressively measurable.

  • ( Y,Z ) is the adapted solution pair with values in × .

The Hurst coefficient H regulates memory: H>0.5 persistence (long memory), H=0.5 classical Brownian motion, H<0.5 anti-persistence. This is why it is used to model phenomena with extended temporal dependence [4] [5].

3. Existence and Uniqueness of the Solution

Theorem 3.1 (Existence and uniqueness) Under the hypotheses:

(H1) ξ L 2 ( Ω, T , )

(H2) K>0 such that t[ 0,T ],y, y ,z, z :

| f( t,y,z )f( t, y , z ) |K( | y y |+| z z | )

(H3) E[ 0 T | f( s,0,0 ) | 2 ds ]<

Then the BSDE (1) admits a unique solution ( Y,Z ) S 2 ( 0,T )× H H 2 ( 0,T ) where:

S 2 ( 0,T )={ Yadaptedcontinuous:E[ sup t[ 0,T ] | Y t | 2 ]< }

H H 2 ( 0,T )={ Zadapted:E[ 0 T | Z s | 2 ds + 0 T 0 T | Z s Z t | | st | 2H2 dsdt ]< }

Proof. The proof is established by the fixed point method in the appropriate Banach space. Define the operator Φ: S 2 ( 0,T )× H H 2 ( 0,T )( U,V )( Y,Z ) in the following sense:

Y t =E[ ξ+ t T f ( s, U s , V s )ds| t ]

with Z determined by the martingale representation theorem.

Step 1: Observation.

In the fractional context, even though B H is not a martingale, a Clark-Ocone-type representation remains accessible within the framework of the Skorokhod integral (refer to Biagini et al. [4], Nualart [5]). This characteristic is essential, as it ensures the existence of a process Z . By verifying the stochastic decomposition of the solution, it facilitates the efficient use of the fixed-point argument.

Preliminary estimate: Let ( Y,Z )=Φ( U,V ) . We have the classical estimate:

E[ sup t[ 0,T ] | Y t | 2 ] C 1 E[ | ξ | 2 + 0 T | f( s, U s , V s ) | 2 ds ] C 2 ( E[ | ξ | 2 ]+E[ 0 T | f( s,0,0 ) | 2 ds ]+ K 2 0 T E [ | U s | 2 + | V s | 2 ]ds )

Regarding the term Z , we apply the fractional isometry:

E[ 0 T | Z s | 2 ds ]C( H )E[ | ξ | 2 + 0 T | f( s, U s , V s ) | 2 ds ]

Step 2: Contraction.

Consider two pairs ( U 1 , V 1 ) and ( U 2 , V 2 ) in S 2 ( 0,T )× H H 2 ( 0,T ) and denote ( Y 1 , Z 1 )=Φ( U 1 , V 1 ) , ( Y 2 , Z 2 )=Φ( U 2 , V 2 ) . We then have:

| Y t 1 Y t 2 |E[ t T | f( s, U s 1 , V s 1 )f( s, U s 2 , V s 2 ) |ds | t ] KE[ t T ( | U s 1 U s 2 |+| V s 1 V s 2 | )ds | t ]

Taking the expectation of the supremum and using Doob’s inequality:

E[ sup t[ 0,T ] | Y t 1 Y t 2 | 2 ] C 3 K 2 TE[ 0 T ( | U s 1 U s 2 | 2 + | V s 1 V s 2 | 2 )ds ]

For the Z term, we again use the isometry:

E[ 0 T | Z s 1 Z s 2 | 2 ds ] C 4 K 2 TE[ 0 T ( | U s 1 U s 2 | 2 + | V s 1 V s 2 | 2 )ds ]

Thus, for T sufficiently small such that C 5 K 2 T<1 , Φ is indeed a contraction.

Step 3: Extension to the entire interval.

When T is not sufficiently small, we partition the interval [ 0,T ] into n subintervals [ t i , t i+1 ] , t 0 =0 , t n =T with t i+1 t i small enough so that Φ is a contraction on each subinterval. We then solve the BSDE on each interval taking as terminal condition the one from the previous interval.

Step 4: Uniqueness. Uniqueness is an immediate consequence of the contraction principle. If ( Y 1 , Z 1 ) and ( Y 2 , Z 2 ) are solutions, then:

( Y 1 , Z 1 )( Y 2 , Z 2 ) C 5 K 2 T ( Y 1 , Z 1 )( Y 2 , Z 2 )

which implies ( Y 1 , Z 1 )=( Y 2 , Z 2 ) if C 5 K 2 T<1 . For an arbitrary interval T , we partition again. □

4. Regularity of the Solution and Malliavin Calculus

Theorem 4.1 (Hölder regularity). If in addition ξ D 1,2 and f is continuously differentiable with bounded derivatives, then:

1) Y t D 1,2 for all t[ 0,T ] .

2) Z t = D t Y t a.e. where D is the Malliavin derivative.

3) Y admits a γ -Hölder continuous version for any γ<H .

The Malliavin derivative satisfies the BSDE:

D t Y s = D t ξ+ s T [ y f( r ) D t Y r + z f( r ) D t Z r ]dr s T D t Z r d B r H

Proof. Proof structure

We want to show, under the hypotheses:

  • ξ D 1,2 (stochastic Sobolev space).

  • f continuously differentiable with bounded derivatives.

that the solution ( Y,Z ) of the BSDE possesses additional regularity.

Malliavin differentiability of Y

We begin by approximating ξ and f by regular sequences ξ n and f n . For each approximation, the corresponding solution ( Y n , Z n ) is Malliavin differentiable. By the BSDE equation:

Y n ( t )= ξ n + t T f n ( s, Y n ( s ), Z n ( s ) )ds t T Z n ( s )d B s H

Applying the Malliavin derivative operator D which commutes with the Skorokhod integral, we obtain:

D r Y n ( t )= D r ξ n + t T [ y f n D r Y n ( s )+ z f n D r Z n ( s ) ]ds t T D r Z n ( s )d B s H

We observe that D r Y n satisfies a linear BSDE.

Limit passage

Under our regularity hypotheses, we show that:

Y n Yin L 2 ( Ω×[ 0,T ] )

D r Y n D r Yin L 2 ( Ω× [ 0,T ] 2 )

Z n Zin L 2 ( Ω×[ 0,T ] )

D r Z n D r Zin L 2 ( Ω× [ 0,T ] 2 )

The limit then verifies the BSDE:

D r Y( t )= D r ξ+ t T [ y f D r Y( s )+ z f D r Z( s ) ]ds t T D r Z( s )d B s H

Identification Z t = D t Y t

By the Clark-Ocone representation (adapted to the fractional case), we have:

Y( t )=E[ Y( t ) ]+ 0 T E [ D s Y( t )| s ]d B s H

But from the original BSDE, we also have:

Y( t )=E[ ξ+ t T f ( s,Y( s ),Z( s ) )ds ] 0 T Z ( s )d B s H

By uniqueness of the representation, we identify:

Z( s )=E[ D s Y( t )| s ]forst

A continuity argument allows us to conclude that Z t = D t Y t a.e.

Hölder-type regularity

To establish this regularity, we adopt the estimate:

E[ | Y( t )Y( s ) | 2 ]C | ts | 2H

coming from:

  • The form of the BSDE.

  • The regularity of fractional Brownian motion.

  • The estimates concerning f and ξ .

More precisely, we demonstrate that:

E[ | t T Z ( r )d B H ( r ) | 2 ]C | ts | 2H ( by fractional isometry )

E[ | t T f ( r,Y( r ),Z( r ) )dr | 2 ]C | ts | 2 ( fisLipschitz )

Which in combination with γ<H gives us the result.

Summary of results

All these combined arguments demonstrate that:

  • Y t D 1,2 for all t .

  • Z t = D t Y t a.e.

  • Y is γ -Hölder for γ<H .

  • The Malliavin derivative satisfies the aforementioned linear BSDE.

5. Application to Optimal Control

Consider the dynamical system:

{ d X t =b( t, X t , u t )dt+σ( t, X t , u t )d B s H X 0 = x 0 (2)

with cost:

J( u )=E[ 0 T g ( t, X t , u t )dt+h( X T ) ]

Assumptions (H*).

To properly ensure the adjoint BSDE (3), we assume that:

  • The functions b( t,x,u ) , σ( t,x,u ) , and g( t,x,u ) are measurable and Lipschitz with respect to x , uniformly in t and u .

  • (A2) They are bounded, as are their partial derivatives with respect to x and u .

  • (A3) The terminal cost function h( x ) belongs to the class C 1 and has at most polynomial growth.

In this context, the associated BSDE admits a unique solution in the space S 2 ( 0,T )× H 2 ( 0,T ) .

Theorem 5.1 (Stochastic maximum principle). Let u * be an optimal control and X * the associated optimal trajectory. Then there exists an adapted process ( p,q ) solution of the adjoint BSDE:

{ d p t = x H( t, X t * , u t * , p t , q t )dt+ q t d B t H p T = x h( X T * ) (3)

where the Hamiltonian is defined by:

H( t,x,u,p,q )=g( t,x,u )+b( t,x,u )p+σ( t,x,u )q

Moreover, we have the minimization condition:

H( t, X t * , u t * , p t , q t )= min uU H( t, X t * ,u, p t , q t ) a.e.

Proof. The proof of the stochastic maximum principle for fractional Brownian motion follows the classical steps but requires technical adaptations due to the non-martingale nature of the noise [6] [7].

Step 1: Control variation. Let u * be the optimal control and u ϵ = u * +ϵv a variation ( v adapted, ϵ>0 small). We set the trajectory variation:

X t ϵ = X t * +ϵ Y t +o( ϵ )

where Y t satisfies the linearized BSDE:

d Y t =[ b x ( t ) Y t + b u ( t ) v t ]dt+[ σ x ( t ) Y t + σ u ( t ) v t ]d B t H

Y 0 =0

Step 2: Cost variation. The cost variation is written as:

J( u ϵ )J( u * )=ϵδJ+o( ϵ )

with:

δJ=E[ 0 T ( g x ( t ) Y t + g u ( t ) v t )dt + h x ( X T * ) Y T ]

Step 3: Introduction of adjoint variables. We introduce the adjoint process ( p t , q t ) solution of the adjoint BSDE:

d p t =[ b x ( t, X t * , u t * ) p t + σ x ( t, X t * , u t * ) q t + g x ( t, X t * , u t * ) ]dt+ q t d B t H

p T = h x ( X T * )

Step 4: Itôs formula for p t Y t . Using Itô’s formula for fractional Brownian motion:

d( p t Y t )= p t d Y t + Y t d p t +d [ p,Y ] t

The bracket d [ p,Y ] t depends on the regularity of the processes and the index H .

Step 5: Variation calculation. Integrating and taking expectation:

E[ p T Y T ]=E[ 0 T p t ( b u ( t ) v t )dt+ 0 T Y t ( b x ( t ) p t σ x ( t ) q t g x ( t ) )dt ] +bracket terms

The bracket terms are expressed in terms of H and must be treated separately depending on whether H>1/2 or H<1/2 .

Step 6: Simplification. Using p T = h x ( X T * ) , we obtain:

E[ h x ( X T * ) Y T ]=E[ 0 T ( p t b u ( t ) v t Y t ( b x ( t ) p t + σ x ( t ) q t + g x ( t ) ) )dt ]+R( H )

where R( H ) represents additional terms due to the fractional nature.

Step 7: Optimality condition. Since u * is optimal, δJ0 for any perturbation v , so:

E[ 0 T ( g u ( t )+ p t b u ( t )+ q t σ u ( t ) ) v t dt ]0

This means that for almost every t :

g u ( t, X t * , u t * )+ p t b u ( t, X t * , u t * )+ q t σ u ( t, X t * , u t * )=0a.e.

Step 8: Minimization condition. The last equality can also be expressed as:

H( t, X t * , u t * , p t , q t )= min uU H( t, X t * ,u, p t , q t )a.e.

where the Hamiltonian is given by:

H( t,x,u,p,q )=g( t,x,u )+b( t,x,u )p+σ( t,x,u )q

Important remarks

  • Fractional case: The complete proof requires an in-depth analysis of fractional stochastic calculus, particularly the manipulation of the bracket which differs from the standard Brownian case.

  • Regularity: For H>1/2 , we often use Malliavin calculus, while for H<1/2 , approximation techniques are employed.

  • Existence: The existence and uniqueness of the adjoint backward stochastic differential equations must be demonstrated separately.

6. Application to Optimal Control of Systems Driven by Fractional Brownian Motion

Backward stochastic differential equations (BSDEs) find a natural application in stochastic optimal control theory via the dynamic programming principle. Consider a dynamical system whose state X t n is governed by an SDE driven by a fractional Brownian motion (fBm) B t H with Hurst exponent H( 0,1 ) :

{ d X t =b( t, X t , u t )dt+σ( t, X t , u t )d B t H X 0 = x 0 (4)

where u t U is an admissible control, belonging to a class of processes adapted to the fBm filtration. Our goal is to minimize the following cost criterion:

J( u )=E[ 0 T g( t, X t , u t )dt +h( X T ) ]

Under standard regularity conditions on the coefficients b , σ , g and h ,

the optimal cost V( t,x )= inf u J( u )| X t =x is the solution of a stochastic Hamilton-Jacobi-Bellman (HJB) equation. The solution pair ( Y t , Z t ) of the associated BSDE:

{ d Y t =f( t, Y t , Z t )dt Z t d B t H Y T =h( X T ) (5)

plays a crucial role. In particular, we have the relation Y t =V( t, X t ) , and the process Z t is related to the derivative of the optimal value. The Hamiltonian function f is defined by:

f( t,x,y,z )= inf uU { g( t,x,u )+z σ 1 ( t,x,u )b( t,x,u ) }

Thus, the numerical resolution of the BSDE (5) allows us not only to evaluate the optimal cost Y 0 =V( 0, x 0 ) but also to characterize the optimal control policy u t * via the diffusion term Z t .

Challenges and Difficulties Encountered listing the obstacles (non-martingale, Skorokhod, Malliavin, simulation, sensitivity to H ).

7. Numerical Simulations

In this section, we define a numerical analysis to verify the proposed discretization scheme and demonstrate the effect of the Hurst exponent H on the solution of the BSDE. We consider an academic test case for which the analytical solution is known, allowing us to precisely quantify the discretization error [8] [9].

7.1. Model and Parameters

We consider the following linear BSDE:

{ d Y t =[ β Y t +γ Z t ]dt Z t d B t H Y T =sin( B T H +T )

with parameters T=1 , β=0.2 , and γ=0.3 . For this problem, the exact solution is given by:

Y t = e β( Tt ) E[ sin( B T H +T )| t ]

Explanation of the fBm Simulation Algorithm

Simulation of fBm Increments

To generate correlated increments of fractional Brownian motion, we use the Davies-Harte method (see [8]), based on the circular embedding of the covariance matrix. This method provides accurate and fast simulation of trajectories, with a complexity of O( NlogN ) . We have verified that the results match those obtained using the Cholesky method, although the latter involves a cost of order O( N 2 ) . We therefore prefer the Davies-Harte method for our numerical experiments.

7.2. Discretization Scheme

For a regular partition of [ 0,T ] with N time steps ( Δt=T/N ), the pair ( Y t i , Z t i ) is approximated by ( Y i , Z i ) according to the following scheme:

Y i =E[ Y i+1 | t i ]+Δtf( t i , Y i , Z i )

Z i = 1 Δt E[ Y i+1 Δ B t i H | t i ]

The conditional expectations are predicted using a least squares regression methodology based on a set of Legendre polynomials.

7.3. Results and Analysis

Figure 1(b) shows a typical trajectory of the solution Y t for H=0.7 . We observe that the process follows a rather smooth dynamics, with equally continuous trends, a typical characteristic of long-memory noise. The estimated solution fits exactly with the reference solution, demonstrating the accuracy of the scheme.

On the other hand, Figure 1(a) for H=0.3 corresponds to a much more erratic trajectory, with frequent oscillations and anti-persistence. Our scheme can also reproduce this more realistic behavior, even though the instantaneous error is slightly larger due to the greater volatility.

(a) Simulation for H=0.3 (b) Simulation for H=0.7

Figure 1. Simulations for different H values.

Table 1 presents the accuracy of the scheme and its computational effort as a function of H . The L 2 error is calculated with respect to a reference solution obtained using a very small time step ( Δt= 10 4 ). We observe that the error decreases as H increases. This type of behavior is expected because increasing H improves the regularity of the driver trajectories, making the problem intrinsically more stable and easier to approximate.

The computation time also increases with H , reflecting the greater complexity of exactly simulating correlated increments for strong long memory.

Table 1. Discretization error and computation time as a function of the Hurst exponent H ( Δt=0.01 , T=1 ).

H

0.6

0.7

0.8

0.9

L 2 Error

0.15

0.12

0.08

0.05

Computation time (s)

45

52

68

85

7.4. Discussion

The numbers obtained in the presented results confirm the viability and effectiveness of the solution of BSDEs driven by fractional Brownian motion. The detailed analysis of the simulations highlights several key elements:

Influence of the Hurst parameter on solution regularity

The strong dependence of solutions on the parameter H highlights the crucial importance of an exact representation of noise in practical applications. For H>0.5 , the persistence of trajectories results in greater regularity of solutions, thus facilitating their numerical approximation. On the other hand, for H<0.5 , anti-persistence creates additional complexity resulting from the more erratic nature of trajectories and the need for more sophisticated numerical schemes.

Performance of the numerical scheme

The decrease in L 2 error observed for large values of H (Table 1) is a particularly encouraging result. This improvement in accuracy is justified by:

  • The better regularity of fBm increments for high H .

  • The reduction of covariance of regression estimators.

  • The greater numerical stability of approximation methods.

Comparison with related works

The attempt of this paper that discusses fractional BSDEs is still evolving in publications. The focus here is on the theoretical aspects as well as the practical computation aspects.

  • Zhang (2017) [9] provided existence and uniqueness of certain BSDEs with fractional Brownian motion and established some of its qualitative properties. His work focused on the analytical aspects of the problem. Theory suggests that one can augment such works with the Malliavin Regularity analysis ( Z t = D t Y t ) as well as an explicit numerical scheme and convergence tests. These results bridge the gap between theory and practice.

  • Nostratipour and Hamdi (2022) [10] proposed numerical approaches based on polynomial chaos expansions. These approaches are highly accurate but very expensive and unfriendly in high dimensions. In the high dimensional cases, my polynomial based (Legendre, Hermite) regression approach is easier and much less expensive, particularly with nonliner generators. More importantly, it is applicable to general problems and more practical than other methods.

  • Bender and Zhang (2008) [8] investigate time discretization methods specific to fBm.

Computational complexity

The fact that computation time increases with H reflects the increase in complexity of exact simulation of correlated increments. This complexity is essentially due to:

  • The need to compute and store large covariance matrices

  • The increasing number of terms in polynomial expansions

  • The management of long memory requiring extended time windows

Comparison with Other Numerical Techniques

To situate our model relative to current works, it is relevant to mention recently developed numerical techniques for fractional BSDEs. For instance, Nostratipour and Hamdi [10] proposed a model based on polynomial chaos expansions, while Bender and Zhang [8] explored time discretization methods specific to fBm. In comparison, our approach using polynomial regression on simulated increments offers an interesting trade-off:

  • A convergence rate comparable to that mentioned in [10].

  • But at a reduced computational cost thanks to the use of least squares regression.

  • A more adaptable implementation for nonlinear generators.

This comparison highlights the competitiveness of our method, while leaving the door open to potential hybridizations with multi-scale or chaos-based techniques.

Implications for optimal control

These results offer promising horizons for the application of these methods to optimal control problems where exogenous perturbations have long memory, such as:

  • Portfolio management with long-range dependence in returns.

  • Control of physical systems with hysteresis phenomena.

  • Network optimization with self-similar traffic.

  • Control of chemical processes with slow relaxation.

Current limitations and challenges

Despite promising performances, some challenges persist:

  • Hypersensitivity to regularity assumptions of coefficients.

  • Computational complexity for high-dimensional problems.

  • Accurate estimation of the parameter H in practice.

  • Adaptation to situations where H may vary over time.

Improvement perspectives

Some research directions for improvement seem particularly promising:

  • Multi-scale schemes based on fractal structure.

  • Integration of machine learning techniques for approximation of conditional expectations.

  • Adaptation of variance reduction techniques specific to the fractional context.

  • Extension to cases of non-linear coefficients and irregular terminal conditions.

These results confirm that fractional BSDEs constitute a rich theoretical framework and offer effective numerical tools for modeling and optimizing systems subjected to long-memory perturbations. Mastering these techniques opens the way to numerous applications in domains where classical Brownian hypotheses prove insufficient.

Convergence and Robustness Analysis

Robustness and Stability of the Scheme

We studied the sensitivity of the numerical approach based on the choice of basis functions (Legendre polynomials vs. Hermite polynomials), as well as regarding discretization parameters ( Δt , N ).

The results indicate that L 2 -norm convergence is robust with respect to the choice of polynomials, although higher degrees lead to increased computational cost without significant improvement in accuracy.

The scheme demonstrates robustness over a wide range of H values, including in the anti-persistent regime ( H<0.5 ).

Time-step refinement tests demonstrate linear convergence in Δt , which is consistent with theoretical predictions.

This research supports the validity of our method by proving that it remains stable and accurate even under parameter variations.

8. Conclusions and Perspectives

8.1. Summary of Contributions

This study has established a complete theory of backward stochastic differential equations driven by fractional Brownian motion. These conclusions follow and extend the research of Zhang [9], Bender-Zhang [8], and Nostratipour-Hamdi [10], by introducing a Malliavin regularity analysis and a numerical validation based on the Hurst parameter. Our main contributions can be summarized as follows:

1) Theoretical foundations: We demonstrated existence and uniqueness results for solutions in adapted Sobolev spaces, establishing general sufficient conditions on coefficients and the terminal condition.

2) Regularity analysis: Through Malliavin calculus, we characterized the Hölder regularity of solutions and established the fundamental relation Z t = D t Y t , thus linking the diffusion process to stochastic derivatives.

3) Application framework: We formulated and proved a stochastic maximum principle for optimal control problems, providing necessary optimality conditions for systems perturbed by long-memory noise.

4) Numerical validation: The development and implementation of an efficient numerical scheme allowed us to precisely quantify the impact of the Hurst parameter on solution behavior and to experimentally validate our theoretical results.

8.2. Theoretical and Practical Implications

The obtained results present several significant implications.

8.2.1. On the Theoretical Level

  • Extension of the classical BSDE framework to the fractional case, thus enriching stochastic calculus theory.

  • Better understanding of the links between noise regularity and solution properties.

  • Development of analysis tools adapted to long-memory processes.

8.2.2. On the Practical Level

  • Provision of robust mathematical tools for modeling real phenomena exhibiting long memory.

  • Opening of new perspectives for optimal control of complex systems.

  • Proposal of efficient numerical methods for concrete implementation.

8.3. Research Perspectives

Several research directions deserve to be explored as extensions of this work.

8.3.1. Theoretical Extensions

  • Rough case ( H<1/2 ): Development of a theory for H values less than 1/2, requiring the use of rough stochastic calculus and advanced approximation techniques.

  • Quadratic BSDEs: Study of BSDEs with generator having quadratic growth in z , presenting substantial mathematical challenges but offering extended applications.

  • Infinite-dimensional systems: Extension to the framework of BSDEs in Hilbert spaces, to model distributed systems and stochastic partial differential equations.

8.3.2. Numerical Developments

  • Higher-order schemes: Design of high convergence order algorithms, exploiting in particular multi-step methods and extrapolation techniques.

  • Complexity reduction: Development of model reduction methods and sparse approximation to treat high-dimensional problems.

  • Artificial intelligence integration: Combination of traditional methods with deep learning approaches for approximation of conditional expectations.

8.3.3. Advanced Applications

  • Mathematical finance: Pricing and hedging of exotic options depending on market memory, particularly in markets presenting persistence anomalies.

  • Systems engineering: Optimal control of physical systems exhibiting hysteresis phenomena or long relaxation times.

  • Epidemiology and biology: Modeling and control of epidemic or biological processes exhibiting long temporal dependence.

  • Energy and environment: Optimization of renewable energy production and distribution, taking into account the persistence of meteorological conditions.

8.4. Scientific and Societal Impact

The advances presented in this work contribute to expanding the field of financial mathematics and stochastic control. On the societal level, the fine modeling of long-memory phenomena opens perspectives for better financial risk management, more efficient optimization of energy systems, and improvement of control strategies in various application domains.

The robustness of the theoretical results coupled with the efficiency of the proposed numerical methods positions this work as a solid foundation for future research, both fundamental and applied, in the domain of fractional BSDEs.

Conflicts of Interest

The author declares no conflicts of interest regarding the publication of this paper.

References

[1] Pardoux, E. and Peng, S.G. (1990) Adapted Solution of a Backward Stochastic Differential Equation. Systems & Control Letters, 14, 55-61. [Google Scholar] [CrossRef
[2] Peng, S. (1991) Probabilistic Interpretation for Systems of Quasilinear Parabolic Partial Differential Equations. Stochastics and Stochastics Reports, 37, 61-74.
[3] Hu, Y. and Øksendal, B. (1996) Fractional White Noise Calculus and Applications to Finance. Infinite Dimensional Analysis, Quantum Probability and Related Topics, 6, 1-32.
[4] Biagini, F., Hu, Y., Øksendal, B. and Zhang, T. (2008) Stochastic Calculus for Fractional Brownian Motion and Applications. Springer. [Google Scholar] [CrossRef
[5] Nualart, D. (2006) The Malliavin Calculus and Related Topics. 2nd Edition, Springer.
[6] Mishura, Y. (2008) Stochastic Calculus for Fractional Brownian Motion and Related Processes. Springer. [Google Scholar] [CrossRef
[7] Coutin, L. (2007) An Introduction to (stochastic) Calculus with Respect to Fractional Brownian Motion. In: Donati-Martin, C., Émery, M., Rouault, A. and Stricker, C., Eds., Séminaire de Probabilités XL, Springer, 3-65. [Google Scholar] [CrossRef
[8] Bender, C. and Zhang, T. (2008) Time-Discretization of Stochastic Differential Equations with Fractional Brownian Motion. Mathematics of Computation, 77, 1587-1610.
[9] Zhang, X. (2017) Backward Stochastic Differential Equations with Fractional Brownian Motion. Stochastic Processes and their Applications, 127, 4035-4055.
[10] Nostratipour, M. and Hamdi, M. (2022) Numerical Methods for Fractional Backward Stochastic Differential Equations. Journal of Computational and Applied Mathematics, 405, Article 113972.

Copyright © 2025 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.