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

随机图的相变--一个简单的证明

The phase transition in random graphs - a simple proof

Michael Krivelevich, Benny Sudakov

摘要:

Erdos和Renyi的经典结果表明,随机图G(n,p)在p=1/n附近经历急剧的相变,对于任意ε>0和p=(1-ε)/n,G(n,p)的所有连通分支的大小通常为O(log n),而对于p=(1+ε)/n,G(n,p)的连通分支的大小在n中是线性的概率很高.我们对这个基本结果给出了一个非常简单的证明;事实上,我们证明了在超临界区域p=(1+ε)/n中,随机图G(n,p)通常包含一条线性长度的路。我们还讨论了我们的技术应用到其他随机图模型和位置游戏。

英文摘要:

The classical result of Erdos and Renyi shows that the random graph G(n,p) experiences sharp phase transition around p=1/n - for any ε>0 and p=(1-ε)/n, all connected components of G(n,p) are typically of size O(log n), while for p=(1+ε)/n, with high probability there exists a connected component of size linear in n. We provide a very simple proof of this fundamental result; in fact, we prove that in the supercritical regime p=(1+ε)/n, the random graph G(n,p) contains typically a path of linear length. We also discuss applications of our technique to other random graph models and to positional games.

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

↑