The size of the largest component below phase transition in inhomogeneous random graphs

Simple item page
dc.creatorTurova, T. S.
dc.date2007-06-14
dc.date.accessioned2026-07-07T08:10:07Z
dc.date.available2026-07-07T08:10:07Z
dc.descriptionWe study the "rank 1 case" of the inhomogeneous random graph model. In the subcritical case we derive an exact formula for the asymptotic size of the largest connected component scaled to log n. This result is new, it completes the corresponding known result in the supercritical case. We provide some examples of application of a new formula.
dc.description23 pages
dc.identifierhttps://arxiv.org/abs/0706.2106
dc.identifierhttp://arxiv.org/abs/0706.2106
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/131740
dc.subjectProbability
dc.subject60C05; 05C80.
dc.titleThe size of the largest component below phase transition in inhomogeneous random graphs
dc.typetext

Files

Collections

arXiv