Abstract
In Rao (Proceedings of the 15th Annual Symposium on Computational Geometry, pp. 300–306, 1999), it is shown that every n-point Euclidean metric with polynomial aspect ratio admits a Euclidean embedding with k-dimensional distortion bounded by \(O(\sqrt{\log n\log k})\) , a result which is tight for constant values of k. We show that this holds without any assumption on the aspect ratio and give an improved bound of \(O(\sqrt{\log n}(\log k)^{1/4})\) . Our main result is an upper bound of \(O(\sqrt{\log n}\log\log n)\) independent of the value of k, nearly resolving the main open questions of Dunagan and Vempala (Randomization, Approximation, and Combinatorial Optimization, pp. 229–240, 2001) and Krauthgamer et al. (Discrete Comput. Geom. 31(3):339–356, 2004). The best previous bound was O(log n), and our bound is nearly tight, as even the two-dimensional volume distortion of an n-vertex path is \(\Omega(\sqrt{\log n})\) .
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Arora, S., Lee, J.R., Naor, A.: Euclidean distortion and the sparsest cut. J. Am. Math. Soc. 21(1), 1–21 (2008)
Bartal, Y.: Probabilistic approximations of metric space and its algorithmic application. In: 37th Annual Symposium on Foundations of Computer Science, pp. 183–193, October 1996
Bourgain, J.: On Lipschitz embedding of finite metric spaces in Hilbert space. Isr. J. Math. 52(1–2), 46–52 (1985)
Calinescu, G., Karloff, H., Rabani, Y.: Approximation algorithms for the 0-extension problem. In: Proceedings of the 12th Annual ACM–SIAM Symposium on Discrete Algorithms, pp. 8–16, Philadelphia, PA (2001)
Dunagan, J., Vempala, S.: On Euclidean embeddings and bandwidth minimization. In: Randomization, Approximation, and Combinatorial Optimization, pp. 229–240. Springer, Berlin (2001)
Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pp. 448–455 (2003)
Feige, U.: Approximating the bandwidth via volume respecting embeddings. J. Comput. Syst. Sci. 60(3), 510–539 (2000)
Gupta, A., Krauthgamer, R., Lee, J.R.: Bounded geometries, fractals, and low-distortion embeddings. In: 44th Symposium on Foundations of Computer Science, pp. 534–543 (2003)
Johnson, W.B., Lindenstrauss, J.: Extensions of Lipschitz mappings into a Hilbert space. In: Conference in modern analysis and probability (New Haven, Conn., 1982), pp. 189–206. Am. Math. Soc., Providence (1984)
Kirszbraun, M.D.: Über die zusammenziehenden und Lipschitzchen Transformationen. Fund. Math. 22, 77–108 (1934)
Krauthgamer, R., Linial, N., Magen, A.: Metric embeddings–beyond one-dimensional distortion. Discrete Comput. Geom. 31(3), 339–356 (2004)
Krauthgamer, R., Lee, J.R., Mendel, M., Naor, A.: Measured descent: A new embedding method for finite metrics. Geom. Funct. Anal. 15(4), 839–858 (2005)
Lee, J.R.: On distance scales, embeddings, and efficient relaxations of the cut cone. In: SODA’05: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 92–101, Philadelphia, PA, USA (2005). Society for Industrial and Applied Mathematics
Linial, N., Saks, M.: Low diameter graph decompositions. Combinatorica 13(4), 441–454 (1993)
Matoušek, J.: Lectures on Discrete Geometry. Graduate Texts in Mathematics, vol. 212. Springer, New York (2002)
Milman, V.D., Schechtman, G.: Asymptotic Theory of Finite-Dimensional Normed Spaces. Lecture Notes in Mathematics, vol. 1200. Springer, Berlin (1986). With an appendix by M. Gromov
Rao, S.: Small distortion and volume preserving embeddings for planar and Euclidean metrics. In: Proceedings of the 15th Annual Symposium on Computational Geometry, pp. 300–306, New York (1999)
Vempala, S.: Random projection: A new approach to VLSI layout. In: 39th Annual Symposium on Foundations of Computer Science (1998)
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was done while the author was a postdoctoral fellow at the Institute for Advanced Study, Princeton, NJ.
Rights and permissions
About this article
Cite this article
Lee, J.R. Volume Distortion for Subsets of Euclidean Spaces. Discrete Comput Geom 41, 590–615 (2009). https://doi.org/10.1007/s00454-009-9135-9
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-009-9135-9