Related papers: Regularity for the optimal transportation problem …
We shall present a measure theoretical approach for which together with the Kantorovich duality provide an efficient tool to study the optimal transport problem. Specifically, we study the support of optimal plans where the cost function…
We prove stable versions of trace theorems on the sphere in $L^2$ with optimal constants, thus obtaining rather precise information regarding near-extremisers. We also obtain stability for the trace theorem into $L^q$ for $q > 2$, by…
Optimal packing of spheres in $\mathbb R^d$ is studied by optimization of the energy $E$ (effective conductivity) of composites with ideally conducting spherical inclusions. It is demonstrated that the minimum of $E$ over locations of…
The Gromov--Wasserstein problem is a non-convex optimization problem over the polytope of transportation plans between two probability measures supported on two spaces, each equipped with a cost function evaluating similarities between…
Consider the problem of optimally matching two measures on the circle, or equivalently two periodic measures on the real line, and suppose the cost of matching two points satisfies the Monge condition. We introduce a notion of locally…
We revisit the duality theorem for multimarginal optimal transportation problems. In particular, we focus on the Coulomb cost. We use a discrete approximation to prove equality of the extremal values and some careful estimates of the…
We adapt ideas and concepts developed in optimal transport (and its martingale variant) to give a geometric description of optimal stopping times of Brownian motion subject to the constraint that the distribution of the stopping time is a…
We approximate the regular solutions of the incompressible Euler equation by the solution of ODEs on finite-dimensional spaces. Our approach combines Arnold's interpretation of the solution of Euler's equation for incompressible and…
We consider the random Euclidean assignment problem on the line between two sets of $N$ random points, independently generated with the same probability density function $\varrho$. The cost of the matching is supposed to be dependent on a…
Gangbo and McCann showed that optimal transportation between hypersurfaces generally leads to multivalued optimal maps - bivalent when the target surface is strictly convex. In this paper we quantify H\"older continuity of the bivalent map…
This article focuses on the problem of analytically determining the optimal placement of five points on the unit sphere $\mathbb{S}^2$ so that the surface area of the convex hull of the points is maximized. It is shown that the optimal…
Given a two--dimensional mapping $U$ whose components solve a divergence structure elliptic equation, we give necessary and sufficient conditions on the boundary so that $U$ is a global diffeomorphism.
This article is aimed at presenting the Schr\"odinger problem and some of its connections with optimal transport. We hope that it can be used as a basic user's guide to Schr\"odinger problem. We also give a survey of the related literature.…
We consider cost minimizing stopping time solutions to Skorokhod embedding problems, which deal with transporting a source probability measure to a given target measure through a stopped Brownian process. PDEs and a free boundary problem…
Pathfinding in Euclidean space is a common problem faced in robotics and computer games. For long-distance navigation on the surface of the earth or in outer space however, approximating the geometry as Euclidean can be insufficient for…
We study the stability of entropically regularized optimal transport with respect to the marginals. Lipschitz continuity of the value and H\"older continuity of the optimal coupling in $p$-Wasserstein distance are obtained under general…
The key condition A3w of Ma, Trudinger and Wang for regularity of optimal transportation maps is implied by the nonnegativity of a pseudo-Riemannian curvature -- which we call cross-curvature -- induced by the transportation cost. For the…
In this paper, we study a spline collocation method for a numerical solution to the optimal transport problem We mainly solve the \MAE with the second boundary condition numerically by proposing a center matching algorithm. We prove a…
Semi-discrete transport can be characterized in terms of real-valued shifts. Often, but not always, the solution to the shift-characterized problem partitions the continuous region. This paper gives examples of when partitioning fails, and…
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.