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)
A POINT PROCESS DESCRIBING THE COMPONENT SIZES IN THE CRITICAL WINDOW OF THE RANDOM GRAPH EVOLUTION SVANTE JANSON AND JOEL SPENCER Abstract. We study a ...
Component sizes of the r... 14页 免费 Component sizes of the r... ... The giant component in a random subgraph of a given graph The Giant ...
The core of a graph 暂无评价 17页 免费 Emergence of scaling in ... ...of a giant component, that is a component of size of the order of n ...
We show that the expectation of the clustering coefficien隐藏>> The Clustering Coe?cient of a Scale-Free Random Graph arXiv:0804.3032v1 [math.CO] 18...
We found that the localized states outside the ...the scaling of the barriers with the distance ...Random graph models can also be a useful tool ...
The resulting weighted graph is a “small world” and has scaling laws ...the largest connected component and the distribution of the component sizes. ...
In the random graph G(n,p),p=n^{-a} if psi has probability 0(n^{-epsilon}) for every epsil_计算机软件及应用_IT/计算机_专业资料。In the ...
The study of the random graph G(N, p), de?...It is also known that inside the scaling window... by the emergence of the giant component. ...
correlation of a Scale-free Random Graph Process_...Albert. Emergence of scaling in random networks. ... The largest component ... 19页 免费 The ...
The rise of the giant component Linyuan Lu (University of South Carolina) – 2 / 47 Random graphs A random graph is a set of graphs together with...
热门文档