Component sizes of the random graph outside the scaling window
Abstract
We provide simple proofs describing the behavior of the largest component of the Erdos-Renyi random graph G(n,p) outside of the scaling window, p={1+\eps(n) \over n} where \eps(n) tends to 0, but \eps(n)n^{1/3} tends to \infty.
Related Researches
Submitted on 16 Oct 2006 (v1), last revised 11 Jan 2007 (this version, v2)
Updated
arXiv.org
Original Source