arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2112.05641math.PR
收藏

次临界随机几何图中的桥接哈密顿圈

Bridged Hamiltonian Cycles in Sub-critical Random Geometric Graphs

Ghurumuruhan Ganesan

摘要:

本文考虑了一个随机几何图(RGG)~ \(G\)在~ \(n\)节点上,其邻接距离~ \(r_n\)刚好在Hamilton性阈值之下,并利用称为桥的附加边构造了哈密顿圈.根据定义,桥不属于~ \(G\),我们感兴趣的是估计构建哈密顿圈所需的桥的数量和最大桥长。在我们的主要结果中,我们表明,以高概率,即与概率收敛到1的~ \(n \rightarrow \infty,\),我们可以得到一个哈密顿圈的最大桥长的一个常数倍的~ \(r_n\)和包含一个任意小的分数的边缘作为桥梁。我们使用的骨干建设和迭代循环合并的组合,以获得所需的哈密顿圈。

英文摘要:

In this paper, we consider a random geometric graph (RGG)~\(G\) on~\(n\) nodes with adjacency distance~\(r_n\) just below the Hamiltonicity threshold and construct Hamiltonian cycles using additional edges called bridges. The bridges by definition do not belong to~\(G\) and we are interested in estimating the number of bridges and the maximum bridge length, needed for constructing a Hamiltonian cycle. In our main result, we show that with high probability, i.e. with probability converging to one as~\(n \rightarrow \infty,\) we can obtain a Hamiltonian cycle with maximum bridge length a constant multiple of~\(r_n\) and containing an arbitrarily small fraction of edges as bridges. We use a combination of backbone construction and iterative cycle merging to obtain the desired Hamiltonian cycle.

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

↑