相关论文: H\"older continuity and injectivity of optimal map…

The dynamical formulation of optimal transport, also known as Benamou-Brenier formulation or Computational Fluid Dynamics formulation, amounts to write the optimal transport problem as the optimization of a convex functional under a PDE…

We propose a numerical method to find the optimal transport map between a measure supported on a lower-dimensional subset of R^d and a finitely supported measure. More precisely, the source measure is assumed to be supported on a simplex…

Let $(X,d,m)$ be a proper, non-branching, metric measure space. We show existence and uniqueness of optimal transport maps for cost written as non-decreasing and strictly convex functions of the distance, provided $(X,d,m)$ satisfies a new…

Given a smooth Riemannian manifold $(M,g)$, compact and without boundary, we analyze the dynamical optimal mass transport problem where the cost is given by the sum of the kinetic energy and the relative entropy with respect to a reference…

Fix probability densities $f$ and $g$ on open sets $X \subset \mathbf{R}^m$ and $Y \subset \mathbf{R}^n$ with $m\ge n\ge1$. Consider transporting $f$ onto $g$ so as to minimize the cost $-s(x,y)$. We give a non-degeneracy condition (a) on…

Using the dual formulation only, we show that the regularity of unbalanced optimal transport also called entropy-transport inherits from the regularity of standard optimal transport. We provide detailed examples of Riemannian manifolds and…

We prove a pointwise $C^{2,\,\alpha}$ estimate for the potential of the optimal transport map in the case that the densities are only close to constant in a certain $L^p$ sense.

Building on the results of Ma, Trudinger and Wang \cite{MTW}, and of the author \cite{L5}, we study two problems of optimal transportation on the sphere: the first corresponds to the cost function $d^2(x,y)$, where $d(\cdot,\cdot)$ is the…

Replacing positivity constraints by an entropy barrier is popular to approximate solutions of linear programs. In the special case of the optimal transport problem, this technique dates back to the early work of Schr\"odinger. This approach…

This paper slightly improves a classical result by Gangbo and McCann (1996) about the structure of optimal transport plans for costs that are concave functions of the Euclidean distance. Since the main difficulty for proving the existence…

We present a self-contained analysis of a particular family of metrics over the set of non-negative integers. We show that these metrics, which are defined through a nested sequence of optimal transport problems, provide tight estimates for…

Let $M,N$ be two smooth compact hypersurfaces of $\mathbb{R}^n$ which bound strictly convex domains equipped with two absolutely continuous measures $\mu$ and $\nu$ (with respect to the volume measures of $M$ and $N$). We consider the…

Contraction properties of transport maps between probability measures play an important role in the theory of functional inequalities. The actual construction of such maps, however, is a non-trivial task and, so far, relies mostly on the…

We consider an optimal transport problem on the unit simplex whose solutions are given by gradients of exponentially concave functions and prove two main results. First, we show that the optimal transport is the large deviation limit of a…

The optimal transport map between the standard Gaussian measure and an $\alpha$-strongly log-concave probability measure is $\alpha^{-1/2}$-Lipschitz, as first observed in a celebrated theorem of Caffarelli. In this paper, we apply two…

We introduce an optimal transport topology on the space of probability measures over a fiber bundle, which penalizes the transport cost from one fiber to another. For simplicity, we illustrate our construction in the Euclidean case…

In this paper, we want to establish some general results in the Lorentzian optimal transport theory that have well-known Riemannian counterparts. As a first result, we will provide non-trivial assumptions on the measures to ensure strong…

We study the convergence of the transport plans $\gamma_\epsilon$ towards $\gamma_0$ as well as the cost of the entropy-regularized optimal transport $(c,\gamma_\epsilon)$ towards $(c,\gamma_0)$ as the regularization parameter $\epsilon$…

We study the most common image and informal description of the optimal transport problem for quadratic cost, also known as the second boundary value problem for the Monge--Amp\`{e}re equation -- What is the most efficient way to fill a hole…

Let $A \subset \mathbb{R}^d$, $d\ge 2$, be a compact convex set and let $\mu = \varrho_0 dx$ be a probability measure on $A$ equivalent to the restriction of Lebesgue measure. Let $\nu = \varrho_1 dx$ be a probability measure on $B_r :=…