A simple approach for lower-bounding the distortion in any Hyperbolic embedding - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

A simple approach for lower-bounding the distortion in any Hyperbolic embedding

(1) , (1, 2)
1
2

Abstract

We answer open questions of [Verbeek and Suri, SOCG'14] on the relationships between Gromov hyperbolicity and the optimal stretch of graph embeddings in Hyperbolic space. Then, based on the relationships between hyperbolicity and Cops and Robber games, we turn necessary conditions for a graph to be Cop-win into sufficient conditions for a graph to have a large hyperbolicity (and so, no low-stretch embedding in Hyperbolic space). In doing so we derive lower-bounds on the hyperbolicity in various graph classes – such as Cayley graphs, distance-regular graphs and generalized polygons, to name a few. It partly fills in a gap in the literature on Gromov hyperbolicity, for which few lower-bound techniques are known.
Fichier principal
Vignette du fichier
CouDuc--EUROCOMB17.pdf (223.11 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01573042 , version 1 (08-08-2017)

Identifiers

Cite

David Coudert, Guillaume Ducoffe. A simple approach for lower-bounding the distortion in any Hyperbolic embedding. EUROCOMB'17 -- The European Conference on Combinatorics, Graph Theory and Applications, Aug 2017, Vienna, Austria. pp.293 - 299, ⟨10.1016/j.endm.2017.06.051⟩. ⟨hal-01573042⟩
146 View
203 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More