A simple approach for lower-bounding the distortion in any Hyperbolic embedding.
Electronic Notes in Discrete Mathematics(2017)
摘要
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.
更多查看译文
关键词
Gromov hyperbolicity,Hyperbolic space,Cop and Robber games
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络