English
Related papers

Related papers: Long-time $L^p$ Wasserstein contraction for diffus…

200 papers

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

A subdiffusion problem in which the diffusion term is related to a stable stochastic process is introduced. Linear models of these systems have been studied in a general way, but non-linear models require a more specific analysis. The model…

Probability · Mathematics 2021-11-05 Soveny Solís , Vicente Vergara

Estimating a $d$-dimensional distribution $\mu$ by the empirical measure $\hat{\mu}_n$ of its samples is an important task in probability theory, statistics and machine learning. It is well known that $\mathbb{E}[\mathcal{W}_p(\hat{\mu}_n,…

Probability · Mathematics 2026-03-24 Martin Larsson , Jonghwa Park , Johannes Wiesel

In this paper, we use the class of Wasserstein metrics to study asymptotic properties of posterior distributions. Our first goal is to provide sufficient conditions for posterior consistency. In addition to the well-known Schwartz's…

Statistics Theory · Mathematics 2021-07-01 Minwoo Chae , Pierpaolo De Blasi , Stephen G. Walker

We study the empirical process arising from a multi-dimensional diffusion process with periodic drift and diffusivity. The smoothing properties of the generator of the diffusion are exploited to prove the Donsker property for certain…

Probability · Mathematics 2023-07-06 Neil Deo

We study long time behavior of a discrete time weakly interacting particle system, and the corresponding nonlinear Markov process in $\mathbb{R}^d$, described in terms of a general stochastic evolution equation. In a setting where the state…

Probability · Mathematics 2014-01-16 Amarjit Budhiraja , Abhishek Pal Majumder

In this short paper, we consider discrete-time Markov chains on lattices as approximations to continuous-time diffusion processes. The approximations can be interpreted as finite difference schemes for the generator of the process. We…

Probability · Mathematics 2016-11-08 Christoph Reisinger

Non-convex sampling is a key challenge in machine learning, central to non-convex optimization in deep learning as well as to approximate probabilistic inference. Despite its significance, theoretically there remain many important…

Machine Learning · Computer Science 2024-09-18 Mohammad Reza Karimi , Ya-Ping Hsieh , Andreas Krause

We consider a Markov chain X_1, X_2, ..., X_n belonging to a class of iterated random functions, which is "one-step contracting" with respect to some distance d. If f is any separately Lipschitz function with respect to d, we use a well…

Probability · Mathematics 2014-02-18 Jérôme Dedecker , Xiequan Fan

For a wide class of continuous-time Markov processes, including all irreducible hypoelliptic diffusions evolving on an open, connected subset of $\RL^d$, the following are shown to be equivalent: (i) The process satisfies (a slightly weaker…

Probability · Mathematics 2016-04-27 Ioannis Kontoyiannis , Sean P. Meyn

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…

Statistics Theory · Mathematics 2026-01-13 Arash A. Amini , Luciano Vinas

In this paper, we find some general and efficient sufficient conditions for the exponential convergence $W_{1,d}(P_t(x,\cdot), P_t(y,\cdot) )\le Ke^{-\delta t}d(x,y)$ for the semigroup $(P_t)$ of one-dimensional diffusion. Moreover some…

Probability · Mathematics 2017-03-03 Lingyan Cheng , Ruinan Li , Liming Wu

We propose in this paper a construction of a diffusion process on the Wasserstein space P\_2(R) of probability measures with a second-order moment. This process was introduced in several papers by Konarovskyi (see e.g. "A system of…

Probability · Mathematics 2018-12-06 Victor Marx

The subject of this paper is the estimation of a probability measure on ${\mathbb R}^d$ from data observed with an additive noise, under the Wasserstein metric of order $p$ (with $p\geq 1$). We assume that the distribution of the errors is…

Statistics Theory · Mathematics 2013-07-22 Jérôme Dedecker , Bertrand Michel

Under natural conditions, we proved the exponential ergodicity in Wasserstein distance of two-type continuous-state branching processes in L\'evy random environments with immigration. Furthermore, we expressed accurately the parameters of…

Probability · Mathematics 2022-02-14 Shukai Chen , Rongjuan Fang , Xiangqi Zheng

Defining a divergence between the laws of continuous martingales is a delicate task, owing to the fact that these laws tend to be singular to each other. An important idea, put forward by N. Gantert, is to instead consider a scaling limit…

Probability · Mathematics 2025-07-08 Julio Backhoff-Veraguas , Xin Zhang

We investigate the stability of the Wasserstein distance, a metric structure on the space of probability measures arising from the theory of optimal transport, under metric ultralimits. We first show that if $(X_{i},d_{i})_{i\in\mathbb{N}}$…

Metric Geometry · Mathematics 2023-03-09 Andrew Warren

In this paper, we prove that the time supremum of the Wasserstein distance between the time-marginals of a uniformly elliptic multidimensional diffusion with coefficients bounded together with their derivatives up to the order $2$ in the…

Probability · Mathematics 2015-03-20 Aurélien Alfonsi , Benjamin Jourdain , Arturo Kohatsu-Higa

Gromov--Wasserstein (GW) distances compare graphs, shapes, and point clouds through internal distances, without requiring a common coordinate system. This invariance is powerful, but discrete GW is a nonconvex quadratic optimal transport…

Machine Learning · Computer Science 2026-05-15 Ao Xu , Tieru Wu

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