## Bounded geometries, fractals, and low-distortion embeddings

### Cached

### Download Links

- [www.cs.cmu.edu]
- [www.cs.washington.edu]
- [homes.cs.washington.edu]
- [www.cs.ust.hk]
- [www.cs.cmu.edu]
- [www.cs.berkeley.edu]
- [www.wisdom.weizmann.ac.il]
- DBLP

### Other Repositories/Bibliography

Citations: | 152 - 30 self |

### BibTeX

@MISC{Gupta_boundedgeometries,,

author = {Anupam Gupta and Robert Krauthgamer and James R. Lee},

title = {Bounded geometries, fractals, and low-distortion embeddings},

year = {}

}

### OpenURL

### Abstract

The doubling constant of a metric space (X; d) is thesmallest value * such that every ball in X can be covered by * balls of half the radius. The doubling dimension of X isthen defined as dim(X) = log2 *. A metric (or sequence ofmetrics) is called doubling precisely when its doubling dimension is bounded. This is a robust class of metric spaceswhich contains many families of metrics that occur in applied settings.We give tight bounds for embedding doubling metrics into (low-dimensional) normed spaces. We consider bothgeneral doubling metrics, as well as more restricted families such as those arising from trees, from graphs excludinga fixed minor, and from snowflaked metrics. Our techniques include decomposition theorems for doubling metrics, andan analysis of a fractal in the plane due to Laakso [21]. Finally, we discuss some applications and point out a centralopen question regarding dimensionality reduction in L2.