平均拉伸系数:它有多低?
Average Stretch Factor: How Low Does It Go?
摘要:
在几何图$G$中,两个顶点$u$和$w$之间的\emph{stretch factor}是$G$中从$u$到$w$的最短路径的欧几里德长度与$u$和$w$之间的欧几里德距离之比。$G$的\emph{average stretch factor}是在$G$中的所有顶点对上采用的平均拉伸因子。我们发现,对于任何恒定的尺寸,$d$,和任何一组,$V$,$n$点在$\mathbb{R}^d$,存在一个几何图形的顶点集$V$,有$O(n)$边缘,并有平均拉伸因子$1+ o_n(1)$。更准确地说,该图的平均拉伸因子是$1+O((\log n/n)^{1/(2d+1)})$。我们补充这个上界与下界:存在$n$ -点集$\mathbb{R}^2$的任何图与$O(n)$边缘有平均拉伸因子$1+Ω(1/\sqrt{n})$。对于更常研究的最差情况拉伸因子,这种类型的界限是不可能的。特别地,存在点集$V$,使得任何具有最坏情况拉伸因子$1+o_n(1)$的图具有超线性的边数。
英文摘要:
In a geometric graph, $G$, the \emph{stretch factor} between two vertices, $u$ and $w$, is the ratio between the Euclidean length of the shortest path from $u$ to $w$ in $G$ and the Euclidean distance between $u$ and $w$. The \emph{average stretch factor} of $G$ is the average stretch factor taken over all pairs of vertices in $G$. We show that, for any constant dimension, $d$, and any set, $V$, of $n$ points in $\mathbb{R}^d$, there exists a geometric graph with vertex set $V$, that has $O(n)$ edges, and that has average stretch factor $1+ o_n(1)$. More precisely, the average stretch factor of this graph is $1+O((\log n/n)^{1/(2d+1)})$. We complement this upper-bound with a lower bound: There exist $n$-point sets in $\mathbb{R}^2$ for which any graph with $O(n)$ edges has average stretch factor $1+Ω(1/\sqrt{n})$. Bounds of this type are not possible for the more commonly studied worst-case stretch factor. In particular, there exists point sets, $V$, such that any graph with worst-case stretch factor $1+o_n(1)$ has a superlinear number of edges.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。