arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1810.03802math.PRmath.CO
收藏

随机$3$ -正则图的最小生成树的几何

Geometry of the minimal spanning tree of a random $3$-regular graph

Louigi Addario-Berry, Sanchayan Sen

摘要:

最小生成树(MST)的全局结构被期望对于一大类潜在的随机离散结构是通用的。然而,关于大多数标准模型的MST的内在几何知之甚少,并且到目前为止,仅在完全图的情况下确定了MST作为度量测度空间的标度极限[5]。在这项工作中,我们表明,MST通过分配i.i.d.随机(简单)$3$ -正则图或$3$ -正则配置模型在$n$顶点上的连续边权,被赋予由$n^{-1/3}$缩放的树距离和顶点上的均匀概率测度,关于Gromov-Hausdorff-Prokhorov拓扑在分布上收敛到随机紧度量测度空间。此外,这个极限空间具有与[5]中确定的完全图的MST的缩放极限相同的规律,直到缩放因子为$6^{1/3}$。我们的证明依赖于一个新的论点,收益通过比较之间的$3$ -定期配置模型和最大的组成部分,在关键的Erdens-Rényi随机图。本文的技术可以用来建立MST的标度极限在一般随机图的设置与给定的度序列提供两个额外的技术条件得到验证。

英文摘要:

The global structure of the minimal spanning tree (MST) is expected to be universal for a large class of underlying random discrete structures. However, very little is known about the intrinsic geometry of MSTs of most standard models, and so far the scaling limit of the MST viewed as a metric measure space has only been identified in the case of the complete graph [5]. In this work, we show that the MST constructed by assigning i.i.d. continuous edge-weights to either the random (simple) $3$-regular graph or the $3$-regular configuration model on $n$ vertices, endowed with the tree distance scaled by $n^{-1/3}$ and the uniform probability measure on the vertices, converges in distribution with respect to Gromov-Hausdorff-Prokhorov topology to a random compact metric measure space. Further, this limiting space has the same law as the scaling limit of the MST of the complete graph identified in [5] up to a scaling factor of $6^{1/3}$. Our proof relies on a novel argument that proceeds via a comparison between a $3$-regular configuration model and the largest component in the critical Erdős-Rényi random graph. The techniques of this paper can be used to establish the scaling limit of the MST in the setting of general random graphs with given degree sequences provided two additional technical conditions are verified.

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

↑