Related papers: Partial regularity for optimal transport with p-co…
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…
A general theory is provided delivering convergence of maximal cyclically monotone mappings containing the supports of coupling measures of sequences of pairs of possibly random probability measures on Euclidean space. The theory is based…
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 study the vanishing-regularization limit of entropically regularized optimal transport (EOT) for the Euclidean distance cost $c(x,y)=\|x-y\|$ in dimension $d>1$. We develop a comprehensive variational convergence framework that entails…
In this paper we prove a partial $C^{1,\alpha}$ regularity result in dimension $N=2$ for the optimal $p$-compliance problem, extending for $p\not = 2$ some of the results obtained by A. Chambolle, J. Lamboley, A. Lemenant, E. Stepanov…
Optimal transport and its related problems, including optimal partial transport, have proven to be valuable tools in machine learning for computing meaningful distances between probability or positive measures. This success has led to a…
We demonstrate an iterative scheme to approximate the optimal transportation problem with a discrete target measure under certain standard conditions on the cost function. Additionally, we give a finite upper bound on the number of…
We consider the Monge-Kantorovich transport problem in a purely measure theoretic setting, i.e. without imposing continuity assumptions on the cost function. It is known that transport plans which are concentrated on c-monotone sets are…
We address the problem of optimal transport with a quadratic cost functional and a constraint on the flux through a constriction along the path. The constriction, conceptually represented by a toll station, limits the flow rate across. We…
In this paper, we consider the Monge optimal transport problem with distance cost. We prove that in some metric spaces, possibly with many branching geodesics, an optimal transport map exists if the first marginal is absolutely continuous.…
We study the optimal transport between two probability measures on the real line, where the transport plans are laws of one-step martingales. A quasi-sure formulation of the dual problem is introduced and shown to yield a complete duality…
In this paper, we prove existence of $L^p$-optimal transport maps with $p \in (1,\infty)$ in a class of branching metric spaces defined on $\mathbb{R}^N$. In particular, we introduce the notion of cylinder-like convex function and we prove…
For cost functions $c(x,y)=h(x-y)$ with $h\in C^2$ homogeneous of degree $p\geq 2$, we show $L^\infty$-estimates of $Tx-x$ on balls, where $T$ is an $h$-monotone map. Estimates for the interpolating mappings $T_t=t(T-I)+I$ are deduced from…
Entropy regularized optimal transport and its multi-marginal generalization have attracted increasing attention in various applications, in particular due to efficient Sinkhorn-like algorithms for computing optimal transport plans. However,…
We establish that solving an optimal transportation problem in which the source and target densities are defined on manifolds with different dimensions, is equivalent to solving a new nonlocal analog of the Monge-Amp\`ere equation,…
Optimal transport is the problem of designing a joint distribution for two random variables with fixed marginals. In virtually the entire literature on this topic, the objective is to minimize expected cost. This paper is the first to study…
Optimal transportation problem seeks for a coupling $\pi$ of two probability measures $\mu$ and $\nu$ which minimize the total cost $\int c d\pi$, which is linear in $\pi$. In this paper, we introduce a variation of optimal transportation…
We study the semi-discrete formulation of one-dimensional partial optimal transport with quadratic cost, where a probability density is partially transported to a finite sum of Dirac masses of smaller total mass. This problem arises…
In this paper we consider the mass transport problem in the case of a relativistic cost; we can establish the continuity of the total cost, together with a general estimate about the directions in which the mass can actually move, under…
A fundamental concept in optimal transport is c-cyclical monotonicity: it allows to link the optimality of transport plans to the geometry of their support sets. Recently, related concepts have been successfully applied in the…