Related papers: Tree metrics and their Lipschitz-free spaces

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…

Using the wedge sum of metric spaces, for all compact metrizable spaces, we construct a topological embedding of the compact metrizable space into the set of all metric trees in the Gromov--Hausdorff space with finite prescribed values. As…

We prove that the Lipschitz-free space over a separable ultrametric space has a monotone Schauder basis and is isomorphic to $\ell_1$. This extends results of A. Dalet using an alternative approach.

In this paper, the Lipschitz clustering property of a metric space refers to the existence of Lipschitz retractions between its finite subset spaces. Obstructions to this property can be either topological or geometric features of the…

The definition of $n$-width of a bounded subset $A$ in a normed linear space $X$ is based on the existence of $n$-dimensional subspaces. Although the concept of an $n$-dimensional subspace is not available for metric trees, in this paper,…

Let $M$ be a subset of $\mathbb{R}^n$. If $M$ is not porous, in particular if it has positive $n$-dimensional Lebesgue measure, we prove that the Lipschitz spaces $\mathrm{Lip}_0(M)$ and $\mathrm{Lip}_0(\mathbb{R}^n)$ are linearly…

We show that an infinite weighted tree admits a bi-Lipschitz embedding into Hilbert space if and only if it does not contain arbitrarily large complete binary trees with uniformly bounded distortion. We also introduce a new metric invariant…

We define the concept of an ultrametric M\"obius space and use this to characterize nonelementary geodesically complete trees.

In [9] Kaimanovich introduced the concept of augmented tree on the symbolic space of a self-similar set. It is hyperbolic in the sense of Gromov, and it was shown in [13] that under the open set condition, a self-similar set can be…

We consider random binary trees that appear as the output of certain standard algorithms for sorting and searching if the input is random. We introduce the subtree size metric on search trees and show that the resulting metric spaces…

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…

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…

We give the following characterization of rectifiable metric spaces. A metric space with positive lower Hausdorff density is rectifiable if and only if, for any subset $F$ and $f:F\to Y$, a Lipschitz map into a metric space with positive…

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…

We construct a complete metric space $M$ of cardinality continuum such that every non-singleton closed separable subset of $M$ fails to be a Lipschitz retract of $M$. This provides a metric analogue to the various classical and recent…

For a domain $\Omega$ in a finite-dimensional space $E$, we consider the space $M=(\Omega,d)$ where $d$ is the intrinsic distance in $\Omega$. We obtain an isometric representation of the space $\mathrm{Lip}_{0}(M)$ as a subspace of…

We study the metric structure of walks on graphs, understood as Lipschitz sequences. To this end, a weighted metric is introduced to handle sequences, enabling the definition of distances between walks based on stepwise vertex distances and…

Let $T$ be a weighted tree. The weight of a subtree $T_1$ of $T$ is defined as the product of weights of vertices and edges of $T_1$. We obtain a linear-time algorithm to count the sum of weights of subtrees of $T$. As applications, we…

We characterize the metric spaces whose free space has the bounded approximation property through a Lipschitz analogue of the local reflexivity principle. We show that there exist compact metric spaces whose free spaces fail the…

Let $T$ be a topological space admitting a compatible proper metric, that is, a locally compact, separable and metrisable space. Let $\mathcal{M}^T$ be the non-empty set of all proper metrics $d$ on $T$ compatible with its topology, and…