Related papers: On the Uniqueness of Kantorovich Potentials
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 investigate the anomalous transport in optically-induced potentials that are random in both space and time. We find that the time variation destroys Anderson localization, replacing it by transport that is faster than diffusion, which in…
We prove that two Aleksandrov solutions of a generated prescribed Jacobian equation have the same gradients at points where they are both differentiable. For the optimal transportation case where two solutions can be translated to agree at…
Fix probability densities $f$ and $g$ on open sets $X \subset \mathbf{R}^m$ and $Y \subset \mathbf{R}^n$ with $m\ge n\ge1$. Consider transporting $f$ onto $g$ so as to minimize the cost $-s(x,y)$. We give a non-degeneracy condition (a) on…
A cornerstone of convex analysis, established by Rockafellar in 1966, asserts that a set has a potential if and only if it is cyclically monotone. This characterization was generalized to hold for any real-valued cost function $c$ and lies…
The aim of this article is to show that the Monge-Kantorovich problem is the limit of a sequence of entropy minimization problems when a fluctuation parameter tends down to zero. We prove the convergence of the entropic values to the…
In this paper we study theoretical properties of the entropy-transport functional with repulsive cost functions. We provide sufficient conditions for the existence of a minimizer in a class of metric spaces and prove the…
A remarkable connection between optimal design and Monge transport was initiated in the years 1997 in the context of the minimal elastic compliance problem and where the euclidean metric cost was naturally involved. In this paper we present…
Following [21, 23], the present work investigates a new relative entropy-regularized algorithm for solving the optimal transport on a graph problem within the randomized shortest paths formalism. More precisely, a unit flow is injected into…
Kantorovich distance (or 1-Wasserstein distance) on the probability simplex of a finite metric space is the value of a Linear Programming problem for which a closed-form expression is known in some cases. When the ground distance is defined…
Energy bounds for Kantorovich transport distances are developed for convex cost functions. The main results extend estimates due to M. Ledoux for the Kantorovich distances $W_p$.
In this paper, we investigate the geodesic structure and the associated Kantorovich-type duality for a Benamou-Brenier-type transportation metric defined on the space of nonnegative measures over a finite reversible Markov chain. The metric…
The optimal weak transport problem has recently been introduced by Gozlan et.\ al. We provide general existence and duality results for these problems on arbitrary Polish spaces, as well as a necessary and sufficient optimality criterion in…
The main goal of this exposition is to present further analysis of the Kantorovich and Ando operator inequalities. In particular, a new proof of Ando's inequality is given, a new non-trivial refinement of Kantorovich inequality is shown,…
In the last ten years, full-waveform inversion has emerged as a robust and efficient high-resolution velocity model-building tool for seismic imaging, with the unique ability to recover complex subsurface structures. Originally based on a…
By disintegration of transport plans it is introduced the notion of transport class. This allows to consider the Monge problem as a particular case of the Kantorovich transport problem, once a transport class is fixed. The transport problem…
It is well-known that duality in the Monge-Kantorovich transport problem holds true provided that the cost function $c:X\times Y\to [0,\infty]$ is lower semi-continuous or finitely valued, but it may fail otherwise. We present a suitable…
We study causal optimal transport in continuous time, with Markovian cost, between a finite-state Markov source and a diffusion target. By replacing the source with its conditional law given the observation of the target, we characterize…
We derive nearly tight and non-asymptotic convergence bounds for solutions of entropic semi-discrete optimal transport. These bounds quantify the stability of the dual solutions of the regularized problem (sometimes called Sinkhorn…
We give an alternative proof for the fact that in $n$-dimensional Alexandrov spaces with curvature bounded below there exists a unique optimal transport plan from any purely $(n-1)$-unrectifiable starting measure, and that this plan is…