Component sizes of the random graph outside the scaling window

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
13 pages

Keywords

Probability, Combinatorics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/121568

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0610466
 http://arxiv.org/abs/math/0610466

Collections

arXiv