2006/08/17 by M. Angeles Serrano, M. Ángeles Serrano, Marian Boguna +1
Mathematics · Physics and Astronomy · #Complex Network Analysis Techniques #Opinion Dynamics and Social Influence #advanced mathematical theories #cond-mat.dis-nn
paper · pdf · doi:10.1103/physreve.74.056115
published as Physical Review E 74, 056115 (2006) · Updated reference list
arxiv created 2006/08/17 · openalex publication_date 2006/11/28 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.