DMTCS Proceedings, Discrete Random Walks, DRW'03

Rigorous Result for the CHKNS Random Graph Model

Rick Durrett

Abstract

We study the phase transition in a random graph in which vertices and edges are added at constant rates. Two recent papers in Physical Review E by Callaway, Hopcroft, Kleinberg, Newman, and Strogatz, and Dorogovstev, Mendes, and Samukhin have computed the critical value of this model, shown that the fraction of vertices in finite clusters is infinitely differentiable at the critical value, and that in the subcritical phase the cluster size distribution has a polynomial decay rate with a continuously varying power. Here we sketch rigorous proofs for the first and third results and a new estimates about connectivity probabilities at the critical value.