Related papers: The Directional Optimal Transport
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…
In this paper we develop a boundary $\varepsilon$-regularity theory for optimal transport maps between bounded open sets with $C^{1,\alpha}$-boundary. Our main result asserts sharp $C^{1,\alpha}$-regularity of transport maps at the boundary…
Coupling probability measures lies at the core of many problems in statistics and machine learning, from domain adaptation to transfer learning and causal inference. Yet, even when restricted to deterministic transports, such couplings are…
This article generalizes the study of ramified optimal transport with capacity constraint in transport multi-paths by generalizing the $\mathbf{M}_{\alpha}$ cost to $\mathbf{M}_{\alpha,c}$, which incorporates capacity constraints into the…
We study an optimal transport problem with a backward martingale constraint in a pseudo-Euclidean space $S$. We show that the dual problem consists in the minimization of the expected values of the Fitzpatrick functions associated with…
In the classical Monge-Kantorovich problem, the transportation cost only depends on the amount of mass sent from sources to destinations and not on the paths followed by this mass. Thus, it does not allow for congestion effects. Using the…
In this paper, we introduce a variant of optimal transport adapted to the causal structure given by an underlying directed graph $G$. Different graph structures lead to different specifications of the optimal transport problem. For…
We study a multi-marginal optimal transportation problem with a cost function of the form $c(x_{1}, \ldots,x_{m})=\sum_{k=1}^{m-1}|x_{k}-x_{k+1}|^{2} + |x_{m}- F(x_{1})|^{2}$, where $F: \mathbb{R}^n \rightarrow \mathbb{R}^n$. When $m=4$,…
It is well known that martingale transport plans between marginals $\mu\neq\nu$ are never given by Monge maps -- with the understanding that the map is over the first marginal $\mu$, or forward in time. Here, we change the perspective, with…
We study the small-regularisation limit of the entropic optimal transport problem on the line with distance cost. While convergence of entropic minimizers is well understood in the discrete setting and in the case where the cost is…
We consider the model of a transportation problem with the objective of finding a minimum-cost transportation plan for shipping a given commodity from a set of supply centers to the customers. Since the exact values of supply and demand and…
We give a characterization of optimal transport plans for a variant of the usual quadratic transport cost introduced in [33]. Optimal plans are composition of a deterministic transport given by the gradient of a continuously differentiable…
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 investigate the minimum cost of a wide class of combinatorial optimization problems over random bipartite geometric graphs in $\mathbb{R}^d$ where the edge cost between two points is given by a $p$-th power of their Euclidean distance.…
We study the inverse optimal transport problem of recovering the ground cost from an optimal transport plan. In discrete settings, this problem reduces to inverse linear programming and is intrinsically ill-posed, exhibiting…
We investigate metric conditions that allow to prove existence and uniqueness of a map solving the Monge problem between two marginals in a metric (measure) space, proving two main results. Firstly, we introduce a nonsmooth version of the…
We introduce a new technique, which we call the boundary method, for solving semi-discrete optimal transport problems with a wide range of cost functions. The boundary method reduces the effective dimension of the problem, thus improving…
We study the convergence of divergence-regularized optimal transport as the regularization parameter vanishes. Sharp rates for general divergences including relative entropy or $L^{p}$ regularization, general transport costs and…
We prove that for two-marginal optimal transport with Coulomb cost, the optimal map is a $C^{1,\alpha}$ diffeomorphism outside a closed set of Lebesgue measure zero provided the marginals are $\alpha$-H\"older continuous and bounded away…
We focus on Optimal Transport PDE on the unit sphere $\mathbb{S}^2$ with a particular type of cost function $c(x,y) = F(x \cdot y, x \cdot \hat{e}, y \cdot \hat{e})$ which we call cost functions with preferential direction, where $\hat{e}…