Related papers: Partial $W^{2,p}$ regularity for optimal transport…

We consider the problem of optimal transportation with quadratic cost between a empirical measure and a general target probability on R d , with d $\ge$ 1. We provide new results on the uniqueness and stability of the associated optimal…

Optimal transportation problem seeks for a coupling $\pi$ of two probability measures $\mu$ and $\nu$ which minimize the total cost $\int c d\pi$, which is linear in $\pi$. In this paper, we introduce a variation of optimal transportation…

We consider the stochastic transport equation with a possibly unbounded H\"older continuous vector field. Well-posedness is proved, namely, we show existence, uniqueness and strong stability of W^{1,p}-weak solutions.

We consider the optimal transportation problem on a globally hyperbolic spacetime for some cost function $c_2$, which corresponds to the optimal transportation problem on a complete Riemannian manifold where the cost function is the…

In this paper we study two basic facts of optimal transportation on Wiener space W. Our first aim is to answer to the Monge Problem on the Wiener space endowed with the Sobolev type norm (k,gamma) to the power of p (cases p = 1 and p > 1…

In this note, we extend the regularity theory for monotone measure-preserving maps, also known as optimal transports for the quadratic cost optimal transport problem, to the case when the support of the target measure is an arbitrary convex…

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.

In this paper, we prove a structure theorem for discrete optimal transportation plans. We show that, given any pair of discrete probability measures and a cost function, there exists an optimal transportation plan that can be expressed as…

For a finite metric graph $X=(V,E,\ell)$, where $V$ is endowed with the shortest path metric, we consider the transportation cost problem associated with the distance $d$ on $V$. Namely, for $f$ a function with total sum 0 on $V$, write…

The inverse optimal transport problem is to find the underlying cost function from the knowledge of optimal transport plans. While this amounts to solving a linear inverse problem, in this work we will be concerned with the nonlinear…

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 extend the variational approach to regularity for optimal transport maps initiated by Goldman and the first author to the case of general cost functions. Our main result is an $\epsilon$-regularity result for optimal transport maps…

In this paper, we prove existence of $L^p$-optimal transport maps with $p \in (1,\infty)$ in a class of branching metric spaces defined on $\mathbb{R}^N$. In particular, we introduce the notion of cylinder-like convex function and we prove…

We prove a new sample complexity result for divergence regularized optimal transport. Our bound holds for probability measures on~$\mathbb{R}^d$ with exponential tail decay and for radial cost functions that satisfy a local Lipschitz…

This paper deals with the existence of optimal transport maps for some optimal transport problems with a convex but non strictly convex cost. We give a decomposition strategy to address this issue. As part of our strategy, we have to treat…

We study the equivalence between the weighted least gradient problem and the weighted Beckmann minimal flow problem or equivalently, the optimal transport problem with Riemannian cost. Thanks to this equivalence, we prove existence and…

We study optimal mass transport problems between two measures with respect to a non-traditional cost function, i.e. a cost $c$ which can attain the value $+\infty$. We define the notion of $c$-compatibility and strong-$c$-compatibility of…

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 study the entropic regularizations of optimal transport problems under suitable summability assumptions on the point-wise transport cost. These summability assumptions already appear in the literature. However, we show that the weakest…

Weak optimal transport generalizes the classical theory of optimal transportation to nonlinear cost functions and covers a range of problems that lie beyond the traditional theory - including entropic transport, martingale transport, and…