Document type
ArticleVersion
Published versionPublication date
All rights reserved
Please use this identifier to cite or link to this item: https://hdl.handle.net/2445/18813
Clustering in complex networks. II. Percolation properties
Journal Title
Director/Tutor
Journal ISSN
Volume Title
Related resource
Abstract
The percolation properties of clustered networks are analyzed in detail. In the case of weak clustering, we present an analytical approach that allows us to find the critical threshold and the size of the giant component. Numerical simulations confirm the accuracy of our results. In more general terms, we show that weak clustering hinders the onset of the giant component whereas strong clustering favors its appearance. This is a direct consequence of the differences in the k-core structure of the networks, which are found to be totally different depending on the level of clustering. An empirical analysis of a real social network confirms our predictions.
Subject
Subject (English)
Citation
Citation
SERRANO MORAL, Ma. Ángeles (María Ángeles) and BOGUÑÁ, Marián. Clustering in complex networks. II. Percolation properties. Physical Review E. 2006. Vol. 74, num. 5, pags. 056115-1-056115-8. ISSN 1063-651X. [consulted: 7 of June of 2026]. Available at: https://hdl.handle.net/2445/18813