Related papers: A Monotone Approximation to the Wasserstein Diffus…
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…
In this paper, we are interested in a generalised Vlasov equation, which describes the evolution of the probability density of a particle evolving according to a generalised Vlasov dynamic. The achievement of the paper is twofold. Firstly,…
We derive quantitative bounds on the rate of convergence in $L^1$ Wasserstein distance of general M-estimators, with an almost sharp (up to a logarithmic term) behavior in the number of observations. We focus on situations where the…
Given two continuity equations with density-dependent velocities, we provide a new formula for the Wasserstein distance between the solutions in terms of the difference of velocities evaluated at the same density. The formula is…
Let $\pi\in \Pi(\mu,\nu)$ be a coupling between two probability measures $\mu$ and $\nu$ on a Polish space. In this article we propose and study a class of nonparametric measures of association between $\mu$ and $\nu$, which we call…
The theory of optimal transport of probability measures has wide-ranging applications across a number of different fields, including concentration of measure, machine learning, Markov chains, and economics. The generalisation of optimal…
We consider the 2-dimensional random matching problem in $\mathbb{R}^2.$ In a challenging paper, Caracciolo et. al. arXiv:1402.6993 on the basis of a subtle linearization of the Monge Ampere equation, conjectured that the expected value of…
Statistical models often include thousands of parameters. However, large models decrease the investigator's ability to interpret and communicate the estimated parameters. Reducing the dimensionality of the parameter space in the estimation…
These notes are devoted to a summary on the mean-field limit of large ensembles of interacting particles with applications in swarming models. We first make a summary of the kinetic models derived as continuum versions of second order…
Variational problems that involve Wasserstein distances have been recently proposed to summarize and learn from probability measures. Despite being conceptually simple, such problems are computationally challenging because they involve…
We prove a refined contraction inequality for diffusion semigroups with respect to the Wasserstein distance on a compact Riemannian manifold taking account of the dimension. The result generalizes in a Riemannian context, the dimensional…
In this paper, we consider the convergence rate with respect to the Wasserstein distance in the invariance principle for sequential dynamical systems. We utilize and modify the techniques previously employed for stationary sequences to…
The Wasserstein barycenter problem seeks a probability measure that minimizes the weighted average of the Wasserstein distances to a given collection of probability measures. We study the discrete setting, where each measure has finite…
We consider a sequence of identically independently distributed random samples from an absolutely continuous probability measure in one dimension with unbounded density. We establish a new rate of convergence of the $\infty-$Wasserstein…
In this paper we identify the Fokker-Planck equation for (reflected) Sticky Brownian Motion as a Wasserstein gradient flow in the space of probability measures. The driving functional is the relative entropy with respect to a non-standard…
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…
The Wasserstein barycenter extends the Euclidean mean to the space of probability measures by minimizing the weighted sum of squared 2-Wasserstein distances. We develop a free-support algorithm for computing Wasserstein barycenters that…
The goal of scenario reduction is to approximate a given discrete distribution with another discrete distribution that has fewer atoms. We distinguish continuous scenario reduction, where the new atoms may be chosen freely, and discrete…
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 use Stein's method to bound the Wasserstein distance of order $2$ between a measure $\nu$ and the Gaussian measure using a stochastic process $(X_t)_{t \geq 0}$ such that $X_t$ is drawn from $\nu$ for any $t > 0$. If the stochastic…