The Clustering Coefficient of a Scale-Free Random Graph

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We 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.
17 pages. Submitted

Keywords

Combinatorics, 05C80 (Primary) 68R10, 60C05 (Secondary)

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/159146

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0804.3032
 http://arxiv.org/abs/0804.3032

Collections

arXiv