Abstract
We study the metric properties of finite subsets of L 1. The analysis of such metrics is central to a number of important algorithmic problems involving the cut structure of weighted graphs, including the Sparsest Cut Problem, one of the most compelling open problems in the field of approximation. Additionally, many open questions in geometric non-linear functional analysis involve the properties of finite subsets of L 1.
We present some new observations concerning the relation of L 1 to dimension, topology, and Euclidean distortion. We show that every n-point subset of L 1 embeds into L 2 with average distortion \(O(\sqrt{log n})\), yielding the first evidence that the conjectured worst-case bound of \(O(\sqrt{log n})\) is valid. We also address the issue of dimension reduction in L p for p ∈ (1,2). We resolve a question left open in [1] about the impossibility of linear dimension reduction in the above cases, and we show that the example of [2,3] cannot be used to prove a lower bound for the non-linear case. This is accomplished by exhibiting constant-distortion embeddings of snowflaked planar metrics into Euclidean space.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Charikar, M., Sahai, A.: Dimension reduction in the \({\it l_1}\) norm. In: Proceedings of the 43rd Annual IEEE Conference on Foundations of Computer Science. ACM, New York (2002)
Charikar, M., Brinkman, B.: On the impossibility of dimension reduction in \({\it l_1}\). In: To appear in Proceedings of the 44th Annual IEEE Conference on Foundations of Computer Science. ACM, New York (2003)
Lee, J.R., Naor, A.: Embedding the diamond graph in L p and dimension reduction in L 1 (preprint 2003)
Linial, N., London, E., Rabinovich, Y.: The geometry of graphs and some of its algorithmic applications. Combinatorica 15, 215–245 (1995)
Aumann, Y., Rabani, Y.: An O(log k) approximate min-cut max-flow theorem and approximation algorithm. SIAM J. Comput. 27, 291–301 (1998)
Johnson, W.B., Lindenstrauss, J.: Extensions of Lipschitz mappings into a Hilbert space. In: Conference in modern analysis and probability (New Haven, Conn., 1982), Providence, RI. Contemp. Math. Amer. Math. Soc., vol. 26, pp. 189–206 (1984)
Matoušek, J.: Lectures on discrete geometry. Graduate Texts in Mathematics, vol. 212. Springer, New York (2002)
Matoušek, J.: Open problems, workshop on discrete metric spaces and their algorithmic appl ications, Haifa (2002)
Linial, N.: Finite metric spaces - combinatorics, geometry and algorithms. In: Proceedings of the International Congress of Mathematicians III, pp. 573–586 (2002)
Indyk, P.: Algorithmic applications of low-distortion geometric embeddings. In: Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, pp. 10–33 (2001)
Rabinovich, Y.: On average distorsion of embedding metrics into the line and into \({\it l_1}\). In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing. ACM, New York (2003)
Marcus, M.B., Pisier, G.: Characterizations of almost surely continuous p-stable random Fourier series and strongly stationary processes. Acta Math. 152, 245–301 (1984)
Gutpa, A., Krauthgamer, R., Lee, J.R.: Bounded geometries, fractals, and lowdistortion embeddings. In: Proceedings of the 44th Annual Symposium on Foundations of Computer Science (2003)
Krauthgamer, R., Lee, J.R.: Navigating nets: Simple algorithms for proximity search (submitted 2003)
Laakso, T.J.: Ahlfors Q-regular spaces with arbitrary Q > 1 admitting weak Poincaré inequality. Geom. Funct. Anal. 10, 111–123 (2000)
Lang, U., Plaut, C.: Bilipschitz embeddings of metric spaces into space forms. Geom. Dedicata 87, 285–307 (2001)
Figiel, T., Lindenstrauss, J., Milman, V.D.: The dimension of almost spherical sections of convex bodies. Acta Math. 139, 53–94 (1977)
Assouad, P.: Plongements lipschitziens dans Rn. Bull. Soc. Math. France 111, 429–448 (1983)
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. ACM, New York (1999)
Widder, D.V.: The Laplace Transform. Princeton Mathematical Series, vol. 6. Princeton University Press, Princeton (1941)
Milman, V.D., Schechtman, G.: Asymptotic theory of finite-dimensional normed spaces. Springer, Berlin (1986); With an appendix by M. Gromov
Gupta, A., Newman, I., Rabinovich, Y., Sinclair, A.: Cuts, trees and \({\it l_1}\) embeddings. In: Proceedings of the 40th Annual Symposium on Foundations of Computer Science (1999)
Matoušek, J.: On embedding expanders into l p spaces. Israel J. Math. 102, 189–197 (1997)
Heinonen, J.: Lectures on analysis on metric spaces. Universitext. Springer, New York (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, J.R., Mendel, M., Naor, A. (2004). Metric Structures in L 1: Dimension, Snowflakes, and Average Distortion. In: Farach-Colton, M. (eds) LATIN 2004: Theoretical Informatics. LATIN 2004. Lecture Notes in Computer Science, vol 2976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24698-5_44
Download citation
DOI: https://doi.org/10.1007/978-3-540-24698-5_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21258-4
Online ISBN: 978-3-540-24698-5
eBook Packages: Springer Book Archive