The component sizes of a critical random graph with given degree sequence
The component sizes of a critical random graph with given degree sequence
复制标题
给定度数序列的临界随机图的分量大小
DOI:
--
复制
发表时间:
2010
期刊:
影响因子:
--
通讯作者:
Adrien Joseph
中科院分区:
文献类型:
--
作者:
Adrien Joseph
Consider a critical random multigraph $mathcal{G}_n$ with $n$ vertices constructed by the configuration model such that its vertex degrees are independent random variables with the same distribution $
u$ (criticality means that the second moment of $
u$ is finite and equals twice its first moment). We specify the scaling limits of the ordered sequence of component sizes of $mathcal{G}_n$ as $n$ tends to infinity in different cases. When $
u$ has finite third moment, the components sizes rescaled by $n^{-2/3}$ converge to the excursion lengths of a Brownian motion with parabolic drift above past minima, whereas when $
u$ is a power law distribution with exponent $gammain(3,4)$, the components sizes rescaled by $n^{-(gamma -2)/(gamma-1)}$ converge to the excursion lengths of a certain nontrivial drifted process with independent increments above past minima. We deduce the asymptotic behavior of the component sizes of a critical random simple graph when $
u$ has finite third moment.