SearcharxivSearch

arXiv · 1506.06966

Rates in the Central Limit Theorem and diffusion approximation via Stein's Method

Abstract

We present a way to use Stein's method in order to bound the Wasserstein distance of order $2$ between two measures $\nu$ and $\mu$ supported on $\mathbb{R}^d$ such that $\mu$ is the reversible measure of a diffusion process. In order to apply our result, we only require to have access to a stochastic process $(X_t)_{t \geq 0}$ such that $X_t$ is drawn from $\nu$ for any $t > 0$. We then show that, whenever $\mu$ is the Gaussian measure $\gamma$, one can use a slightly different approach to bound the Wasserstein distances of order $p \geq 1$ between $\nu$ and $\gamma$ under an additional exchangeability assumption on the stochastic process $(X_t)_{t \geq 0}$. Using our results, we are able to obtain convergence rates for the multi-dimensional Central Limit Theorem in terms of Wasserstein distances of order $p \geq 2$. Our results can also provide bounds for steady-state diffusion approximation, allowing us to tackle two problems appearing in the field of data analysis by giving a quantitative convergence result for invariant measures of random walks on random geometric graphs and by providing quantitative guarantees for a Monte Carlo sampling algorithm.

Explore related subjects

Keep this discovery

BibTeXRIS

Thomas Bonis. 2015-06-23. Rates in the Central Limit Theorem and diffusion approximation via Stein's Method. https://arxiv.org/abs/1506.06966

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