Related papers: Optimal partial transport for metric pairs
We investigate the existence of periodic solutions for a class of nonlocal continuity equations, which include mean-field equations derived from systems of coupled oscillators. While periodic solutions at the particle level have been…
In this paper, we prove that a metric measure space which has at least one open set isometric to an interval, and for which the (possibly non-unique) optimal transport map exists from any absolutely continuous measure to an arbitrary…
A standard way of approximating or discretizing a metric space is by taking its Rips complexes. These approximations for all parameters are often bound together into a filtration, to which we apply the fundamental group or the first…
Let $\Omega\subset \mathbb{R}^n$ be non-empty, open and proper. Consider $Wb(\Omega)$, the space of finite Borel measures on $\Omega$ equipped with the partial transportation metric introduced by Figalli and Gigli that allows the creation…
In the field of optimal transport, two prominent subfields face each other: (i) unregularized optimal transport, "\`a-la-Kantorovich", which leads to extremely sparse plans but with algorithms that scale poorly, and (ii)…
We prove the sharp quantitative stability for a wide class of weighted isoperimetric inequalities. More precisely, we consider isoperimetric inequalities in convex cones with homogeneous weights. Inspired by the proof of such isoperimetric…
We consider the problem of estimating the optimal transport map between two probability distributions, $P$ and $Q$ in $\mathbb R^d$, on the basis of i.i.d. samples. All existing statistical analyses of this problem require the assumption…
Let M and \bar M be n-dimensional manifolds equipped with suitable Borel probability measures \rho and \bar\rho. Ma, Trudinger & Wang gave sufficient conditions on a transportation cost c \in C^4(M \times \bar M) to guarantee smoothness of…
We show that the parallel transport map over a reductive homogeneous space with natural torsion-free connection becomes an affine submersion with horizontal distribution. This generalizes one of the main results in the author's previous…
Using optimal transport we study some dynamical properties of expanding circle maps acting on measures by push-forward. Using the definition of the tangent space to the space of measures introduced by Gigli, their derivative at the unique…
Given a transportation cost $c: M \times\bar M \to\mathbf{R}$, optimal maps minimize the total cost of moving masses from $M$ to $\bar M$. We find a pseudo-metric and a calibration form on $M\times\bar M$ such that the graph of an optimal…
The quadratically regularized optimal transport problem is empirically known to have sparse solutions: its optimal coupling $\pi_{\varepsilon}$ has sparse support for small regularization parameter $\varepsilon$, in contrast to entropic…
In this paper we formulate and analyze a Discontinuous Petrov Galerkin formulation of linear transport equations with variable convection fields. We show that a corresponding {\em infinite dimensional} mesh-dependent variational…
We prove that for two-marginal optimal transport with Coulomb cost, the optimal map is a $C^{1,\alpha}$ diffeomorphism outside a closed set of Lebesgue measure zero provided the marginals are $\alpha$-H\"older continuous and bounded away…
In this paper, we study the optimal transport problem induced by separable cost functions. In this framework, transportation can be expressed as the composition of two lower-dimensional movements. Through this reformulation, we prove that…
Motivated by persistent homology and topological data analysis, we consider formal sums on a metric space with a distinguished subset. These formal sums, which we call persistence diagrams, have a canonical 1-parameter family of metrics…
In this paper we give a new proof of a theorem by Alexandrov on the Gauss curvature prescription of Euclidean convex sets. This proof is based on the duality theory of convex sets and on optimal mass transport. A noteworthy property of this…
We study the optimal transport problem for $d>2$ discrete measures. This is a linear programming problem on $d$-tensors. It gives a way to compute a "distance" between two sets of discrete measures. We introduce an entropic regularization…
In many scientific fields imaging is used to relate a certain physical quantity to other dependent variables. Therefore, images can be considered as a map from a real-world coordinate system to the non-negative measurements being acquired.…
In this article we show how ideas, methods and results from optimal transportation can be used to study various aspects of the stationary measuresof Iterated Function Systems equipped with a probability distribution. We recover a classical…