Shuangshuang Zhang
ABSTRACT
Distortion 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 the existence of minimal-distortion embeddings. By definition, the distortion of a graph G concerning a given metric space X is defined to be the infi- mum of the distortions of all embeddings from G to X. However, we prove that for G finite and , there is always an embedding of G that realizes the distortion of G. In the second half, we summarize all studies of the distortion problems up to date. We studied kinds of typical embedded issues, such as the plane graph of o points, a tree and special graphics.
- MohammadHossein Bateni, Erik D Demaine, MohammadTaghi Hajiaghayi, and Mohammad Moharrami. 2007. Plane embeddings of planar graph metrics. Discrete & Computational Geometry 38, 3 (2007), 615–637.Google Scholar
Digital Library
- Rahul Bhargava. 2004. Lower Bounds on Embeddings of Planar Graphs into the l1 Metric. (2004).Google Scholar
- Amit Chakrabarti, Alexander Jaffe, James R Lee, and Justin Vincent. 2008. Embeddings of topological graphs: Lossy invariants, linearization, and 2-sums. In 2008 49th Annual IEEE Symposium on Foundations of Computer Science. IEEE, 761–770.Google ScholarDigital Library
- Arnold Filtser. 2020. A face cover perspective to l1 embeddings of planar graphs. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 1945–1954.Google ScholarCross Ref
- Costis Georgiou and Hamed Hatami. 2008. CSC2414-Metric embeddings.Google Scholar
- Piotr Indyk, Jirı Matoušek, and Anastasios Sidiropoulos. 2004. Low-distortion embeddings of finite metric spaces. Handbook of discrete and computational geometry 37 (2004), 46.Google Scholar
- Ilan Newman and Yuri Rabinovich. 2002. A lower bound on the distortion of embedding planar metrics into Euclidean space. In Proceedings of the eighteenth annual symposium on Computational geometry. 94–96.Google ScholarDigital Library
- John Pardon. 2010. On the distortion of knots on embedded surfaces. arXiv: 1010.1972 (2010).Google Scholar
- Luca Studer. 2015. Note on the distortion of (2,q)-torus knots. arXiv: 1502.01919 (2015).Google Scholar
Recommendations
A lower bound on the distortion of embedding planar metrics into Euclidean space
SCG '02: Proceedings of the eighteenth annual symposium on Computational geometry(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 ...
The least Euclidean distortion constant of a distance-regular graph
AbstractIn 2008, Vallentin made a conjecture involving the least distortion of an embedding of a distance-regular graph into Euclidean space. Vallentin’s conjecture implies that for a least distortion Euclidean embedding of a distance-regular ...
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