相关论文: $\mathcal{W}_\infty$-transport with discrete targe…
In this paper, we prove a structure theorem for discrete optimal transportation plans. We show that, given any pair of discrete probability measures and a cost function, there exists an optimal transportation plan that can be expressed as…
We study optimal mass transport problems between two measures with respect to a non-traditional cost function, i.e. a cost $c$ which can attain the value $+\infty$. We define the notion of $c$-compatibility and strong-$c$-compatibility of…
We consider the optimal mass transportation problem in $\RR^d$ with measurably parameterized marginals, for general cost functions and under conditions ensuring the existence of a unique optimal transport map. We prove a joint measurability…
We are interested in the Wasserstein distance between two probability measures on $\R^n$ sharing the same copula $C$. The image of the probability measure $dC$ by the vectors of pseudo-inverses of marginal distributions is a natural…
We study the convergence of the transport plans $\gamma_\epsilon$ towards $\gamma_0$ as well as the cost of the entropy-regularized optimal transport $(c,\gamma_\epsilon)$ towards $(c,\gamma_0)$ as the regularization parameter $\epsilon$…
We consider optimal transportation of measures on metric and topological spaces in the case where the cost function and marginal distributions depend on a parameter with values in a metric space. The Hausdorff distance between the sets of…
Coupling probability measures lies at the core of many problems in statistics and machine learning, from domain adaptation to transfer learning and causal inference. Yet, even when restricted to deterministic transports, such couplings are…
We consider the Monge problem of optimal transport between a compactly supported source measure and a target probability measure with unbounded support. We consider the convergence of optimal maps and potential functions when the target…
Optimal transport is widely used in pure and applied mathematics to find probabilistic solutions to hard combinatorial matching problems. We extend the Wasserstein metric and other elements of optimal transport from the matching of sets to…
We investigate the minimum cost of a wide class of combinatorial optimization problems over random bipartite geometric graphs in $\mathbb{R}^d$ where the edge cost between two points is given by a $p$-th power of their Euclidean distance.…
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 show that in any complete metric space the probability measures $\mu$ with compact and connected support are the ones having the property that the optimal tranportation distance to any other probability measure $\nu$ living on the…
In this work, we investigate an optimization problem over adapted couplings between pairs of real valued random variables, possibly describing random times. We relate those couplings to a specific class of causal transport plans between…
We show that, on a $2$-dimensional compact manifold, the optimal transport map in the semi-discrete random matching problem is well-approximated in the $L^2$-norm by identity plus the gradient of the solution to the Poisson problem $-\Delta…
We study couplings $q^\bullet$ of two equivariant random measures $\lambda^\bullet$ and $\mu^\bullet$ on a Riemannian manifold $(M,d,m)$. Given a cost function we ask for minimizers of the mean transportation cost per volume. In case the…
This paper is devoted to the study of couplings of the Lebesgue measure and the Poisson point process. We prove existence and uniqueness of an optimal coupling whenever the asymptotic mean transportation cost is finite. Moreover, we give…
We present a discretization of the dynamic optimal transport problem for which we can obtain the convergence rate for the value of the transport cost to its continuous value when the temporal and spatial stepsize vanish. This convergence…
We consider the Monge-Kantorovich transport problem in an abstract measure theoretic setting. Our main result states that duality holds if $c:X\times Y\to [0,\infty)$ is an arbitrary Borel measurable cost function on the product of Polish…
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 prove that, in the optimal transportation problem with general costs and positive continuous densities, the potential function is always of class $W^{2,p}_{loc}$ for any $p \geq 1$ outside of a closed singular set of measure zero. We…