相关论文: Analysis on Laakso graphs with application to the …

We study transportation cost spaces over finite metric spaces, also known as Lipschitz free spaces. Our work is motivated by a core problem posed by S. Dilworth, D. Kutzarova and M. Ostrovskii, namely, find a condition on a metric space $M$…

The paper is devoted to isometric Banach-space-theoretical structure of transportation cost (TC) spaces on finite metric spaces. The TC spaces are also known as Arens-Eells, Lipschitz-free, or Wasserstein spaces. A new notion of a roadmap…

Main results of the paper: (1) For any finite metric space $M$ the Lipschitz free space on $M$ contains a large well-complemented subspace which is close to $\ell_1^n$. (2) Lipschitz free spaces on large classes of recursively defined…

The present paper deals with some structural properties of transportation cost spaces, also known as Arens-Eells spaces, Lipschitz-free spaces and Wasserstein spaces. The main results of this work are: (1) A necessary and sufficient…

Let $X$ be Banach space which is not super-reflexive. Then, for each $n\ge1$ and $\varepsilon>0$, we exhibit metric embeddings of the Laakso graph $\mathcal{L}_n$ into $X$ with distortion less than $2+\varepsilon$ and into $L_1[0,1]$ with…

These notes present a basic survey on Transportation cost spaces (aka Lipschitzfree spaces, Wasserstein spaces) and their bi-Lipschitz and linear embeddings into $L_1$ spaces. To make these notes as self-contained as possible, we added the…

The paper starts with discussion of applications of cycle spaces to transportation cost. After a short survey of the known results on cycle spaces, we turn to the study of minimal projections onto cycle spaces in the corresponding…

Graphs are fundamental tools for modeling pairwise interactions in complex systems. However, many real-world systems involve multi-way interactions that cannot be fully captured by standard graphs. Hypergraphs, which generalize graphs by…

We show that if there exists a Lipschitz homeomorphism $T$ between the nets in the Banach spaces $C(X)$ and $C(Y)$ of continuous real valued functions on compact spaces $X$ and $Y$, then the spaces $X$ and $Y$ are homeomorphic provided…

The paper is devoted to the geometry of transportation cost spaces and their generalizations introduced by Melleray, Petrov, and Vershik (2008). Transportation cost spaces are also known as Arens-Eells, Lipschitz-free, or Wasserstein $1$…

We investigate finding a map $g$ within a function class $G$ that minimises an Optimal Transport (OT) cost between a target measure $\nu$ and the image by $g$ of a source measure $\mu$. This is relevant when an OT map from $\mu$ to $\nu$…

Let $L=\DD+Z$ for a $C^1$ vector field $Z$ on a complete Riemannian manifold possibly with a boundary. By using the uniform distance, a number of transportation-cost inequalities on the path space for the (reflecting) $L$-diffusion process…

In graph analysis, a classic task consists in computing similarity measures between (groups of) nodes. In latent space random graphs, nodes are associated to unknown latent variables. One may then seek to compute distances directly in the…

Quantifying the degree of dissimilarity between two probability distributions on a finite metric space is a fundamental task in Computer Science and Computer Vision. A natural dissimilarity measure based on optimal transport is the Earth…

Optimal transportation distances are valuable for comparing and analyzing probability distributions, but larger-scale computational techniques for the theoretically favorable quadratic case are limited to smooth domains or regularized…

The study of the diameter of the graph of polyhedra is a classical problem in the theory of linear programming. While transportation polytopes are at the core of operations research and statistics it is still open whether the Hirsch…

We construct a family of purely PI unrectifiable Lipschitz differentiability spaces and investigate the possible of Banach spaces targets for which Lipschitz differentiability holds. We provide a general investigation into the geometry of…

Motivated by the notion of K-gentle partition of unity introduced in [12] and the notion of K-Lipschitz retract studied in [17], we study a weaker notion related to the Kantorovich-Rubinstein transport distance, that we call K-random…

This paper introduces the first statistically consistent estimator of the optimal transport map between two probability distributions, based on neural networks. Building on theoretical and practical advances in the field of Lipschitz neural…

We present several results providing lower bounds for the Banach-Mazur distance \[d_{BM}(C(K), C(L))\] between Banach spaces of continuous functions on compact spaces. The main focus is on the case where $C(L)$ represents the classical…