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

临界随机图的连续极限

The continuum limit of critical random graphs

Louigi Addario-Berry, Nicolas Broutin, Christina Goldschmidt

摘要:

我们考虑在临界窗口内的Erdos-Renyi随机图G(n,p),即当p=1/n+ lambda*n^{-4/3}时,对R中某个固定的lambda.然后,作为一个度量空间,其图距离被n^{-1/3}重标,连通分支序列G(n,p)收敛到一个连续紧度量空间序列。这个结果依赖于图与某些有标记的随机游动之间的一个双射,以及连续随机树的理论。我们的结果给出了许多关于临界随机图中距离的问题的答案。特别地,我们证明了G(n,p)的直径按n^{-1/3}重新标度后按分布收敛于一个具有有限均值的绝对连续随机变量.

英文摘要:

We consider the Erdos-Renyi random graph G(n,p) inside the critical window, that is when p=1/n+ lambda*n^{-4/3}, for some fixed lambda in R. Then, as a metric space with the graph distance rescaled by n^{-1/3}, the sequence of connected components G(n,p) converges towards a sequence of continuous compact metric spaces. The result relies on a bijection between graphs and certain marked random walks, and the theory of continuum random trees. Our result gives access to the answers to a great many questions about distances in critical random graphs. In particular, we deduce that the diameter of G(n,p) rescaled by n^{-1/3} converges in distribution to an absolutely continuous random variable with finite mean.

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

↑