Bounded geometries, fractals, and low-distortion embeddings

作者: A. Gupta , R. Krauthgamer , J.R. Lee

DOI: 10.1109/SFCS.2003.1238226

关键词: Graph theoryDiscrete mathematicsEmbeddingBall (bearing)Bounded functionFractalCombinatoricsLambdaMathematicsEquivalence of metricsMetric space

摘要: The doubling constant of a metric space (X, d) is the smallest value /spl lambda/ such that every ball in X can be covered by balls half radius. dimension then defined as dim (X) = log/sub 2//spl lambda/. A (or sequence metrics) called precisely when its bounded. This robust class spaces which contains many families metrics occur applied settings. We give tight bounds for embedding into (low-dimensional) normed spaces. consider both general metrics, well more restricted those arising from trees, graphs excluding fixed minor, and snowflaked metrics. Our techniques include decomposition theorems an analysis fractal plane according to T. J. Laakso (2002). Finally, we discuss some applications point out central open question regarding dimensionality reduction L/sub 2/.

参考文章(41)
Anupam Gupta†, Ilan Newman, Yuri Rabinovich, Alistair Sinclair‡, Cuts, Trees and ℓ 1 -Embeddings of Graphs* foundations of computer science. ,vol. 24, pp. 233- 269 ,(1999) , 10.1007/S00493-004-0015-X
Patrice Assouad, Plongements lipschitziens dans Rn ,(2003)
James R. Lee, Manor Mendel, Assaf Naor, Metric Structures in L1: Dimension, Snowflakes, and Average Distortion latin american symposium on theoretical informatics. pp. 401- 412 ,(2004) , 10.1007/978-3-540-24698-5_44
B. Brinkman, M. Charikar, On the impossibility of dimension reduction in /spl lscr//sub 1/ foundations of computer science. pp. 514- 523 ,(2003) , 10.1109/SFCS.2003.1238224
P. Indyk, Algorithmic applications of low-distortion geometric embeddings international conference on cluster computing. pp. 10- 33 ,(2001) , 10.1109/SFCS.2001.959878
Moses Charikar, Bo Brinkman, On the Impossibility of Dimension Reduction in \ell _1 foundations of computer science. pp. 514- 523 ,(2003)
Urs Lang, Conrad Plaut, Bilipschitz Embeddings of Metric Spaces into Space Forms Geometriae Dedicata. ,vol. 87, pp. 285- 307 ,(2001) , 10.1023/A:1012093209450
Jiří Matoušek, On embedding trees into uniformly convex Banach spaces Israel Journal of Mathematics. ,vol. 114, pp. 221- 237 ,(1999) , 10.1007/BF02785579
Anupam Gupta, Improved Bandwidth Approximation for Trees and Chordal Graphs Journal of Algorithms. ,vol. 40, pp. 24- 36 ,(2001) , 10.1006/JAGM.2000.1118