Related papers: Convergence rate to equilibrium in Wasserstein dis…

We present upper bounds for the Wasserstein distance of order $p$ between the marginals of L\'evy processes, including Gaussian approximations for jumps of infinite activity. Using the convolution structure, we further derive upper bounds…

We consider two reflecting diffusion processes $(X_t)_{t \ge 0}$ with a moving reflection boundary given by a non-decreasing pure jump Markov process $(R_t)_{t \ge 0}$. Between the jumps of the reflection boundary the diffusion part behaves…

We study the convergence to equilibrium of the Dyson-Jacobi process, a system of n interacting particles on the segment [0, 1] arising from Random Matrix Theory. We establish the occurence of a cutoff phenomenon for the intrinsic…

We consider $M/Ph/n+M$ queueing systems in steady state. We prove that the Wasserstein distance between the stationary distribution of the normalized system size process and that of a piecewise Ornstein-Uhlenbeck (OU) process is bounded by…

In this paper, we establish new quantitative convergence bounds for a class of functional autoregressive models in weighted total variation metrics. To derive our results, we show that under mild assumptions, explicit minorization and…

We establish a general framework to study the rate of convergence of a Euler type approximation scheme with decreasing time steps to the invariant measure, for a general class of stochastic systems. The error is measured in general…

Despite the remarkable empirical success of score-based diffusion models, their statistical guarantees remain underdeveloped. Existing analyses often provide pessimistic convergence rates that do not reflect the intrinsic low-dimensional…

We introduce a unified framework to estimate the convergence of Markov chains to equilibrium in Wasserstein distance. The framework can provide convergence bounds with rates ranging from polynomial to exponential, all derived from a…

Divergence functions are measures of distance or dissimilarity between probability distributions that serve various purposes in statistics and applications. We propose decompositions of Wasserstein and Cram\'er distances$-$which compare two…

Motivated by the statistical and computational challenges of computing Wasserstein distances in high-dimensional contexts, machine learning researchers have defined modified Wasserstein distances based on computing distances between…

In the paper, the Kolmogorov distance is used to study the Smoluchowski-Kramers approximation for diffusions with jumps. The convergence rate is derived by Malliavin calculus.

We prove the global asymptotic equivalence between the experiments generated by the discrete (high frequency) or continuous observation of a path of a time inhomogeneous jump-diffusion process and a Gaussian white noise experiment. Here,…

Motivated by the problem of sampling from ill-conditioned log-concave distributions, we give a clean non-asymptotic convergence analysis of mirror-Langevin diffusions as introduced in Zhang et al. (2020). As a special case of this…

Recently, a Wasserstein-type distance for Gaussian mixture models has been proposed. However, that framework can only be generalized to identifiable mixtures of general elliptically contoured distributions whose components come from the…

We establish a general concentration result for the 1-Wasserstein distance between the empirical measure of a sequence of random variables and its expectation. Unlike standard results that rely on independence (e.g., Sanov's theorem) or…

We prove that front tracking approximations to entropy solutions of scalar conservation laws with convex fluxes converge at a rate of $\Delta x^2$ in the 1-Wasserstein distance $W_1$. Assuming positive initial data, we also show that the…

We present a new lower bound on the differential entropy rate of stationary processes whose sequences of probability density functions fulfill certain regularity conditions. This bound is obtained by showing that the gap between the…

The $2$-Wasserstein distance is sensitive to minor geometric differences between distributions, making it a very powerful dissimilarity metric. However, due to this sensitivity, a small outlier mass can also cause a significant increase in…

We develop a general framework for statistical inference with the 1-Wasserstein distance. Recently, the Wasserstein distance has attracted considerable attention and has been widely applied to various machine learning tasks because of its…

We investigate the convergence to (quasi--)equilibrium of a density dependent Markov chain in~${\mathbb Z}^d$, whose drift satisfies a system of ordinary differential equations having an attractive fixed point. For a sequence of such…