Distortion of embeddings of binary trees into diamond graphs
From MaRDI portal
Abstract: 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 superreflexivity of Banach spaces can be characterized both in terms of binary trees (Bourgain, 1986) and diamond graphs (Johnson-Schechtman, 2009). In this connection, it is natural to ask whether one of these families admits uniformly bilipschitz embeddings into the other. This question was answered in the negative by Ostrovskii (2014), who left it open to determine the order of growth of the distortions. The main purpose of this paper is to get a sharp-up-to-a-logarithmic-factor estimate for the distortions of embeddings of binary trees into diamond graphs, and, more generally, into diamond graphs of any finite branching . Estimates for distortions of embeddings of diamonds into infinitely branching diamonds are also obtained.
Recommendations
- Metrical characterization of super-reflexivity and linear type of Banach spaces
- Distortion in the metric characterization of superreflexivity in terms of the infinite binary tree
- DIAMOND GRAPHS AND SUPER-REFLEXIVITY
- On the geometry of the countably branching diamond graphs
- A new approach to low-distortion embeddings of finite metric spaces into non-superreflexive Banach spaces
Cites work
- A lower bound on the distortion of embedding planar metrics into Euclidean space
- A new approach to low-distortion embeddings of finite metric spaces into non-superreflexive Banach spaces
- Coarse differentiation and multi-flows in planar graphs
- Cuts, trees and \(\ell_1\)-embeddings of graphs
- DIAMOND GRAPHS AND SUPER-REFLEXIVITY
- Embedding the diamond graph in L_p and dimension reduction in L₁
- Entropy-based bounds on dimension reduction in L^1
- Graph theory
- Lower bounds on the distortion of embedding finite metric spaces in graphs
- Martingales in Banach spaces
- Metric characterizations of superreflexivity in terms of word hyperbolic groups and finite graphs
- Metric embeddings. Bilipschitz and coarse embeddings into Banach spaces
- Metric Spaces Admitting Low-distortion Embeddings into All n-dimensional Banach Spaces
- On the geometry of the countably branching diamond graphs
- On the impossibility of dimension reduction in l 1
- The metrical interpretation of superreflexivity in Banach spaces
- Yet another short proof of Bourgain's distortion estimate for embedding of trees into uniformly convex Banach spaces
Cited in
(12)- The Euclidean distortion of complete binary trees
- On the bi-Lipschitz geometry of lamplighter graphs
- Nonexistence of embeddings with uniformly bounded distortions of Laakso graphs into diamond graphs
- On the geometry of the countably branching diamond graphs
- Metric embeddings of Laakso graphs into Banach spaces
- ()-distortion of some infinite graphs
- Optimal distortion embedding of complete binary trees into lines
- A characterization of superreflexivity through embeddings of lamplighter groups
- A new approach to low-distortion embeddings of finite metric spaces into non-superreflexive Banach spaces
- Metric characterizations of super weakly compact operators
- Umbel convexity and the geometry of trees
- On Matoušek-like embedding obstructions of countably branching graphs
This page was built for publication: Distortion of embeddings of binary trees into diamond graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4595998)
