English
Related papers

Related papers: Subexponential upper and lower bounds in Wasserste…

200 papers

By the probabilistic coupling approach which combines a new refined basic coupling with the synchronous coupling for L\'evy processes, we obtain explicit exponential contraction rates in terms of the standard $L^1$-Wasserstein distance for…

Probability · Mathematics 2024-02-20 Yao Liu , Jian Wang , Meng-ge Zhang

We determine the convergence speed of a numerical scheme for approximating one-dimensional continuous strong Markov processes. The scheme is based on the construction of coin tossing Markov chains whose laws can be embedded into the process…

Probability · Mathematics 2020-08-26 Stefan Ankirchner , Thomas Kruse , Mikhail Urusov

We present a framework for obtaining explicit bounds on the rate of convergence to equilibrium of a Markov chain on a general state space, with respect to both total variation and Wasserstein distances. For Wasserstein bounds, our main tool…

Statistics Theory · Mathematics 2011-02-28 Neal Madras , Deniz Sezer

We are interested in the rate of convergence of a subordinate Markov process to its invariant measure. Given a subordinator and the corresponding Bernstein function (Laplace exponent) we characterize the convergence rate of the subordinate…

Probability · Mathematics 2017-09-01 Chang-Song Deng , René L. Schilling , Yan-Hong Song

In this paper a class of Ornstein--Uhlenbeck processes driven by compound Poisson processes is considered. The jumps arrive with exponential waiting times and are allowed to be two-sided. The jumps are assumed to form an iid sequence with…

Probability · Mathematics 2016-09-01 Anders Rønn-Nielsen

For general penalized Markov processes with soft killing, we propose a simple criterion ensuring uniform convergence of conditional distributions in Wasserstein distance to a unique quasi-stationary distribution. We give several examples of…

Probability · Mathematics 2025-11-13 Nicolas Champagnat , Edouard Strickler , Denis Villemonais

Several issues in machine learning and inverse problems require to generate discrete data, as if sampled from a model probability distribution. A common way to do so relies on the construction of a uniform probability distribution over a…

Optimization and Control · Mathematics 2021-06-16 Quentin Merigot , Filippo Santambrogio , Clément Sarrazin

The aim of this article is to prove that diffusion processes in $\mathbb{R}^d$ with a drift can be approximated by suitable Markov chains on $n^{-1}\mathbb{Z}^d$. Moreover, we investigate sufficient conditions on the conductances which…

Probability · Mathematics 2022-05-03 Marvin Weidner

For general, almost surely absorbed Markov processes, we obtain necessary and sufficient conditions for exponential convergence to a unique quasi-stationary distribution in the total variation norm. These conditions also ensure the…

Probability · Mathematics 2014-12-25 Nicolas Champagnat , Denis Villemonais

We formally introduce and study locally-balanced Markov jump processes (LBMJPs) defined on a general state space. These continuous-time stochastic processes with a user-specified limiting distribution are designed for sampling in settings…

Probability · Mathematics 2025-04-21 Samuel Livingstone , Giorgos Vasdekis , Giacomo Zanella

In this paper we look at the properties of limits of a sequence of real valued time inhomogeneous diffusions. When convergence is only in the sense of finite-dimensional distributions then the limit does not have to be a diffusion. However,…

Probability · Mathematics 2009-05-14 George Lowther

We study the problem of sampling from a distribution $\target$ using the Langevin Monte Carlo algorithm and provide rate of convergences for this algorithm in terms of Wasserstein distance of order $2$. Our result holds as long as the…

Computation · Statistics 2016-07-04 Thomas Bonis

This article establishes explicit non-asymptotic ergodic bounds in the renormalized Wasserstein-Kantorovich-Rubinstein (WKR) distance for a viscous energy shell lattice model of turbulence with random energy injection. The system under…

Mathematical Physics · Physics 2024-11-15 Gerardo Barrera , Michael A. Högele , Juan Carlos Pardo , Ilya Pavlyukevich

We describe conditions on non-gradient drift diffusion Fokker-Planck equations for its solutions to converge to equilibrium with a uniform exponential rate in Wasserstein distance. This asymptotic behaviour is related to a functional…

Probability · Mathematics 2012-09-19 François Bolley , Ivan Gentil , Arnaud Guillin

Laplace-type results characterize the limit of sequence of measures $(\pi_\varepsilon)_{\varepsilon >0}$ with density w.r.t the Lebesgue measure $(\mathrm{d} \pi_\varepsilon / \mathrm{d} \mathrm{Leb})(x) \propto \exp[-U(x)/\varepsilon]$…

Probability · Mathematics 2026-04-29 Valentin De Bortoli , Agnès Desolneux

We prove a sample path Large Deviation Principle (LDP) for a class of jump processes whose rates are not uniformly Lipschitz continuous in phase space. Building on it we further establish the corresponding Wentzell-Freidlin (W-F) (infinite…

Probability · Mathematics 2017-10-24 Andrea Agazzi , Amir Dembo , Jean-Pierre Eckmann

We obtain explicit criteria for both exponential ergodicity and strong ergodicity for one-dimensional time-changed symmetric stable processes with $\alpha\in(1,2)$. Explicit lower bounds for ergodic convergence rates are given.

Probability · Mathematics 2021-12-06 Tao Wang

The efficiency of a Markov sampler based on the underdamped Langevin diffusion is studied for high dimensional targets with convex and smooth potentials. We consider a classical second-order integrator which requires only one gradient…

Probability · Mathematics 2021-06-21 Pierre Monmarché

Let $X_t$ be the (reflecting) diffusion process generated by $L:=\Delta+\nabla V$ on a complete connected Riemannian manifold $M$ possibly with a boundary $\partial M$, where $V\in C^1(M)$ such that $\mu(d x):= e^{V(x)}d x$ is a probability…

Probability · Mathematics 2021-07-06 Feng-Yu Wang

We analyze the behavior of stochastic approximation algorithms where iterates, in expectation, progress towards an objective at each step. When progress is proportional to the step size of the algorithm, we prove exponential concentration…

Machine Learning · Statistics 2024-03-26 Kody Law , Neil Walton , Shangda Yang