The Critical Phase for Random Graphs with a Given Degree Sequence

Mihyun Kang, Taral Guldahl Seierstad

Combinatorics Probability Computing · 2007 · 32 citations · 8 references

DOIFull text

Open access

Concepts

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.

References

8