arXiv:cond-mat/0603353AbstractReferencesReviewsResources
Percolation and Epidemic Thresholds in Clustered Networks
M. Angeles Serrano, Marian Boguna
Published 2006-03-13, updated 2006-08-18Version 2
We develop a theoretical approach to percolation in random clustered networks. We find that, although clustering in scale-free networks can strongly affect some percolation properties, such as the size and the resilience of the giant connected component, it cannot restore a finite percolation threshold. In turn, this implies the absence of an epidemic threshold in this class of networks extending, thus, this result to a wide variety of real scale-free networks which shows a high level of transitivity. Our findings are in good agreement with numerical simulations.
Comments: 4 Pages and 3 Figures. Final version to appear in PRL
Journal: Physical Review Letters 97, 088701 (2006)
Categories: cond-mat.dis-nn
Keywords: epidemic threshold, real scale-free networks, finite percolation threshold, percolation properties, giant connected component
Tags: journal article
Related articles: Most relevant | Search more
Effects of diffusion rates on epidemic spreads in metapopulation networks
Clustering in complex networks. II. Percolation properties
Epidemic threshold for the SIS model on networks