The critical phase for random graphs with a given degree sequence
M Kang, TG Seierstad - Combinatorics, Probability and Computing, 2008 - cambridge.org
M Kang, TG Seierstad
Combinatorics, Probability and Computing, 2008•cambridge.orgWe 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.
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.
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.
Cambridge University Press以上显示的是最相近的搜索结果。 查看全部搜索结果