The Critical Phase for Random Graphs with a Given Degree Sequence
The Critical Phase for Random Graphs with a Given Degree Sequence
复制标题
给定度数序列随机图的关键阶段
DOI：
--
复制
发表时间：
2008
期刊：
影响因子：
--
通讯作者：
T. G. Seierstad
中科院分区：
文献类型：
--
作者：
Mihyun Kang;T. G. Seierstad
我们考虑具有固定度数序列的随机图。 Molloy 和 Reed [11, 12] 研究了巨型组件的尺寸如何根据度数条件变化。他们表明存在相变，并研究了关键相前后组分的顺序。在本文中，我们使用分支过程的生成函数的奇异性分析来更仔细地研究关键阶段的组件顺序，该分支过程用给定的度数序列对随机图进行建模。
We consider random graphs with a fixed degree sequence. Molloy and Reed [11, 12] studied how the size of the giant component changes according to degree conditions. They showed that there is a phase transition and investigated the order of components before and after the critical phase. In this paper we study more closely the order of components at the critical phase, using singularity analysis of a generating function for a branching process which models the random graph with a given degree sequence.