Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 13 min ago
PreprintarXiv licencearXiv

Strong Convergence of Fully Discrete Tamed Euler Approximations for Time-Changed Stochastic Delay Differential Equations

Abstract

We establish the strong convergence of a fully discrete equidistant tamed Euler--Maruyama (ETEM) method for time-changed stochastic delay differential equations (TCSDDEs) with state-dependent dt drifts. A coupled one-sided condition on the subordinator-driven drift and diffusion allows superlinear coefficients with polynomial growth in both the current and delayed states. For subordinators whose Laplace exponent satisfies ψ(λ)≥ c1λα for all sufficiently large λ, with α∈(0,1), we derive strong error bounds in terms of the time step Δ and the subordinator sampling step δ, without imposing a relationship between them. Comparing the partitions generated by the exact and approximate inverse subordinators controls the sampling error without introducing a factor proportional to the number of time steps. For coefficients Lipschitz in both time arguments and Lipschitz history, the scheme achieves a strong convergence rate of order Δα/2(1+|logΔ|)(1−α)/2+√(δ(1+|logδ|)). A terminal lower bound c(Δα/2+δ1/2) for a multiplicative-noise equation with a stable subordinator establishes the sharpness of both polynomial exponents for this Euler scheme. Numerical experiments illustrate convergence for nonautonomous and multidimensional superlinear delay equations, as well as delay equations with low-regularity time dependence.

Related

  1. Convergence and error analysis for numerical approximations of stochastic Leray-Lions equations
    Ngan Le, Huateng Zhu
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingProbabilityarXiv
  2. Convergence in Hölder norms for Markovian approximations of stochastic Volterra equations
    Noé Corneille, Kristin Kirchner, Pietro Pezzoli Frigerio
    arXivPreprintCC BY 4.0Full textNumerical analysis & scientific computingProbabilityarXiv
  3. Multilevel Picard approximations for McKean-Vlasov stochastic differential equations with jumps
    Ariel Neufeld, Tuan Anh Nguyen, Philipp Schmocker
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingProbabilityarXiv
  4. Numerical Methods for Dynamical Low-Rank Approximations of Stochastic Differential Equations -- Part II: Stochastic discretization
    Yoshihito Kazashi, Fabio Nobile, Fabio Zoccolan
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  5. Convergence of a fully discrete approximation for the stochastic 2D Euler equations with Kraichnan transport noise
    Abhishek Chaudhary, Ujjwal Koley, Andreas Prohl
    arXivPreprintarXiv licenceFull textAnalysis & PDEsNumerical analysis & scientific computingarXiv
BibTeX
@misc{zuo2026strong,
  title = {{Strong Convergence of Fully Discrete Tamed Euler Approximations for Time-Changed Stochastic Delay Differential Equations}},
  author = {Ruchun Zuo and Qian Guo},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.28552},
  eprint = {2610.28552},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.28552},
}
RIS
TY  - UNPB
TI  - Strong Convergence of Fully Discrete Tamed Euler Approximations for Time-Changed Stochastic Delay Differential Equations
AU  - Ruchun Zuo
AU  - Qian Guo
PY  - 2026
DA  - 2026/10/20
PB  - arXiv
DO  - 10.48550/arxiv.2610.28552
UR  - https://arxiv.org/abs/2610.28552
AB  - We establish the strong convergence of a fully discrete equidistant tamed Euler--Maruyama (ETEM) method for time-changed stochastic delay differential equations (TCSDDEs) with state-dependent dt drifts. A coupled one-sided condition on the subordinator-driven drift and diffusion allows superlinear coefficients with polynomial growth in both the current and delayed states. For subordinators whose Laplace exponent satisfies ψ(λ)≥ c_1λ^α for all sufficiently large λ, with α∈(0,1), we derive strong error bounds in terms of the time step Δ and the subordinator sampling step δ, without imposing a relationship between them. Comparing the partitions generated by the exact and approximate inverse subordinators controls the sampling error without introducing a factor proportional to the number of time steps. For coefficients Lipschitz in both time arguments and Lipschitz history, the scheme achieves a strong convergence rate of order Δ^α/2(1+|logΔ|)^(1−α)/2+√(δ(1+|logδ|)). A terminal lower bound c(Δ^α/2+δ^1/2) for a multiplicative-noise equation with a stable subordinator establishes the sharpness of both polynomial exponents for this Euler scheme. Numerical experiments illustrate convergence for nonautonomous and multidimensional superlinear delay equations, as well as delay equations with low-regularity time dependence.
ER  -