SearcharxivSearch

arXiv · 1505.01298

Pathwise approximation of SDEs by coupling piecewise abelian rough paths

Abstract

We present a new pathwise approximation scheme for stochastic differential equations driven by multidimensional Brownian motion which does not require the simulation of L\'{e}vy area and has a Wasserstein convergence rate better than the Euler scheme's strong error rate of $O(\sqrt{h})$, where $h$ is the step-size. By using rough path theory we avoid imposing any non-degenerate H\"{o}rmander or ellipticity assumptions on the vector fields of the SDE, in contrast to the similar papers of Alfonsi, Davie, and Malliavin et al. The scheme is based on the log-ODE method with the L\'{e}vy area increments replaced by Gaussian approximations with the same covariance structure. The Wasserstein coupling is achieved by making small changes to the argument of Davie, the latter being an extension of the Koml\'{o}s-Major-Tusn\'{a}dy Theorem. We prove that the convergence of the scheme in the Wasserstein metric is of the order $O(h^{1-2/\gamma-\varepsilon})$ when the vector fields are $\gamma$-Lipschitz in the sense of Stein.

Explore related subjects

Keep this discovery

BibTeXRIS

Guy Flint, Terry Lyons. 2015-05-06. Pathwise approximation of SDEs by coupling piecewise abelian rough paths. https://arxiv.org/abs/1505.01298

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