A point process describing the component sizes in the critical window of the random graph evolution

Simple item page
dc.creatorJanson, Svante
dc.creatorSpencer, Joel
dc.date2005-05-25
dc.date.accessioned2026-07-07T05:20:15Z
dc.date.available2026-07-07T05:20:15Z
dc.descriptionWe study a point process describing the asymptotic behavior of sizes of the largest components of the random graph G(n,p) in the critical window p=n^{-1}+lambda n^{-4/3}. In particular, we show that this point process has a surprising rigidity. Fluctuations in the large values will be balanced by opposite fluctuations in the small values such that the sum of the values larger than a small epsilon is almost constant.
dc.description25 pages
dc.identifierhttps://arxiv.org/abs/math/0505529
dc.identifierhttp://arxiv.org/abs/math/0505529
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/75309
dc.subjectProbability
dc.subjectCombinatorics
dc.subject60C05, 60K99, 05C80
dc.titleA point process describing the component sizes in the critical window of the random graph evolution
dc.typetext

Files

Collections

arXiv