arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1902.04539math.PR
收藏

具有给定度序列的随机平面映射的增长性

On the growth of random planar maps with a prescribed degree sequence

Cyril Marzouk

摘要:

对于非负整数$(d_n(k))_{k \ge 1}$,使得$\sum_{k \ge 1} d_n(k) = n$,我们对每个$k \ge 1$,从具有次数为$2k$的$d_n(k)$面的二分平面映射中随机抽取一个具有$n$面的二分平面映射,并研究了它作为$n \to \infty$的渐近行为.我们证明了这样的地图的直径像$σ_n^{1/2}$,其中$σ_n^2 = \sum_{k \ge 1} k (k-1) d_n(k)$是一个全球的方差项。更确切地说,我们证明了在Gromov-Hausdorff-Prokhorov拓扑中,这些映射的顶点集在图距离除以$σ_n^{1/2}$和一致概率测度的情况下总是容许连续极限.我们的证明依赖于双射随机标记的树,我们能够证明,标签过程总是紧时,适当地重新缩放,即使底层树是不紧的Gromov-Hausdorff拓扑。我们还依赖于一个新的脊椎分解,这是独立的利益。最后,本文也作为一个工具箱的配套文件,我们更精确地讨论布朗极限的映射。

英文摘要:

For non-negative integers $(d_n(k))_{k \ge 1}$ such that $\sum_{k \ge 1} d_n(k) = n$, we sample a bipartite planar map with $n$ faces uniformly at random amongst those which have $d_n(k)$ faces of degree $2k$ for every $k \ge 1$ and we study its asymptotic behaviour as $n \to \infty$. We prove that the diameter of such maps grow like $σ_n^{1/2}$, where $σ_n^2 = \sum_{k \ge 1} k (k-1) d_n(k)$ is a global variance term. More precisely, we prove that the vertex-set of these maps equipped with the graph distance divided by $σ_n^{1/2}$ and the uniform probability measure always admits subsequential limits in the Gromov-Hausdorff-Prokhorov topology. Our proof relies on a bijection with random labelled trees; we are able to prove that the label process is always tight when suitably rescaled, even if the underlying tree is not tight for the Gromov-Hausdorff topology. We also rely on a new spinal decomposition which is of independent interest. Finally this paper also serves as a toolbox for a companion paper in which we discuss more precisely Brownian limits of such maps.

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

↑