Brunel University Research Archive (BURA) >
Schools >
School of Information Systems, Computing and Mathematics >
School of Information Systems, Computing and Mathematics Research Papers >

Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/3831

Title: The clustering coefficient of a scale-free random graph
Authors: Eggemann, N
Noble, S D
Keywords: clustering coefficient
scale-free graph
Barabasi-Albert graph
Publication Date: 2009
Abstract: 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. Bollobas and Riordan have previously shown that when the constant is zero, the same expectation is asymptotically proportional to ((log n)^2)/n.
URI: http://bura.brunel.ac.uk/handle/2438/3831
Appears in Collections:School of Information Systems, Computing and Mathematics Research Papers
Mathematical Science

Files in This Item:

File Description SizeFormat
Fulltext.pdf234.96 kBAdobe PDFView/Open

Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.

 


Library (c) Brunel University.    Powered By: DSpace
Send us your
Feedback. Last Updated: September 14, 2010.
Managed by:
Hassan Bhuiyan