Carregant...
Fitxers
Tipus de document
ArticleVersió
Versió publicadaData de publicació
Tots els drets reservats
Si us plau utilitzeu sempre aquest identificador per citar o enllaçar aquest document: https://hdl.handle.net/2445/18814
Tuning clustering in random networks with arbitrary degree distributions
Títol de la revista
Director/Tutor
ISSN de la revista
Títol del volum
Recurs relacionat
Resum
We present a generator of random networks where both the degree-dependent clustering coefficient and the degree distribution are tunable. Following the same philosophy as in the configuration model, the degree distribution and the clustering coefficient for each class of nodes of degree k are fixed ad hoc and a priori. The algorithm generates corresponding topologies by applying first a closure of triangles and second the classical closure of remaining free stubs. The procedure unveils an universal relation among clustering and degree-degree correlations for all networks, where the level of assortativity establishes an upper limit to the level of clustering. Maximum assortativity ensures no restriction on the decay of the clustering coefficient whereas disassortativity sets a stronger constraint on its behavior. Correlation measures in real networks are seen to observe this structural bound.
Matèries
Matèries (anglès)
Citació
Citació
SERRANO MORAL, Ma. ángeles (maría ángeles), BOGUÑÁ, Marián. Tuning clustering in random networks with arbitrary degree distributions. _Physical Review E_. 2005. Vol. 72, núm. 3, pàgs. 036133-1-036133-8. [consulta: 1 de febrer de 2026]. ISSN: 1063-651X. [Disponible a: https://hdl.handle.net/2445/18814]