SearcharxivSearch

arXiv · 2005.06500

Convergence of trapezoid rule to rough integrals

Abstract

Rough paths techniques give the ability to define solutions of stochastic differential equations driven by signals $X$ which are not semimartingales and whose $p$-variation is finite only for large values of $p$. In this context, rough integrals are usually Riemann-Stieltjes integrals with correction terms that are sometimes seen as unnatural. As opposed to those somewhat artificial correction terms, our endeavor in this note is to produce a trapezoid rule for rough integrals driven by general $d$-dimensional Gaussian processes. Namely we shall approximate a generic rough integral $\int y \, dX$ by Riemann sums avoiding the usual higher order correction terms, making the expression easier to work with and more natural. Our approximations apply to all controlled processes $y$ and to a wide range of Gaussian processes $X$ including fractional Brownian motion with a Hurst parameter $H>1/4$. As a corollary of the trapezoid rule, we also consider the convergence of a midpoint rule for integrals of the form $\int f(X) dX$.

Explore related subjects

Keep this discovery

BibTeXRIS

Yanghui Liu, Zachary Selk, Samy Tindel. 2020-05-13. Convergence of trapezoid rule to rough integrals. https://arxiv.org/abs/2005.06500

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