Related papers: On the Uniqueness of Kantorovich Potentials
Many biological systems are observed through heterogeneous modalities, requiring transport models that couple dynamics across spaces while allowing mass variation. To address this challenge, we introduce Unbalanced Synchronized Optimal…
In this paper, we establish a regularity theory for the optimal transport problem when the target is composed of two disjoint convex domains. This is an important model in which singularities arise. Even though the singular set does not…
We shall prove new contraction properties of general transportation costs along nonnegative measure-valued solutions to Fokker-Planck equations in $R^d$, when the drift is a monotone (or $\lambda$-monotone) operator. A new duality approach…
The distance and divergence of the probability measures play a central role in statistics, machine learning, and many other related fields. The Wasserstein distance has received much attention in recent years because of its distinctions…
We prove a quantitative stability of Kantorovich potentials on metric measure spaces with lower Ricci curvature bound, thereby confirming a recent conjecture of Kitagawa, Letrouit and M\'erigot. Our proof, which employs the heat…
In this note, we propose polynomial-time algorithms solving the Monge and Kantorovich formulations of the $\infty$-optimal transport problem in the discrete and finite setting. It is the first time, to the best of our knowledge, that…
The presentation covers prerequisite results from Topology and Measure Theory. This is then followed by an introduction into couplings and basic definitions for optimal transport. The Kantrorovich problem is then introduced and an existence…
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…
The duality theory of the Monge--Kantorovich transport problem is analyzed in a general setting. The spaces $X, Y$ are assumed to be polish and equipped with Borel probability measures $\mu$ and $\nu$. The transport cost function $c:X\times…
We prove an inequality on the Kantorovich-Rubinstein distance --which can be seen as a particular case of a Wasserstein metric-- between two solutions of the spatially homogeneous Boltzmann equation without angular cutoff, but with a…
Given two compact metric spaces $X$ and $Y$, a Lipschitz continuous cost function $c$ on $X \times Y$ and two probabilities $\mu \in\mathcal{P}(X),\,\nu\in\mathcal{P}(Y)$, we propose to study the Monge-Kantorovich problem and its duality…
We present generalized versions of Monge's and Kantorovich's optimal transport problems with the probabilities being transported replaced by lower probabilities. We show that, when the lower probabilities are the lower envelopes of…
In this article we show how ideas, methods and results from optimal transportation can be used to study various aspects of the stationary measuresof Iterated Function Systems equipped with a probability distribution. We recover a classical…
In this work, we show the intrinsic relations between optimal transportation and convex geometry, especially the variational approach to solve Alexandrov problem: constructing a convex polytope with prescribed face normals and volumes. This…
We prove that $c$-cyclically monotone transport plans $\pi$ optimize the Monge-Kantorovich transportation problem under an additional measurability condition. This measurability condition is always satisfied for finitely valued, lower…
We consider an optimal transport problem between laws of random probability measures: given a base cost function, we build the associated OT cost between probability measures that in turn we use to define the OT cost between probability…
The optimal transport problem is studied in the context of Lorentz-Finsler geometry. For globally hyperbolic Lorentz-Finsler spacetimes the first Kantorovich problem and the Monge problem are solved. Further the intermediate regularity of…
Linear transfers between probability distributions were introduced in [5,6] in order to extend the theory of optimal mass transportation while preserving the important duality established by Kantorovich. It is shown here that $\{0,…
The classical problem of optimal transportation can be formulated as a linear optimization problem on a convex domain: among all joint measures with fixed marginals find the optimal one, where optimality is measured against a cost function.…
We suggest a new way of defining optimal transport of positive-semidefinite matrix-valued measures. It is inspired by a recent rendering of the incompressible Euler equations and related conservative systems as concave maximization…