Related papers: Optimal transport of measures via autonomous vecto…
This paper focuses on martingale optimal transport problems when the martingales are assumed to have bounded quadratic variation. First, we give a result that characterizes the existence of a probability measure satisfying some convex…
We characterise equality cases in matrix H\"older's inequality and develop a divergence formulation of optimal transport of vector measures. As an application, we reprove the representation formula for measures in the polar cone to monotone…
Motivated by the Swampland Distance Conjecture, we study distances in field space using the framework of Optimal Transport. The associated optimisation problem naturally leads to a notion of distance in terms of a (generalised) Wasserstein…
A probabilistic method for solving the Monge-Kantorovich mass transport problem on $R^d$ is introduced. A system of empirical measures of independent particles is built in such a way that it obeys a doubly indexed large deviation principle…
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…
We consider the optimal transport problem over convex costs arising from optimal control of linear time-invariant(LTI) systems when the initial and target measures are assumed to be supported on the set of equilibrium points of the LTI…
In this paper, we study a connection between disintegration of measures and geometric properties of probability spaces. We prove a disintegration theorem, addressing disintegration from the perspective of an optimal transport problem. We…
Numerical methods for the optimal transport problem is an active area of research. Recent work of Kitagawa and Abedin shows that the solution of a time-dependent equation converges exponentially fast as time goes to infinity to the solution…
We formulate and solve a class of finite-time transport and mixing problems in the set-oriented framework. The aim is to obtain optimal discrete-time perturbations in nonlinear dynamical systems to transport a specified initial measure on…
In this paper, we study optimal transportation problems for multifractal random measures. Since these measures are much less regular than optimal transportation theory requires, we introduce a new notion of transportation which is…
The aim of this article is to demonstrate how the vector field method of Klainerman can be adapted to the study of transport equations. After an illustration of the method for the free transport operator, we apply the vector field method to…
Optimal mass transport, also known as the earth mover's problem, is an optimization problem with important applications in various disciplines, including economics, probability theory, fluid dynamics, cosmology and geophysics to cite a few.…
We consider the following variant of the Monge-Kantorovich transportation problem. Let S be a finite set of point sites in d dimensions. A bounded set C in d-dimensional space is to be distributed among the sites p in S such that (i) each p…
The papers describes an easy approach, based on a classical construction by Dacorogna and Moser, to prove that optimal vector fields in some minimal flow problem linked to optimal transport models (congested traffic, branched transport,…
We introduce a new formulation for differential equation describing dynamics of measures on an Euclidean space, that we call Measure Differential Equations with sources. They mix two different phenomena: on one side, a transport-type term,…
Inspired by the matching of supply to demand in logistical problems, the optimal transport (or Monge--Kantorovich) problem involves the matching of probability distributions defined over a geometric domain such as a surface or manifold. In…
A recent paper by Cordero-Erausquin and Klartag provides a characterization of the measures $\mu$ on $\R^d$ which can be expressed as the moment measures of suitable convex functions $u$, i.e. are of the form $(\nabla u)\_\\#e^{- u}$ for…
We investigate the problem of efficiently computing optimal transport (OT) distances, which is equivalent to the node-capacitated minimum cost maximum flow problem in a bipartite graph. We compare runtimes in computing OT distances on data…
Given two n-dimensional measures $\mu$ and $\nu$ on Polish spaces, we propose an optimal transportation's formulation, inspired by classical Kan-torovitch's formulation in the scalar case. In particular, we established a strong duality…
We introduce a stochastic version of the optimal transport problem. We provide an analysis by means of the study of the associated Hamilton-Jacobi-Bellman equation, which is set on the set of probability measures. We introduce a new…