文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > Component sizes of the random graph outside the scaling
侵权投诉

Component sizes of the random graph outside the scaling

window

134AsafNachmiasandYuvalPeres

2 2(n)log(n 3)

asn→∞.

1 ≥δ→0,

TheproofsofthesetheoremsinBollob´as(1984)andLuczak(1990)arequiteinvolvedandusethedetailedasymptoticsfromWright(1977),Bollob´as(1984)andBenderetal.(1990)forthenumberofgraphsonkverticeswithk+ edges.Theproofswepresentherearesimpleandrequirenohardtheorems.Themainadvantage,however,oftheseproofsistheirrobustness.Inacompanionpaper(seeNachmiasandPeres(2007))weusesimilarmethodstoanalyzecriticalpercolationonrandomregulargraphs.Inthiscase,theenumerativemethodsemployedinBollob´as(1984)andLuczak(1990)arenotavailable.ThephasetransitionintheErd os-R´enyirandomgraphsG(n,p)occurswhencp=

,thelawofn 2/3|C1|

convergestoapositivenon-constantdistributionwhichwasidenti edbyAldous(1997)asthelongestexcursionlengthofBrownianmotionwithsomevariabledrift.

1/3

SeeNachmiasandPeres(2005)forarecentaccountofthecasep=1+λn

n

n

.How-

ever,if (n)asequencesuchthatn1/3 (n)→∞andp=

1+ (n)

上一页第2页

你可能喜欢

热门文档

相关文档

站点地图 | 文档上传 | 侵权投诉 | 手机版
本站所有资源均来自互联网,本站只负责收集和整理,均不承担任何法律责任,如有侵权等其它行为请联系我们.
文档下载 Copyright 2013 doc.guandang.net All Rights Reserved.  -  email