Component sizes of the random graph outside the scaling window

Simple item page
dc.creatorNachmias, Asaf
dc.creatorPeres, Yuval
dc.date2006-10-16
dc.date2007-01-11
dc.date.accessioned2026-07-07T07:39:45Z
dc.date.available2026-07-07T07:39:45Z
dc.descriptionWe 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.
dc.description13 pages
dc.identifierhttps://arxiv.org/abs/math/0610466
dc.identifierhttp://arxiv.org/abs/math/0610466
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/121568
dc.subjectProbability
dc.subjectCombinatorics
dc.titleComponent sizes of the random graph outside the scaling window
dc.typetext

Files

Collections

arXiv