Search arXiv⌕ Search

arXiv · 2609.37019

Consistency and Convergence of the Backward-Euler Scheme for Stochastic Functional Differential Equations Driven by Fractional Brownian Motion

Abstract

We study the backward-Euler scheme for a class of stochastic functional differential equations (SFDEs) with memory driven by a fractional Brownian motion with Hurst parameter H > 1/2. We first establish the local consistency of the method, with a local truncation error of order H -$ρ$- $β$ + 1, and then, as the main result, prove the uniform global pathwise convergence of the numerical approximation, on a set of probability one, with order H -$ρ$ -$β$, for $β$ $\in$ (1-H, 1/2) and 0 < $ρ$ < H -$β$. A uniform high-probability formulation with deterministic constants follows as a corollary. In particular, the convergence order can be taken arbitrarily close to 2H -1, matching the order obtained for the explicit Euler scheme. The convergence proof relies on an exact integral representation of the scheme at mesh points, an a priori bound for the numerical solution, fractional calculus estimates, and a Gronwall inequality for weakly singular kernels.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alexander Abreu, Lisandro Fermin, Ernesto Mordecki, Soledad Torres. 2026-09-29. Consistency and Convergence of the Backward-Euler Scheme for Stochastic Functional Differential Equations Driven by Fractional Brownian Motion. https://arxiv.org/abs/2609.37019

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rough backward SDEs with discontinuous Young drivers

We study solutions to backward differential equations that are driven hybridly by a deterministic discontinuous rough path $W$ of finite $q$-variation for $q \in [1, 2)$ and by Brownian motion $B$. To distinguish between integration of jumps in a forward- or Marcus-sense, we refer to these equations as forward- respectively Marcus-type rough backward stochastic differential equations (RBSDEs). We establish global well-posedness by proving global apriori bounds for solutions and employing fixed-point arguments locally. Furthermore, we lift the RBSDE solution and the driving rough noise to the space of decorated paths endowed with a Skorokhod-type metric and show stability of solutions with respect to perturbations of the rough noise. Finally, we prove well-posedness for a new class of backward doubly stochastic differential equations (BDSDEs), which are jointly driven by a Brownian martingale $B$ and an independent discontinuous stochastic process $L$ of finite $q$-variation. We explain, how our RBSDEs can be understood as conditional solutions to such BDSDEs, conditioned on the information generated by the path of $L$.

math.PR↗

Convergence of the KMP model to the KPZ equation

We prove that the Kipnis-Marchioro-Presutti (KMP) process converges to the Kardar-Parisi-Zhang (KPZ) equation, as time $t$ goes to infinity, in a properly scaled observation window shifted by $t^{3/4}$. Our proof is based on identifying the KMP process with a stochastic flow of kernels describing transition probabilities in a certain model of random walk in space-time random environment. This allows to apply a recent result of arXiv:2401.06073 proving convergence of the density field of random walks in random environment to the KPZ equation in a suitably general sense.

math.PR↗

Permuton and local limits for the Luce model

We investigate the asymptotic properties of permutations drawn from the Luce model, a natural probabilistic framework in which permutations are generated sequentially by sampling without replacement, with selection probabilities proportional to prescribed positive weights. These permutations arise in applications such as ranking models, the Tsetlin library, and related Markov processes. Under minimal assumptions on the weights, we establish a permuton limit theorem describing the global behavior of Luce-distributed permutations and derive an explicit density of the limiting permuton. We further compute limiting pattern densities and analyze the differences between exact Luce permutations and their permuton approximations. We also study the local convergence of these permutations, proving a quenched Benjamini--Schramm limit and a central limit theorem for consecutive pattern occurrences. Finally, we prove a central limit theorem for the number of inversions.

math.PR↗