Title :
Bounded geometries, fractals, and low-distortion embeddings
Author :
Gupta, Anupam ; Krauthgamer, Robert ; Lee, James R.
Author_Institution :
Dept. of Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA
Abstract :
The doubling constant of a metric space (X, d) is the smallest value λ such that every ball in X can be covered by λ balls of half the radius. The doubling dimension of X is then defined as dim (X) = log2λ. A metric (or sequence of metrics) is called doubling precisely when its doubling dimension is bounded. This is a robust class of metric spaces which 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 both general doubling metrics, as well as more restricted families such as those arising from trees, from graphs excluding a fixed minor, and from snowflaked metrics. Our techniques include decomposition theorems for doubling metrics, and an analysis of a fractal in the plane according to T. J. Laakso (2002). Finally, we discuss some applications and point out a central open question regarding dimensionality reduction in L2.
Keywords :
computational complexity; computational geometry; fractals; graph theory; bounded geometries; decomposition theorem; dimensionality reduction; doubling metrics; finite metric space; fixed minor; fractals; graphs; low-distortion embedding; normed spaces; snowflaked metric; Algorithm design and analysis; Combinatorial mathematics; Computer science; Extraterrestrial measurements; Fractals; Geometry; Graph theory; Power generation; Robustness; Tree graphs;
Conference_Titel :
Foundations of Computer Science, 2003. Proceedings. 44th Annual IEEE Symposium on
Print_ISBN :
0-7695-2040-5
DOI :
10.1109/SFCS.2003.1238226