Search arXivSearch

arXiv · 2303.05346

Sharp lower error bounds for strong approximation of SDEs with piecewise Lipschitz continuous drift coefficient

Abstract

We study pathwise approximation of strong solutions of scalar stochastic differential equations (SDEs) at a single time in the presence of discontinuities of the drift coefficient. Recently, it has been shown by M\"uller-Gronbach and Yaroslavtseva (2022) that for all $p \in [1, \infty)$ a transformed Milstein-type scheme reaches an $L^p$-error rate of at least $3 / 4$ when the drift coefficient is a piecewise Lipschitz-continuous function with a piecewise Lipschitz-continuous derivative and the diffusion coefficient is constant. It has been proven by M\"uller-Gronbach and Yaroslavtseva (2023) that this rate $3 / 4$ is optimal if one additionally assumes that the drift coefficient is bounded, increasing and has a point of discontinuity. While boundedness and monotonicity of the drift coefficient are crucial for the proof of the matching lower bound of M\"uller-Gronbach and Yaroslavtseva (2023), we show that both conditions can be dropped. For the proof we apply a transformation technique which was so far only used to obtain upper bounds.

Explore related subjects

Keep this discovery

BibTeXRIS

Simon Ellinger. 2023-03-09. Sharp lower error bounds for strong approximation of SDEs with piecewise Lipschitz continuous drift coefficient. https://doi.org/10.1016/j.jco.2023.101822

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

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR