How to Complete a Doubling Metric

DOI10.1007/978-3-540-78773-0_4zbMATH Open1136.68461arXiv0712.3331OpenAlexW1576061208MaRDI QIDQ5458515FDOQ5458515

Authors: Anupam Gupta, Kunal Talwar 

Publication date: 15 April 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Abstract: In recent years, considerable advances have been made in the study of properties of metric spaces in terms of their doubling dimension. This line of research has not only enhanced our understanding of finite metrics, but has also resulted in many algorithmic applications. However, we still do not understand the interaction between various graph-theoretic (topological) properties of graphs, and the doubling (geometric) properties of the shortest-path metrics induced by them. For instance, the following natural question suggests itself: emph{given a finite doubling metric $(V,d)$, is there always an underline{unweighted} graph $(V^{\prime },E^{\prime })$ with $Vsubseteq{V}^{\prime }$ such that the shortest path metric $d^{\prime }$ on $V^{\prime }$ is still doubling, and which agrees with $d$ on $V$.} This is often useful, given that unweighted graphs are often easier to reason about. We show that for any metric space $(V,d)$, there is an emph{unweighted} graph $(V^{\prime },E^{\prime })$ with shortest-path metric $d^{\prime }:V^{\prime }imes{V}^{\prime }o{R}_{geq0}$ such that -- for all $x,yinV$, the distances $d(x,y)leq{d}^{\prime }(x,y)leq(1+eps)cdotd(x,y)$, and -- the doubling dimension for $d^{\prime }$ is not much more than that of $d$, where this change depends only on $e$ and not on the size of the graph. We show a similar result when both $(V,d)$ and $(V^{\prime },E^{\prime })$ are restricted to be trees: this gives a simpler proof that doubling trees embed into constant dimensional Euclidean space with constant distortion. We also show that our results are tight in terms of the tradeoff between distortion and dimension blowup.

Full work available at URL: https://arxiv.org/abs/0712.3331

Recommendations

• Making doubling metrics geodesic
• Low dimensional embeddings of doubling metrics
• Low dimensional embeddings of doubling metrics
• Ultra-low-dimensional embeddings for doubling metrics
• Near isometric terminal embeddings for doubling metrics

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Metric spaces, metrizability (54E35)

Cited In (3)

• Making doubling metrics geodesic
• The least doubling constant of a path graph
• The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension

This page was built for publication: How to Complete a Doubling Metric

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458515)