Related papers: Multi-marginal Entropy-Transport with repulsive co…
In this work, we develop a new framework for dynamic network flow problems based on optimal transport theory. We show that the dynamic multi-commodity minimum-cost network flow problem can be formulated as a multi-marginal optimal transport…
This note exposes the differential topology and geometry underlying some of the basic phenomena of optimal transportation. It surveys basic questions concerning Monge maps and Kantorovich measures: existence and regularity of the former,…
We determine the optimal structure of couplings for the \emph{Martingale transport problem} between radially symmetric initial and terminal laws $\mu, \nu$ on $\R^d$ and show the uniqueness of optimizer. Here optimality means that such…
An adaptive, adversarial methodology is developed for the optimal transport problem between two distributions $\mu$ and $\nu$, known only through a finite set of independent samples $(x_i)_{i=1..N}$ and $(y_j)_{j=1..M}$. The methodology…
We develop a transport-entropy framework for Gaussian concentration inequalities on the infinite product space $S^{\mathbb Z^d}$, where $S$ is a finite set, in which sensitivity is measured by the $\ell^2$-norm of local oscillations. We…
We consider the problem of optimal transportation with quadratic cost between a empirical measure and a general target probability on R d , with d $\ge$ 1. We provide new results on the uniqueness and stability of the associated optimal…
This chapter describes techniques for the numerical resolution of optimal transport problems. We will consider several discretizations of these problems, and we will put a strong focus on the mathematical analysis of the algorithms to solve…
A new pairwise cost function is proposed for the optimal transport barycenter problem, adopting the form of the minimal action between two points, with a Lagrangian that takes into account an underlying probability distribution. Under this…
We develop a general condition on the cost function which is sufficient to imply Monge solution and uniqueness results in the multi-marginal optimal transport problem. This result unifies and generalizes several results in the rather…
The Monge-Kantorovich problem is revisited by means of a variant of the saddle-point method without appealing to $c$-conjugates. A new abstract characterization of the optimal plans is obtained in the case where the cost function takes…
Classical entropy regularization is poorly suited to continuous-time martingale transport, since relative entropy between diffusion laws typically forces their volatility characteristics to coincide. We introduce a specific-entropy…
The aim of the present paper is to extend Kantorovich's mass transport problem to the framework of upper/lower continuous capacities and to prove the cyclic monotonicity of the supports of optimal supermodular plans. As in the probabilistic…
It is known that the Azema-Yor solution to the Skorokhod embedding problem maximizes the law of the running maximum of an uniformly integrable martingale with given terminal value distribution. Recently this optimality property has been…
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…
We prove an equivalence between the classical equations of motion governing vacuum gravity compactifications (and more general warped-product spacetimes) and a concavity property of entropy under time evolution. This is obtained by linking…
We present a minimization problem with a horizontal divergence-type constraint in the Heisenberg group. Our study explores its dual formulation and examines its relationship with the congested optimal transport problem, for $1 < p <…
Optimization problems on probability measures in $\mathbb{R}^d$ are considered where the cost functional involves multi-marginal optimal transport. In a model of $N$ interacting particles, like in Density Functional Theory, the interaction…
We consider Monge-Kantorovich optimal transport problems on $\mathbb{R}^d$, $d\ge 1$, with a convex cost function given by the cumulant generating function of a probability measure. Examples include the Wasserstein-2 transport whose cost…
We introduce the \emph{transport energy} functional $\mathcal E$ (a variant of the Bouchitt\'e-Buttazzo-Seppecher shape optimization functional) and we prove that its unique minimizer is the optimal transport density $\mu^*$, i.e., the…
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…