Abstract
Let G be a k-regular graph, k ≥ 3, with girth g. We prove that every embedding f : G → l2 has distortion Ω(√g). Two proofs are given, one based on Markov type [B] and the other on quadratic programming. In the core of both proofs are some Poincaré-type inequalities on graph metrics.
Original language | English (US) |
---|---|
Pages (from-to) | 380-394 |
Number of pages | 15 |
Journal | Geometric and Functional Analysis |
Volume | 12 |
Issue number | 2 |
DOIs | |
State | Published - 2002 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Analysis
- Geometry and Topology