The Clustering Coefficient of a Scale-Free Random Graph

Simple item page
dc.creatorEggemann, Nicole
dc.creatorNoble, Steven D.
dc.date2008-04-18
dc.date.accessioned2026-07-07T09:33:28Z
dc.date.available2026-07-07T09:33:28Z
dc.descriptionWe consider a random graph process in which, at each time step, a new vertex is added with m out-neighbours, chosen with probabilities proportional to their degree plus a strictly positive constant. We show that the expectation of the clustering coefficient of the graph process is asymptotically proportional to log n/n. Bollobás and Riordan have previously shown that when the constant is zero, the same expectation is asymptotically proportional to ((log n)^2)/n.
dc.description17 pages. Submitted
dc.identifierhttps://arxiv.org/abs/0804.3032
dc.identifierhttp://arxiv.org/abs/0804.3032
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/159146
dc.subjectCombinatorics
dc.subject05C80 (Primary) 68R10, 60C05 (Secondary)
dc.titleThe Clustering Coefficient of a Scale-Free Random Graph
dc.typetext

Files

Collections

arXiv