Related papers: Transportation cost spaces and stochastic trees
We study the transportation problem on the unit sphere $S^{n-1}$ for symmetric probability measures and the cost function $c(x,y) = \log \frac{1}{\langle x, y \rangle}$. We calculate the variation of the corresponding Kantorovich functional…
By using Girsanov transformation and martingale representation, Talagrand-type transportation cost inequalities, with respect to both the uniform and the $L^2$ distances on the global free path space, are established for the segment process…
This paper deals with dynamical optimal transport metrics defined by spatial discretisation of the Benamou--Benamou formula for the Kantorovich metric $W_2$. Such metrics appear naturally in discretisations of $W_2$-gradient flow…
We prove that the reconstruction of a certain type of length spaces from their travel time data on a closed subset is Lipschitz stable. The travel time data is the set of distance functions from the entire space, measured on the chosen…
It is shown that if a metric space exhibits certain finiteness and tree-like properties, then elements of its group of bounded displacement which are infinitely divisible are also torsion. This extends a result of N. M. Suchkov, A. A.…
In Optimal Transport (OT) on a finite metric space, one defines a distance on the probability simplex that extends the distance on the ground space. The distance is the value of a Linear Programming (LP) problem on the set of…
The space of metric measure spaces (complete separable metric spaces with a probability measure) is becoming more and more important as state space for stochastic processes. Of particular interest is the subspace of (continuum) metric…
We study projectional skeletons and the Plichko property in Lipschitz-free spaces, relating these concepts to the geometry of the underlying metric space. Specifically, we identify a metric property that characterizes the Plichko property…
We exhibit a surprising relationship between elliptic gradient systems of PDEs, multi-marginal Monge-Kantorovich optimal transport problem, and multivariable Hardy-Littlewood inequalities. We show that the notion of an orientable elliptic…
We consider a generalization of the fundamental online metrical service systems (MSS) problem where the feasible region can be transformed between requests. In this problem, which we call T-MSS, an algorithm maintains a point in a metric…
Consider the Monge-Kantorovich problem of transporting densities $\rho_0$ to $\rho_1$ on $\mathbb{R}^d$ with a strictly convex cost function. A popular relaxation of the problem is the one-parameter family called the entropic cost problem.…
The present paper is the continuation of work [14], devoted to the study of an inviscid zero-Mach number system in the framework of \emph{endpoint} Besov spaces of type $B^s_{\infty,r}(\mathbb{R}^d)$, $r\in [1,\infty]$, $d\geq 2$, which can…
In the optimal partial transport problem, one is asked to transport a fraction $0<m \leq \min\{||f||_{L^1}, ||g||_{L^1}\}$ of the mass of $f=f \chi_\Omega$ onto $g=g\chi_\Lambda$ while minimizing a transportation cost. If $f$ and $g$ are…
This paper analyzes the Lipschitz behavior of the feasible set in two parametric settings, associated with linear and convex systems in R^n. To start with, we deal with the parameter space of linear (finite/semi-infinite) systems identified…
We study the optimal transport problem on globally hyperbolic spacetimes associated with Orlicz-type Lorentzian cost functions of the form $u \circ \ell$, where $u$ is a suitable monotonically increasing and concave function, and $\ell$ is…
We observe that embeddings into random metrics can be fruitfully used to study the $L_1$-embeddability of lamplighter graphs or groups, and more generally lamplighter metric spaces. Once this connection has been established, several new…
We investigate the approximation of Monge--Kantorovich problems on general compact metric spaces, showing that optimal values, plans and maps can be effectively approximated via a fully discrete method. First we approximate optimal values…
This paper is devoted to variational problems on the set of probability measures which involve optimal transport between unequal dimensional spaces. In particular, we study the minimization of a functional consisting of the sum of a term…
Optimal transport provides a metric which quantifies the dissimilarity between probability measures. For measures supported in discrete metric spaces, finding the optimal transport distance has cubic time complexity in the size of the…
In this paper, we investigate Monge-Kantorovich problems for which the absolute continuity of marginals is relaxed. For $X,Y\subseteq\mathbb{R}^{n+1}$ let $(X,\mathcal{B}_X,\mu)$ and $(Y,\mathcal{B}_Y,\nu)$ be two Borel probability spaces,…