Related papers: On relations between transportation cost spaces an…
We describe surjective linear isometries and linear isometry groups of a large class of Lipschitz-free spaces that includes e.g. Lipschitz-free spaces over any graph. We define the notion of a Lipschitz-free rigid metric space whose…
Many causal and structural parameters in economics can be identified and estimated by computing the value of an optimization program over all distributions consistent with the model and the data. Existing tools apply when the data is…
This article connects the theory of extremal doubly stochastic measures to the geometry and topology of optimal transportation. We begin by reviewing an old question (# 111) of Birkhoff in probability and statistics [4], which is to give a…
This is a review of selected topics from recent work on symmetry charges in asymptotically flat spacetime done by the author in collaboration with U. Kol and R. Javadinezhad. First we reinterpret the reality constraint on the boundary…
Kantorovich distance (or 1-Wasserstein distance) on the probability simplex of a finite metric space is the value of a Linear Programming problem for which a closed-form expression is known in some cases. When the ground distance is defined…
We show that there is an operator space notion of Lipschitz embeddability between operator spaces which is strictly weaker than its linear counterpart but which is still strong enough to impose linear restrictions on operator space…
We study the Wasserstein (or earthmover) metric on the space $P(X)$ of probability measures on a metric space $X$. We show that, if a finite metric space $X$ embeds stochastically with distortion $D$ in a family of finite metric trees, then…
Associated to any finite metric space are a large number of objects and quantities which provide some degree of structural or geometric information about the space. In this paper we show that in the setting of subsets of weighted Hamming…
Let A be the space of irreducible connections (vector potentials) over a SU(n)-principal bundle on a three-dimensional manifold M. Let T be the fiber product of the tangent and cotangent bundles of A. We endow T with a symplectic structure…
Let $T$ be a compact, metrisable and strongly countable-dimensional topological space. Let $\mathcal{M}^T$ be the set of all metrics $d$ on $T$ compatible with its topology, and equip $\mathcal{M}^T$ with the topology of uniform…
For a smooth manifold $M$, possibly with boundary and corners, and a Lie group $G$, we consider a suitable description of gauge fields in terms of parallel transport, as groupoid homomorphisms from a certain path groupoid in $M$ to $G$.…
Let $X$ be a finite set and $\Omega=\{1,...,d\}^{\mathbb{N}}$ be the Bernoulli space. Denote by $\sigma$ the shift map acting on $\Omega$. For a fixed probability $\mu$ on $X$ with supp($\mu$)$=X$, define $\Pi(\mu,\sigma)$ as the set of all…
The empirical optimal transport (OT) cost between two probability measures from random data is a fundamental quantity in transport based data analysis. In this work, we derive novel guarantees for its convergence rate when the involved…
We show that for every complete metric space $M$ there exists another complete metric space $N$ of the same density character such that the curve-flat quotient of $N$ is isometric to $M$. Moreover, we show that if $M$ is compact and…
Let $\mathcal{R}=(R,\oplus,\leq,0)$ be an algebraic structure, where $\oplus$ is a commutative binary operation with identity $0$, and $\leq$ is a translation-invariant total order with least element $0$. Given a distinguished subset…
We prove that an anisotropic minimal graph over a half-space with flat boundary must itself be flat. This generalizes a result of Edelen-Wang to the anisotropic case. The proof uses only the maximum principle and ideas from fully nonlinear…
We show continuity of the martingale optimal transport optimisation problem as a functional of its marginals. This is achieved via an estimate on the projection in the nested/causal Wasserstein distance of an arbitrary coupling on to the…
For a finite point set $E\subset \mathbb{R}^d$ and a connected graph $G$ on $k+1$ vertices, we define a $G$-framework to be a collection of $k + 1$ points in E such that the distance between a pair of points is specified if the…
We study the optimal transport problem in the Euclidean space where the cost function is given by the value function associated with a Linear Quadratic minimization problem. Under appropriate assumptions, we generalize Brenier's Theorem…
Optimal transport enables one to construct a metric on the set of (sufficiently small at infinity) probability measures on any (not too wild) metric space X, called its Wasserstein space W(X). In this paper we investigate the geometry of…