Related papers: On quantitative bounds in the mean martingale cent…
Stein's method has been widely used for probability approximations. However, in the multi-dimensional setting, most of the results are for multivariate normal approximation or for test functions with bounded second- or higher-order…
In this article, we generalize the Wasserstein distance to measures with different masses. We study the properties of such distance. In particular, we show that it metrizes weak convergence for tight sequences. We use this generalized…
In this article, we derive Stein's method for approximating a spatial random graph by a generalised random geometric graph, which has vertices given by a finite Gibbs point process and edges based on a general connection function. Our main…
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…
We extend Stein's celebrated Wasserstein bound for normal approximation via exchangeable pairs to the multi-dimensional setting. As an intermediate step, we exploit the symmetry of exchangeable pairs to obtain an error bound for smooth test…
Let $M$ be a connected compact Riemannian manifold possibly with a boundary, let $V\in C^2(M)$ such that $\mu(\d x):=\e^{V(x)}\d x$ is a probability measure, where $\d x$ is the volume measure, and let $L=\Delta+\nabla V$. The exact…
The primary choice to summarize a finite collection of random objects is by using measures of central tendency, such as mean and median. In the field of optimal transport, the Wasserstein barycenter corresponds to the Fr\'{e}chet or…
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…
We study the discretization of generalized Wasserstein distances with nonlinear mobilities on the real line via suitable discrete metrics on the cone of N ordered particles, a setting which naturally appears in the framework of…
We establish upper bounds for the expected $p$-th power of the Gaussian-smoothed $p$-Wasserstein distance between a probability measure $\mu$ and the corresponding empirical measure $\mu_N$, whenever $\mu$ has finite $q$-th moment for some…
The Wasserstein distance between two probability measures on a metric space is a measure of closeness with applications in statistics, probability, and machine learning. In this work, we consider the fundamental question of how quickly the…
Wasserstein distances are metrics on probability distributions inspired by the problem of optimal mass transportation. Roughly speaking, they measure the minimal effort required to reconfigure the probability mass of one distribution in…
We introduce methods to bound the mean of a discrete distribution (or finite population) based on sample data, for random variables with a known set of possible values. In particular, the methods can be applied to categorical data with…
The concentration of measure phenomenon may be summarized as follows: a function of many weakly dependent random variables that is not too sensitive to any of its individual arguments will tend to take values very close to its expectation.…
In this paper, we prove a central limit theorem and estabilish a moderate deviation principle for stochastic models of incompressible second fluids. The weak convergence method inreoduced by [4] plays an important role.
This work is devoted to the Lipschitz contraction and the long time behavior of certain Markov processes. These processes diffuse and jump. They can represent some natural phenomena like size of cell or data transmission over the Internet.…
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…
We study nonparametric density estimation problems where error is measured in the Wasserstein distance, a metric on probability distributions popular in many areas of statistics and machine learning. We give the first minimax-optimal rates…
In this paper, we introduce a generalization of the Wasserstein barycenter, to a case where the initial probability measures live on different subspaces of R^d. We study the existence and uniqueness of this barycenter, we show how it is…
Multi-marginal optimal transport enables one to compare multiple probability measures, which increasingly finds application in multi-task learning problems. One practical limitation of multi-marginal transport is computational scalability…