Related papers: Various issues around the L1-norm distance
(To appear in The American Statistician.) Distance covariance (Sz\'ekely, Rizzo, and Bakirov, 2007) is a fascinating recent notion, which is popular as a test for dependence of any type between random variables $X$ and $Y$. This approach…
Optimal transportation distances are valuable for comparing and analyzing probability distributions, but larger-scale computational techniques for the theoretically favorable quadratic case are limited to smooth domains or regularized…
In this paper, we study the optimal transport problem induced by separable cost functions. In this framework, transportation can be expressed as the composition of two lower-dimensional movements. Through this reformulation, we prove that…
This paper studies best finitely supported approximations of one-dimensional probability measures with respect to the $L^r$-Kantorovich (or transport) distance, where either the locations or the weights of the approximations' atoms are…
We establish the validity of asymptotic limits for the general transportation problem between random i.i.d. points and their common distribution, with respect to the squared Euclidean distance cost, in any dimension larger than three.…
The scope of this note is to make a self-contained survey of the recent developments and achievements of the theory of L1-Optimal Transportation on metric measure spaces. Among the results proved in the recent papers [20, 21] where the…
The aim of this paper is to prove an inequality between relative entropy and the sum of average conditional relative entropies of the following form: For a fixed probability measure $q^n$ on $\mathcal X^n$, ($\mathcal X$ is a finite set),…
In this paper, we propose a novel Euclidean-distance-based coefficient, named differential distance correlation, to measure the strength of dependence between a random variable $ Y \in \mathbb{R} $ and a random vector $ \boldsymbol{X} \in…
We investigate the optimal transport problem between probability measures when the underlying cost function is understood to satisfy a least action principle, also known as a Lagrangian cost. These generalizations are useful when connecting…
Measuring dependence between random variables is a fundamental problem in Statistics, with applications across diverse fields. While classical measures such as Pearson's correlation have been widely used for over a century, they have…
Divergences, also known as contrast functions, are distance-like quantities defined on manifolds of non-negative or probability measures. Using the duality in optimal transport, we introduce and study the one-parameter family of $L^{(\pm…
Optimal transport and Wasserstein distances are flourishing in many scientific fields as a means for comparing and connecting random structures. Here we pioneer the use of an optimal transport distance between L\'{e}vy measures to solve a…
This note reviews the studies of the last decades emphasizing a common principle based on entropy, logarithmic Sobolev inequality and hypercontractivity, behind four most celebrated inequalities by M. Talagrand: the convex distance…
We study the entropic regularization of the optimal transport problem in dimension 1 when the cost function is the distance c(x, y) = |y -- x|. The selected plan at the limit is, among those which are optimal for the non-penalized problem,…
This article assesses the distance between the laws of stochastic differential equations with multiplicative L\'evy noise on path space in terms of their characteristics. The notion of transportation distance on the set of L\'evy kernels…
We introduce a constrained optimal transport problem where origins $x$ can only be transported to destinations $y\geq x$. Our statistical motivation is to describe the sharp upper bound for the variance of the treatment effect $Y-X$ given…
We present a unified approach to improved $L^p$ Hardy inequalities in $\R^N$. We consider Hardy potentials that involve either the distance from a point, or the distance from the boundary, or even the intermediate case where distance is…
In the literature, there have been several methods and definitions for working out if two theories are "equivalent" (essentially the same) or not. In this article, we do something subtler. We provide means to measure distances (and explore…
We first give a characterization of the L^1-transportation cost-information inequality on a metric space and next find some appropriate sufficient condition to transportation cost-information inequalities for dependent sequences.…
A probabilistic method for solving the Monge-Kantorovich mass transport problem on $R^d$ is introduced. A system of empirical measures of independent particles is built in such a way that it obeys a doubly indexed large deviation principle…