Component sizes of the random graph outside the scaling window
Probability
2007-05-23 v2 Combinatorics
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.
Keywords
Cite
@article{arxiv.math/0610466,
title = {Component sizes of the random graph outside the scaling window},
author = {Asaf Nachmias and Yuval Peres},
journal= {arXiv preprint arXiv:math/0610466},
year = {2007}
}
Comments
13 pages