Related papers: Pseudo-Riemannian geometry calibrates optimal tran…
We identify a novel connection between a recently introduced pseudo-Riemannian framework for optimal mass transport and the geometry of Monge-Amp\`ere equations. We show this correspondence by application to an example from geophysical…
We study the optimal transport problem in sub-Riemannian manifolds where the cost function is given by the square of the sub-Riemannian distance. Under appropriate assumptions, we generalize Brenier-McCann's Theorem proving existence and…
Describing shapes by suitable measures in object segmentation, as proposed in [24], allows to combine the advantages of the representations as parametrized contours and indicator functions. The pseudo-Riemannian structure of optimal…
A key inequality which underpins the regularity theory of optimal transport for costs satisfying the Ma--Trudinger--Wang condition is the Pogorelov second derivative bound. This translates to an apriori interior $C^1$ estimate for smooth…
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…
This paper is concerned with the study of the Monge optimal transport problem in sub-Riemannian manifolds where the cost is given by the square of the sub-Riemannian distance. Our aim is to extend previous results on existence and…
We study couplings $q^\bullet$ of two equivariant random measures $\lambda^\bullet$ and $\mu^\bullet$ on a Riemannian manifold $(M,d,m)$. Given a cost function we ask for minimizers of the mean transportation cost per volume. In case the…
We prove quantitative bounds on the stability of optimal transport maps and Kantorovich potentials from a fixed source measure $\rho$ under variations of the target measure $\mu$, when the cost function is the squared Riemannian distance on…
Optimal transport and information geometry both study geometric structures on spaces of probability distributions. Optimal transport characterizes the cost-minimizing movement from one distribution to another, while information geometry…
Let M and \bar M be n-dimensional manifolds equipped with suitable Borel probability measures \rho and \bar\rho. Ma, Trudinger & Wang gave sufficient conditions on a transportation cost c \in C^4(M \times \bar M) to guarantee smoothness of…
We study optimal transportation of measures on compact manifolds for costs defined from convex Lagrangians. We prove that optimal transportation can be interpolated by measured Lipschitz laminations, or geometric currents. The methods are…
Optimal mass transport is described by an approximation of transport cost via semi-discrete costs. The notions of optimal partition and optimal strong partition are given as well. We also suggest an algorithm for computation of Optimal…
Optimal transport is a geometrically intuitive, robust and flexible metric for sample comparison in data analysis and machine learning. Its formal Riemannian structure allows for a local linearization via a tangent space approximation. This…
We study Monge's optimal transportation problem, where the cost is given by optimal control cost. We prove the existence and uniqueness of an optimal map under certain regularity conditions on the Lagrangian, absolute continuity of the…
We consider an optimal transportation problem with more than two marginals. We use a family of semi-Riemannian metrics derived from the mixed, second order partial derivatives of the cost function to provide upper bounds for the dimension…
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…
This article gives an introduction to optimal transport, a mathematical theory that makes it possible to measure distances between functions (or distances between more general objects), to interpolate between objects or to enforce…
We consider the problem of finding an optimal transport plan between an absolutely continuous measure $\mu$ on $\mathcal{X} \subset \mathbb{R}^d$ and a finitely supported measure $\nu$ on $\mathbb{R}^d$ when the transport cost is the…
We generalize the notion of calibrated submanifolds to smooth maps and show that the several examples of smooth maps appearing in the differential geometry become the examples of our situation. Moreover, we apply these notion to give the…
In the geometric transportation problem, we are given a collection of points $P$ in $d$-dimensional Euclidean space, and each point is given a supply of $\mu(p)$ units of mass, where $\mu(p)$ could be a positive or a negative integer, and…