The clustering coefficient of a scale-free random graph

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

Full metadata record

DC Field	Value	Language
dc.contributor.author	Eggemann, N	-
dc.contributor.author	Noble, S D	-
dc.coverage.spatial	15	-
dc.date.accessioned	2009-11-11T16:03:05Z	-
dc.date.available	2009-11-11T16:03:05Z	-
dc.date.issued	2009	-
dc.identifier.uri	http://bura.brunel.ac.uk/handle/2438/3831	-
dc.description.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.	en
dc.language.iso	en	en
dc.subject	clustering coefficient	en
dc.subject	scale-free graph	en
dc.subject	Barabasi-Albert graph	en
dc.title	The clustering coefficient of a scale-free random graph	en
dc.type	Preprint	en
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