Related papers: Stochastic approximation of lamplighter metrics
In this article we start a systematic study of the bi-Lipschitz geometry of lamplighter graphs. We prove that lamplighter graphs over trees bi-Lipschitzly embed into Hamming cubes with distortion at most~$6$. It follows that lamplighter…
We give sufficient conditions for a metric space to bilipschitz embed in L_1. In particular, if X is a length space and there is a Lipschitz map u:X--->R such that for every interval I in R, the connected components of the inverse image…
We survey connections between the theory of bi-Lipschitz embeddings and the Sparsest Cut Problem in combinatorial optimization. The story of the Sparsest Cut Problem is a striking example of the deep interplay between analysis, geometry,…
Stochastic embeddings of finite metric spaces into graph-theoretic trees have proven to be a vital tool for constructing approximation algorithms in theoretical computer science. In the present work, we build out some of the basic theory of…
Metric embedding has become a common technique in the design of algorithms. Its applicability is often dependent on how high the embedding's distortion is. For example, embedding finite metric space into trees may require linear distortion…
Diamond graphs and binary trees are important examples in the theory of metric embeddings and also in the theory of metric characterizations of Banach spaces. Some results for these families of graphs are parallel to each other, for example…
We show that every group $H$ of at most exponential growth with respect to some left invariant metric admits a bi-Lipschitz embedding into a finitely generated group $G$ such that $G$ is amenable (respectively, solvable, satisfies a…
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…
In this article, the bi-Lipschitz embeddability of the sequence of countably branching diamond graphs $(D_k^\omega)_{k\in\mathbb{N}}$ is investigated. In particular it is shown that for every $\varepsilon>0$ and $k\in\mathbb{N}$,…
The problem of computing a bi-Lipschitz embedding of a graphical metric into the line with minimum distortion has received a lot of attention. The best-known approximation algorithm computes an embedding with distortion $O(c^2)$, where $c$…
This paper is concerned with embeddings of homogeneous spaces into Euclidean spaces. We show that any homogeneous metric space can be embedded into a Hilbert space using an almost bi-Lipschitz mapping (bi-Lipschitz to within logarithmic…
In this paper, we discuss the embeddability of subspaces of the Gromov-Hausdorff space, which consists of isometry classes of compact metric spaces endowed with the Gromov-Hausdorff distance, into Hilbert spaces. These embeddings are…
A quasi-isometry between two connected graphs is measure-scaling if one can control precisely the sizes of pre-images of finite subsets. Such a notion is motivated by the work of Eskin-Fisher-Whyte on lamplighters over $\mathbb{Z}$ and the…
Cohen-Addad, Le, Pilipczuk, and Pilipczuk [CLPP23] recently constructed a stochastic embedding with expected $1+\varepsilon$ distortion of $n$-vertex planar graphs (with polynomial aspect ratio) into graphs of treewidth…
Let $n$ be a positive integer. We provide an explicit geometrically motivated $1$-Lipschitz map from the space of persistence diagrams on $n$ points (equipped with the Bottleneck distance) into the Hilbert space $\ell^2$. Such maps are a…
Persistence diagrams are important descriptors in Topological Data Analysis. Due to the nonlinearity of the space of persistence diagrams equipped with their {\em diagram distances}, most of the recent attempts at using persistence diagrams…
We give a new approach to the infinitesimal structure of Lipschitz maps into L^1. As a first application, we give an alternative proof of the main theorem from an earlier paper, that the Heisenberg group does not admit a bi-Lipschitz…
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 main purpose of the paper is to prove the following results: Let $A$ be a locally finite metric space whose finite subsets admit uniformly bilipschitz embeddings into a Banach space $X$. Then $A$ admits a bilipschitz embedding into $X$.…
Lattices and periodic point sets are well known objects from discrete geometry. They are also used in crystallography as one of the models of atomic structure of periodic crystals. In this paper we study the embedding properties of spaces…