Search arXivSearch

arXiv · 2010.00915

Sharp lower error bounds for strong approximation of SDEs with discontinuous drift coefficient by coupling of noise

Abstract

In the past decade, an intensive study of strong approximation of stochastic differential equations (SDEs) with a drift coefficient that has discontinuities in space has begun. In the majority of these results it is assumed that the drift coefficient satisfies piecewise regularity conditions and that the diffusion coefficient is globally Lipschitz continuous and non-degenerate at the discontinuities of the drift coefficient. Under this type of assumptions the best $L_p$-error rate obtained so far for approximation of scalar SDEs at the final time is $3/4$ in terms of the number of evaluations of the driving Brownian motion. In the present article we prove for the first time in the literature sharp lower error bounds for such SDEs. We show that for a huge class of additive noise driven SDEs of this type the $L_p$-error rate $3/4$ can not be improved. For the proof of this result we employ a novel technique by studying equations with coupled noise: we reduce the analysis of the $L_p$-error of an arbitrary approximation based on evaluation of the driving Brownian motion at finitely many times to the analysis of the $L_p$-distance of two solutions of the same equation that are driven by Brownian motions that are coupled at the given time-points and independent, conditioned on their values at these points. To obtain lower bounds for the latter quantity, we prove a new quantitative version of positive association for bivariate normal random variables $(Y,Z)$ by providing explict lower bounds for the covariance $\text{Cov}(f(Y),g(Z))$ in case of piecewise Lipschitz continuous functions $f$ and $g$. In addition it turns out that our proof technique also leads to lower error bounds for estimating occupation time functionals $\int_0^1 f(W_t)\, dt$ of a Brownian motion $W$, which substantially extends known results for the case of $f$ being an indicator function.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Thomas Müller-Gronbach, Larisa Yaroslavtseva. 2020-10-02. Sharp lower error bounds for strong approximation of SDEs with discontinuous drift coefficient by coupling of noise. https://arxiv.org/abs/2010.00915

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

KEEP EXPLORING

Related papers

Generalized Edgeworth expansions for integer-valued additive functionals of uniformly elliptic Markov chains

We obtain asymptotic expansions for probabilities $\bbP(S_N=k)$ of partial sums of uniformly bounded integer-valued functionals $\DS S_N=\sum_{n=1}^N f_n(X_n)$ of uniformly elliptic inhomogeneous Markov chains. The expansions involve products of polynomials and trigonometric polynomials, and they hold without additional assumptions. As an application of the explicit formulas of the trigonometric polynomials, we relate existence of the standard Edgeworth expansions of order $r$ to the rate of equidistributions of $S_N$ modulo $m$ for small positive integers $m.$

math.PR

Permutations from Random Walk

Xavier and Yushi run a "random race" as follows. An atomless probability distribution $μ$ on the real line is chosen. The runners begin at zero. At time $i$ Xavier draws $\mathbf{X}_i$ from $μ$ and advances that distance, while Yushi advances by an independent drawing $\mathbf{Y}_i$. After $n$ such moves, what is the probability that Yushi led all the way? That the answer (namely, $4^{-n}\binom{2n}{n}$) is independent of $μ$ follows from a classical theorem of Darling, stating that for symmetric atomless increments, the distribution of each individual rank in the permutation obtained by ranking the partial sums is independent of the step law. We give a self-contained proof and extend the result to the permutations generated by partial sums of uniformly random signed permutations of any fixed, finite, generic set of reals. For atomless increments with mean zero and finite variance, without assuming symmetry, we show that random-walk permutations approach a random object that we call the "Wiener permuton," whose expected pattern densities equal the probabilities of the corresponding permutations generated by finite random walks with centered Laplace increments. Finally, we exhibit an infinite family of constructions whose limiting permutons interpolate between the Wiener permuton and the recursive separable permuton; each has the same intensity permuton, providing a single two-dimensional extension of the classical arcsine law for all of them.

math.PR

On the uniqueness of quasi-stationary distributions for population models with spatial structure

Subcritical population processes are attracted to extinction and do not have non-trivial stationary distributions, which prompts the study of quasi-stationary distributions (QSDs) instead. In contrast to what generally happens for stationary distributions, QSDs may not be unique, even under irreducibility conditions. The general conditions for uniqueness of QSDs are not always easy to check. For the branching process, besides the quasi-limiting distribution there are many other QSDs. In this paper, we investigate whether adding little extra information to the continuous-time branching process is enough to obtain uniqueness. We consider the branching process with genealogy and branching random walks, and show that they have a unique QSD.

math.PR