Please use this identifier to cite or link to this item:
Title: Deciphering the global organization of clustering in real complex networks
Author: Colomer de Simón, Pol
Serrano Moral, Ma. Ángeles (María Ángeles)
Beiró, Mariano G.
Álvarez-Hamelin, J. Ignacio
Boguñá, Marián
Keywords: Física estadística
Fenòmens crítics (Física)
Xarxes d'ordinadors
Statistical physics
Critical phenomena (Physics)
Computer networks
Issue Date: 28-Aug-2013
Publisher: Nature Publishing Group
Abstract: We uncover the global organization of clustering in real complex networks. To this end, we ask whether triangles in real networks organize as in maximally random graphs with given degree and clustering distributions, or as in maximally ordered graph models where triangles are forced into modules. The answer comes by way of exploring m-core landscapes, where the m-core is defined, akin to the k-core, as the maximal subgraph with edges participating in at least m triangles. This property defines a set of nested subgraphs that, contrarily to k-cores, is able to distinguish between hierarchical and modular architectures. We find that the clustering organization in real networks is neither completely random nor ordered although, surprisingly, it is more random than modular. This supports the idea that the structure of real networks may in fact be the outcome of self-organized processes based on local optimization rules, in contrast to global optimization principles.
Note: Reproducció del document publicat a:
It is part of: Scientific Reports, 2013, vol. 3, num. 2517, p. 1-7
Related resource:
ISSN: 2045-2322
Appears in Collections:Articles publicats en revistes (Física de la Matèria Condensada)

Files in This Item:
File Description SizeFormat 
628351.pdf1.33 MBAdobe PDFView/Open

This item is licensed under a Creative Commons License Creative Commons