Ultra-low-dimensional embeddings for doubling metrics

We consider the problem of embedding a metric into low-dimensional Euclidean space. The classical theorems of Bourgain, and of Johnson and Lindenstrauss say that any metric on n points embeds into an O(log n)dimensional Euclidean space with O(log n) distortion. Moreover, a simple "volume" argument shows that this bound is nearly tight: a uniform metric on n points requires nearly logarithmic number of dimensions to embed with logarithmic distortion. It is natural to ask whether such a volume restriction is the only hurdle to low-dimensional embeddings. In other words, do doubling metrics, that do not have large uniform submetrics, and thus no volume hurdles to low dimensional embeddings, embed in low dimensional Euclidean spaces with small distortion? In this paper, we give a positive answer to this question. We show how to embed any doubling metrics into O(log log n) dimensions with o(log n) distortion. This is the first embedding for doubling metrics into fewer than logari...

• Type: Conference
• Year: 2008
• Where: SODA
• Authors: T.-H. Hubert Chan, Anupam Gupta, Kunal Talwar
• Keywords: Algorithms, Euclidean Space, Logarithmic Distortion, Metric, SODA 2008