Clustering of random scale-free networks
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...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2012 |
| País: | España |
| Institución: | Universidad de Barcelona |
| Repositorio: | Dipòsit Digital de la UB |
| OAI Identifier: | oai:diposit.ub.edu:2445/67035 |
| Acceso en línea: | https://hdl.handle.net/2445/67035 |
| Access Level: | acceso abierto |
| Palabra clave: | Sistemes complexos Xarxes d'ordinadors Complex systems Computer networks |
| Sumario: | 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. |
|---|