Ilan Newman
ABSTRACT
(MATH) We exhibit a simple infinite family of series-parallel graphs that cannot be metrically embedded into Euclidean space with distortion smaller than $\Omega(\sqrt\log n\,)$. This matches Rao's general upper bound for metric embedding of planar graphs into Euclidean space, [14], thus resolving the question of how well do planar metrics embed in Euclidean spaces.
- Yonatan Aumann and Yuval Rabani. An O(log k) approximate min-cut max-flow theorem and approximation algorithm. SIAM Journal on Computing, 27(1):291--301, February 1998. Google Scholar
Digital Library
- Yair Bartal. Probabilistic approximations of metric spaces and its algorithmic applications. In Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science, pages 184--193, 1996. Google ScholarDigital Library
- Yair Bartal. On approximating arbitrary metrics by tree metrics. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pages 161--168, 1998. Google ScholarDigital Library
- Jean Bourgain. On Lipschitz embeddings of finite metric spaces in Hilbert space. Israel Journal of Mathematics, 52(1-2):46--52, 1985.Google ScholarCross Ref
- Jean Bourgain. The metrical interpretation of superreflexivity in Banach spaces. Israel Journal of Mathematics, 56(2):222--230, 1986.Google ScholarCross Ref
- Uriel Feige. Approximating the bandwidth via volume respecting embeddings. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pages 90--99, 1998. Google ScholarDigital Library
- A. Gupta, I. Newman, Y. Rabinovich and A. Sinclair, Cuts, trees and ℓ1-embeddings of graphs. In Proceedings of the 40th Annual Symposium on Foundations of CS, pages 399--408, 1999. Google ScholarDigital Library
- W.B. Johnson and J. Lindenstrauss, Extensions of Lipschitz mappings into a Hilbert space, Contemporary Mathematics 26 (1984), 189-206.Google ScholarCross Ref
- Philip Klein, Serge A. Plotkin, and Satish B. Rao. Excluded minors, network decomposition, and multicommodity flow. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pages 682--690, 1993. Google ScholarDigital Library
- Nathan Linial, Eran London, and Yuri Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15(2):215--245, 1995.Google ScholarCross Ref
- Nathan Linial, Jiří Matoušek and Yuri Rabinovich. Embedding the edges of series-parallel graphs into line. Manuscript. 2000.Google Scholar
- Jiří Matoušek. On embedding trees into uniformly convex Banach spaces. Israel Journal of Mathematics, 114:221--237, 1999. (Czech version in: Lipschitz distance of metric spaces, C.Sc. degree thesis, Charles University, 1990).Google ScholarCross Ref
- V. Milman, G. Schechtman. Asymptotic Theory of Finite Dimensional Spaces, LNM 1200, Springer-Verlag 1986. Google ScholarDigital Library
- Satish B. Rao. Small distortion and volume preserving embeddings for planar and Euclidean metrics. In 15th Annual ACM Symposium on Computational Geometry, pages 300--306, 1999. Google ScholarDigital Library
- P. D. Seymour. Sums of circuits. In J.A. Bondy and U.S. Murty, editors, Graph theory with applications, American Elsevier, NY, 1979. pages 341--355.Google Scholar
Index Terms
- A lower bound on the distortion of embedding planar metrics into Euclidean space
Recommendations
Research on Distortion of Embedding Graph into Euclidean Space
ICoMS '21: Proceedings of the 2021 4th International Conference on Mathematics and StatisticsDistortion describes how the natural metric on the graph differs from the induced metric from an embedding into a Euclidean space or other metric spaces. In this paper, we mainly explain two parts. In the first part, we focus on the problem of proving ...
Embedding k-Outerplanar Graphs into l1
We show that the shortest-path metric of any $k$-outerplanar graph, for any fixed $k$, can be approximated by a probability distribution over tree metrics with constant distortion and hence also embedded into $\ell_1$ with constant distortion. These ...
Comments