Related papers: Stochastic approximation of lamplighter metrics

The seminal result of Johnson and Lindenstrauss on random embeddings has been intensively studied in applied and theoretical computer science. Despite that vast body of literature, we still lack of complete understanding of statistical…

In network design problems, such as compact routing, the goal is to route packets between nodes using the (approximated) shortest paths. A desirable property of these routes is a small number of hops, which makes them more reliable, and…

Graphs with bounded highway dimension were introduced by Abraham et al. [SODA 2010] as a model of transportation networks. We show that any such graph can be embedded into a distribution over bounded treewidth graphs with arbitrarily small…

The purpose of this paper is to introduce and study some basic concepts of quantitative rectifiability in the first Heisenberg group $\mathbb{H}$. In particular, we aim to demonstrate that new phenomena arise compared to the Euclidean…

Learning faithful graph representations as sets of vertex embeddings has become a fundamental intermediary step in a wide range of machine learning applications. The quality of the embeddings is usually determined by how well the geometry…

Diamond graphs and Laakso graphs are important examples in the theory of metric embeddings. Many results for these families of graphs are similar to each other. In this connection, it is natural to ask whether one of these families admits…

Consider the sum of the first $N$ eigenspaces for the Laplacian on a Riemannian manifold. A basis for this space determines a map to Euclidean space and for $N$ sufficiently large the map is an embedding. In analogy with a fruitful idea of…

Considering the Teichm\"uller space of a surface equipped with Thurston's Lipschitz metric, we study geodesic segments whose endpoints have bounded combinatorics. We show that these geodesics are cobounded, and that the closest-point…

Let H be a graph, and let C_H(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating C_H(G). Previous results cover only a few specific instances of this general…

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 study the problem of embedding shortest-path metrics of weighted graphs into $\ell_p$ spaces. We introduce a new embedding technique based on low-depth decompositions of a graph via shortest paths. The notion of Shortest Path…

This note pertains to isometric embeddings endowed with certain geometric properties. We study two embedding problems for a Riemannian manifold $M$ which is diffeomorphic to $\RR^n$ and admits a Bieberbach group $\Gamma$ acting by…

We use spectral invariants in Lagrangian Floer theory in order to show that there exist \emph{isometric} embeddings of normed linear spaces (finite or infinite dimensional, depending on the case) into the space of Hamiltonian deformations…

This note addresses the quantitative aspect of the bilipschitz extension problem. The main result states that any bilipschitz embedding of $\mathbb R$ into $\mathbb R^2$ can be extended to a bilipschitz self-map of $\mathbb R^2$ with a…

Graph embeddings deal with injective maps from a given simple, undirected graph $G=(V,E)$ into a metric space, such as $\mathbb{R}^n$ with the Euclidean metric. This concept is widely studied in computer science, see \cite{ge1}, but also…

The usual theory of negative type (and $p$-negative type) is heavily dependent on an embedding result of Schoenberg, which states that a metric space isometrically embeds in some Hilbert space if and only if it has 2-negative type. A…

We study self-similar ultrametric Cantor sets arising from stationary Bratteli diagrams. We prove that such a Cantor set C is bi-Lipschitz embeddable in R^(d+1), where d denotes the integer part of its Hausdorff dimension. We compute this…

Let $G$ and $G'$ be simple Lie groups of equal real rank and real rank at least $2$. Let $\Gamma <G$ and $\Lambda < G'$ be non-uniform lattices. We prove a theorem that often implies that any quasi-isometric embedding of $\Gamma$ into…

The germ of an algebraic variety is naturally equipped with two different metrics up to bilipschitz equivalence. The inner metric and the outer metric. One calls a germ of a variety Lipschitz normally embedded if the two metrics are…

We give the first non-trivial decremental dynamic embedding of a weighted, undirected graph $G$ into $\ell_p$ space. Given a weighted graph $G$ undergoing a sequence of edge weight increases, the goal of this problem is to maintain a…