Percolation and Epidemic Thresholds in Clustered Networks

Abstract

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.

4 Pages and 3 Figures. Final version to appear in PRL

Cited by in corpus (15)

• Critical phenomena in complex networks
• Predicting the size and probability of epidemics in a population with heterogeneous infectiousness and susceptibility
• Clustering in complex networks. I. General formalism
• Clustering in complex networks. II. Percolation properties
• Bond percolation on a class of clustered random networks
• Percolation in Hierarchical Scale-Free Nets
• Percolation transition in networks with degree-degree correlation
• Percolation in self-similar networks
• Transport on weighted Networks: when correlations are independent of degree
• Fractal scale-free networks resistant to disease spread
• Interfaces and the edge percolation map of random directed networks
• Different thresholds of bond percolation in scale-free networks with identical degree sequence
• Scaling of critical connectivity of mobile ad hoc communication networks
• Critical behavior and correlations on scale-free small-world networks. Application to network design
• Critical behavior of the contact process in a multiscale network