SearcharxivSearch

arXiv · 2605.05986

Convergence rate of the occupation measure of classes of ergodic processes toward their invariant distribution in mean Wasserstein distance

Abstract

N. Fournier and A. Guillin obtained in their 2015 PTRF paper some bounds of the L^p-mean rate of convergence in Wasserstein distance of empirical distributions for a class of stationary mixing processes. In this paper, we propose to extend their strategy of proof and provide general criterions which allow to keep similar rates for a larger class of processes. These results (which do not require regularization techniques) lead to various applications to occupation measures of ergodic processes which may be not stationary or not Markovian under an assumption of {\em conditional} convergence to equilibrium in Total Variation or Wasserstein distance. We then provide explicit conditions which lead to these rates for Brownian diffusions and additive SDEs driven by fractional Brownian Motions {or by Gaussian processes with stationary increments}.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gilles Pagès, Fabien Panloup. 2026-05-07. Convergence rate of the occupation measure of classes of ergodic processes toward their invariant distribution in mean Wasserstein distance. https://arxiv.org/abs/2605.05986

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