Related papers: Regularity of optimal transportation between space…
The quadratically regularized optimal transport problem has recently been considered in various applications where the coupling needs to be \emph{sparse}, i.e., the density of the coupling needs to be zero for a large subset of the product…
We introduce a new non-linear optimal transport formulation for a pair of probability measures on $\mathbb{R}^d$ sharing a common barycentre, in which admissible transference plans satisfy two martingale-type constraints. This bi-martingale…
Models involving branched structures are employed to describe several supply-demand systems such as the structure of the nerves of a leaf, the system of roots of a tree and the nervous or cardiovascular systems. Given a flow (traffic path)…
In recent years, the use of entropy-regularized optimal transport with $L^p$-type entropies has become increasingly popular. In this setting, the solutions are sparse, in the sense that the support of the regularized optimal coupling,…
The topic of this study lies in the intersection of two fields. One is related with analyzing transport phenomena in complicated flows.For this purpose, we use so-called coherent sets: non-dispersing, possibly moving regions in the flow's…
$c$-cyclical monotonicity is the most important optimality condition for an optimal transport plan. While the proof of necessity is relatively easy, the proof of sufficiency is often more difficult or even elusive. We present here a new…
A basic idea in optimal transport is that optimizers can be characterized through a geometric property of their support sets called cyclical monotonicity. In recent years, similar "monotonicity principles" have found applications in other…
The question of which costs admit unique optimizers in the Monge-Kantorovich problem of optimal transportation between arbitrary probability densities is investigated. For smooth costs and densities on compact manifolds, the only known…
This paper aims at determining under which conditions the semi-discrete optimal transport is twice differentiable with respect to the parameters of the discrete measure and exhibits numerical applications. The discussion focuses on minimal…
We focus on entropy admissible solutions of scalar conservation laws in one space dimension and establish new regularity results with respect to time. First, we assume that the flux function $f$ is strictly convex and show that, for every $…
This paper shows that the semi-dual formulation of the optimal transport problem has a degenerate saddle-point structure, and that its numerical solution is equivalent to solving a constrained optimization problem. We derive necessary and…
The structure of networks that provide optimal transport properties has been investigated in a variety of contexts. While many different formulations of this problem have been considered, it is recurrently found that optimal networks are…
In this article we study convex integer maximization problems with composite objective functions of the form $f(Wx)$, where $f$ is a convex function on $\R^d$ and $W$ is a $d\times n$ matrix with small or binary entries, over finite sets…
The push-forward operation enables one to redistribute a probability measure through a deterministic map. It plays a key role in statistics and optimization: many learning problems (notably from optimal transport, generative modeling, and…
In this paper we are interested in "optimal" universal geometric inequalities involving the area, diameter and inradius of convex bodies. The term "optimal" is to be understood in the following sense: we tackle the issue of…
Optimal transport has recently been brought forward as a tool for modeling and efficiently solving a variety of flow problems, such as origin-destination problems and multi-commodity flow problems. Although the framework has shown to be…
In this work we analyze regularized optimal transport problems in the so-called Kantorovich form, i.e. given two Radon measures on two compact sets, the aim is to find a transport plan, which is another Radon measure on the product of the…
We consider the fundamental problem of sampling the optimal transport coupling between given source and target distributions. In certain cases, the optimal transport plan takes the form of a one-to-one mapping from the source support to the…
The dynamical formulation of optimal transport, also known as Benamou-Brenier formulation or Computational Fluid Dynamics formulation, amounts to write the optimal transport problem as the optimization of a convex functional under a PDE…
We consider the problem of dynamic optimal transport with a density constraint. We derive variational limits in terms of $\Gamma$-convergence for two singular phenomena. First, for densities constrained near a hyperplane we recover the…