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 |
Issue 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: | Dept of Mathematics Research Papers Mathematical Sciences |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Fulltext.pdf | 234.96 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.