Colomer de Simón, PolBoguñá, Marián2015-09-292015-09-292012-08-301539-3755https://hdl.handle.net/2445/67035We 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.5 p.application/pdfeng(c) American Physical Society, 2012Sistemes complexosXarxes d'ordinadorsComplex systemsComputer networksinfo:eu-repo/semantics/article6205042015-09-29info:eu-repo/semantics/openAccess