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

临界随机图:极限构造和分布性质

Critical random graphs: limiting constructions and distributional properties

L. Addario-Berry, N. Broutin, C. Goldschmidt

摘要:

我们考虑在临界窗口内的Erdos-Renyi随机图G(n,p),其中p = 1/n + lambda * n^{-4/3}对于R中的某个lambda.我们在以前的文章(arXiv:0903.4730)中证明了:将G(n,p)的连通分支看作是一列度量空间,其图距离被n^{-1/3}重新标度,并使n趋于无穷大,得到一列非平凡的极限度量空间C =(C_1,C_2,.).这些极限度量空间可以由具有顶点标识的随机实树构造。对于一个这样的度量空间,我们给出了两个等价的构造,这两个构造都是根据更标准的概率对象。第一种是利用Dirichlet随机变量和Aldous的布朗连续统随机树的全局构造。第二种是R_+上的非齐次Poisson点过程的递归构造。这些结构使我们能够表征的质量和长度的分布在组成部分的极限组件时,它是根据其循环结构分解。特别是,这加强了Luczak,Pittel和Wierman的结果,提供精确的分布收敛的内核顶点之间的路径长度和最短周期的长度,在任何固定的限制组件。

英文摘要:

We consider the Erdos-Renyi random graph G(n,p) inside the critical window, where p = 1/n + lambda * n^{-4/3} for some lambda in R. We proved in a previous paper (arXiv:0903.4730) that considering the connected components of G(n,p) as a sequence of metric spaces with the graph distance rescaled by n^{-1/3} and letting n go to infinity yields a non-trivial sequence of limit metric spaces C = (C_1, C_2, ...). These limit metric spaces can be constructed from certain random real trees with vertex-identifications. For a single such metric space, we give here two equivalent constructions, both of which are in terms of more standard probabilistic objects. The first is a global construction using Dirichlet random variables and Aldous' Brownian continuum random tree. The second is a recursive construction from an inhomogeneous Poisson point process on R_+. These constructions allow us to characterize the distributions of the masses and lengths in the constituent parts of a limit component when it is decomposed according to its cycle structure. In particular, this strengthens results of Luczak, Pittel and Wierman by providing precise distributional convergence for the lengths of paths between kernel vertices and the length of a shortest cycle, within any fixed limit component.

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

↑