The Critical Phase for Random Graphs with a Given Degree Sequence
M. KANG, T. G. SEIERSTAD
Source record
Source: Crossref
Published: Jan 1, 2008
DOI: 10.1017/s096354830700867x
Open original source ↗Source abstract
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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.