Growth of preferential attachment random graphs via continuous-time branching processes

Simple item page
dc.creatorAthreya, K. B.
dc.creatorGhosh, A. P.
dc.creatorSethuraman, S.
dc.date2007-01-23
dc.date.accessioned2026-07-07T07:42:40Z
dc.date.available2026-07-07T07:42:40Z
dc.descriptionA version of ``preferential attachment'' random graphs, corresponding to linear ``weights'' with random ``edge additions,'' which generalizes some previously considered models, is studied. This graph model is embedded in a continuous-time branching scheme and, using the branching process apparatus, several results on the graph model asymptotics are obtained, some extending previous results, such as growth rates for a typical degree and the maximal degree, behavior of the vertex where the maximal degree is attained, and a law of large numbers for the empirical distribution of degrees which shows certain ``scale-free'' or ``power-law'' behaviors.
dc.description20 pages
dc.identifierhttps://arxiv.org/abs/math/0701649
dc.identifierhttp://arxiv.org/abs/math/0701649
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/122529
dc.subjectProbability
dc.subject05C80, 60J85
dc.titleGrowth of preferential attachment random graphs via continuous-time branching processes
dc.typetext

Files

Collections

arXiv