Related papers: On global H\"older estimates for optimal transport…
Optimal transport is a powerful framework for computing distances between probability distributions. We unify the two main approaches to optimal transport, namely Monge-Kantorovitch and Sinkhorn-Cuturi, into what we define as Tsallis…
Let $\mu$ and $\nu$ be probability measures on $\mathbb{R}$ with compact support, and let $\mu \boxplus \nu$ denote their additive free convolution. We show that for $z \in \mathbb{R}$ greater than the sum of essential suprema of $\mu$ and…
In this note, we propose a probabilistic approach to bound the (dimension-free) Lipschitz constant of the Langevin flow map on $\mathbb{R}^d$ introduced by Kim and Milman (2012). As example of application, we construct Lipschitz maps from a…
We develop a new method based on Caffarelli's contraction theorem in optimal transport to obtain sharp and uniform modulus of continuity estimates for $\beta$-Dyson Brownian motions with $\beta \geq 2$. Our method extends to a large class…
In order to circumvent the difficulties in solving numerically the discrete optimal transport problem, in which one minimizes the linear target function $P\mapsto\langle C,P\rangle:=\sum_{i,j}C_{ij}P_{ij}$, Cuturi introduced a variant of…
We rephrase Monge's optimal transportation (OT) problem with quadratic cost--via a Monge-Amp\`ere equation--as an infinite-dimensional optimization problem, which is in fact a convex problem when the target is a log-concave measure with…
In this paper, we propose image restoration models using optimal transport (OT) and total variation regularization. We present theoretical results of the proposed models based on the relations between the dual Lipschitz norm from OT and the…
We prove a nonsmooth implicit function theorem applicable to the zero set of the difference of convex functions. This theorem is explicit and global: it gives a formula representing this zero set as a difference of convex functions which…
Finding meaningful ways to measure the statistical dependency between random variables $\xi$ and $\zeta$ is a timeless statistical endeavor. In recent years, several novel concepts, like the distance covariance, have extended classical…
Caffarelli's contraction theorem states that probability measures with uniformly logconcave densities on R d can be realized as the image of a standard Gaussian measure by a globally Lipschitz transport map. We discuss some counterexamples…
An analogue of the quadratic Wasserstein (or Monge-Kantorovich) distance between Borel probability measures on $\mathbf{R}^d$ has been defined in [F. Golse, C. Mouhot, T. Paul: Commun. Math. Phys. 343 (2015), 165-205] for density operators…
We prove global well-posedness of the fifth-order Korteweg-de Vries equation on the real line for initial data in $H^{-1}(\mathbb{R})$. By comparison, the optimal regularity for well-posedness on the torus is known to be…
Optimal transport is widely used in pure and applied mathematics to find probabilistic solutions to hard combinatorial matching problems. We extend the Wasserstein metric and other elements of optimal transport from the matching of sets to…
We prove that if $\Omega\subset \mathbb{R}^{n+1}$ is a (not necessarily strictly) convex, $C^1$ domain, and $\mu$ and $\bar{\mu}$ are probability measures absolutely continuous with respect to surface measure on $\partial \Omega$, with…
We prove existence of an optimal transport map in the Monge-Kantorovich problem associated to a cost $c(x,y)$ which is not finite everywhere, but coincides with $|x-y|^2$ if the displacement $y-x$ belongs to a given convex set $C$ and it is…
In this paper, we develop a general theory for the transport equation within the framework of Triebel-Lizorkin spaces. We first derive commutator estimates in these spaces, dispensing with the conventional divergence-free condition, via the…
We extend a dimensional upper bound on how much an optimal transport map can degenerate for the quadratic transportation cost, originally due to Caffarelli, to cost functions that satisfy the curvature condition of Ma, Trudinger, and Wang.
We generalize known results on transport equations associated to a Lipschitz field $\mathbf{F}$ on some subspace of $\mathbb{R}^N$ endowed with some general space measure $\mu$. We provide a new definition of both the transport operator and…
Many problems in machine learning involve calculating correspondences between sets of objects, such as point clouds or images. Discrete optimal transport provides a natural and successful approach to such tasks whenever the two sets of…
This is the first part of a general description in terms of mass transport for time-evolving interacting particles systems, at a mesoscopic level. Beyond kinetic theory, our framework naturally applies in biology, computer vision, and…