arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2404.14792math.COcs.DMcs.DS
收藏

$α_i$-度量图:双曲性

$α_i$-Metric Graphs: Hyperbolicity

Kent State University(肯特州立大学);National Institute for Research and Development in Informatics(信息学国家研究与发展中心);University of Bucharest(布加勒斯特大学)

Feodor F. Dragan, Guillaume Ducoffe

AI总结:

本文研究了$α_i$-度量图与双曲性之间的关系,证明了$α_i$-度量图是$f(i)$-双曲的,并给出了简单构造非$α_i$-度量图的例子,特别证明了$α_1$-度量图是1-双曲的。

摘要:

一个图被称为$α_i$-度量($i∈{\cal N}$)当且仅当对于任意顶点$u, w, v$和$x$,如果从$u$到$w$的最短路径和从$x$到$v$的最短路径共享终端边$vw$,则$d(u,x) ≥ d(u,v) + d(v,x) - i$。后者是欧几里得空间中两个测地线共享终端段必须也是测地线的离散放松。最近在(Dragan & Ducoffe, WG'23)中,我们开始了$α_i$-度量图算法应用的研究。我们的先前结果与(Chepoi等,SoCG'08)和(Chepoi等,COCOA'18)中对于具有有界双曲性的图的结果非常相似。后者是Gromov首先引入的广泛研究的度量树状参数。在本文中,我们澄清了双曲性与$α_i$-度量性质之间的关系,证明了$α_i$-度量图是$f(i)$-双曲的,其中$f$是线性于$i$的函数。我们用各种等价的图双曲性定义给出了这一结果的不同证明。相比之下,我们给出了简单构造的1-双曲图,这些图不是任何常数$i$的$α_i$-度量图。最后,在$ i=1 $的特殊情况下,我们证明了$α_1$-度量图是1-双曲的,且该界是紧的。通过这样做,我们回答了(Dragan & Ducoffe, WG'23)中留下的某些问题。

英文摘要:

A graph is called $α_i$-metric ($i \in {\cal N}$) if it satisfies the following $α_i$-metric property for every vertices $u, w, v$ and $x$: if a shortest path between $u$ and $w$ and a shortest path between $x$ and $v$ share a terminal edge $vw$, then $d(u,x) \ge d(u,v) + d(v,x) - i$. The latter is a discrete relaxation of the property that in Euclidean spaces the union of two geodesics sharing a terminal segment must be also a geodesic. Recently in (Dragan & Ducoffe, WG'23) we initiated the study of the algorithmic applications of $α_i$-metric graphs. Our results in this prior work were very similar to those established in (Chepoi et al., SoCG'08) and (Chepoi et al., COCOA'18) for graphs with bounded hyperbolicity. The latter is a heavily studied metric tree-likeness parameter first introduced by Gromov. In this paper, we clarify the relationship between hyperbolicity and the $α_i$-metric property, proving that $α_i$-metric graphs are $f(i)$-hyperbolic for some function $f$ linear in $i$. We give different proofs of this result, using various equivalent definitions to graph hyperbolicity. By contrast, we give simple constructions of $1$-hyperbolic graphs that are not $α_i$-metric for any constant $i$. Finally, in the special case of $i=1$, we prove that $α_1$-metric graphs are $1$-hyperbolic, and the bound is sharp. By doing so, we can answer some questions left open in (Dragan & Ducoffe, WG'23).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑