Please use this identifier to cite or link to this item:
Title: Clustering of random scale-free networks
Author: Colomer de Simón, Pol
Boguñá, Marián
Keywords: Sistemes complexos
Xarxes d'ordinadors
Complex systems
Computer networks
Issue Date: 30-Aug-2012
Publisher: American Physical Society
Abstract: We derive the finite-size dependence of the clustering coefficient of scale-free random graphs generated by the configuration model with degree distribution exponent 2<γ<3. Degree heterogeneity increases the presence of triangles in the network up to levels that compare to those found in many real networks even for extremely large nets. We also find that for values of γ≈2, clustering is virtually size independent and, at the same time, becomes a de facto non-self-averaging topological property. This implies that a single-instance network is not representative of the ensemble even for very large network sizes.
Note: Reproducció del document publicat a:
It is part of: Physical Review E, 2012, vol. 86, p. 026120-1-026120-5
Related resource:
ISSN: 1539-3755
Appears in Collections:Articles publicats en revistes (Física de la Matèria Condensada)

Files in This Item:
File Description SizeFormat 
620504.pdf229.28 kBAdobe PDFView/Open

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