Volume in General Metric Spaces

• Published in: Discrete & computational geometry 2014-09, Vol.52 (2), p.366-389
• Main Authors: Abraham, Ittai, Bartal, Yair, Neiman, Ofer, Schulman, Leonard J.
• Format: Article
• Language: English
• Subjects: Algorithms; Combinatorics; Computational Mathematics and Numerical Analysis; Constants; Cost analysis; Distortion; Euclidean space; Mathematics; Mathematics and Statistics; Metric space; Preserves; Preserving; Robustness
• ISSN: 0179-5376; 1432-0444
• DOI: 10.1007/s00454-014-9615-4

A central question in the geometry of finite metric spaces is how well can an arbitrary metric space be “faithfully preserved” by a mapping into Euclidean space. In this paper we present an algorithmic embedding which obtains a new strong measure of faithful preservation: not only does it (approximately) preserve distances between pairs of points, but also the volume of any set of k points. Such embeddings are known as volume preserving embeddings. We provide the first volume preserving embedding that obtains constant average volume distortion for sets of any fixed size. Moreover, our embedding provides constant bounds on all bounded moments of the volume distortion while maintaining the best possible worst-case volume distortion. Feige, in his seminal work on volume preserving embeddings defined the volume of a set S = { v 1 , … , v k } of points in a general metric space: the product of the distances from v i to { v 1 , ⋯ , v i - 1 } , normalized by 1 ( k - 1 ) ! , where the ordering of the points is that given by Prim’s minimum spanning tree algorithm. Feige also related this notion to the maximal Euclidean volume that a Lipschitz embedding of S into Euclidean space can achieve. Syntactically this definition is similar to the computation of volume in Euclidean spaces, which however is invariant to the order in which the points are taken. We show that a similar robustness property holds for Feige’s definition: the use of any other order in the product affects volume 1 / ( k - 1 ) by only a constant factor. Our robustness result is of independent interest as it presents a new competitive analysis for the greedy algorithm on a variant of the online Steiner tree problem where the cost of buying an edge is logarithmic in its length. This robustness property allows us to obtain our results on volume preserving embedding.