Percolation in self-similar networks

Abstract

We provide a simple proof that graphs in a general class of self-similar networks have zero percolation threshold. The considered self-similar networks include random scale-free graphs with given expected node degrees and zero clustering, scale-free graphs with finite clustering and metric structure, growing scale-free networks, and many real networks. The proof and the derivation of the giant component size do not require the assumption that networks are treelike. Our results rely only on the observation that self-similar networks possess a hierarchy of nested subgraphs whose average degree grows with their depth in the hierarchy. We conjecture that this property is pivotal for percolation in networks.

4 pages, 3 figures

References in corpus (11)

• Critical phenomena in complex networks
• Random graphs with clustering
• Self-similarity of complex networks and hidden metric spaces
• Maximum likelihood: extracting unbiased information from complex networks
• Percolation and Epidemic Thresholds in Clustered Networks
• Clustering in complex networks. I. General formalism
• Percolation on correlated networks
• Clustering in complex networks. II. Percolation properties
• Langevin approach for the dynamics of the contact process on annealed scale-free networks
• Bond percolation on a class of clustered random networks
• Critical phenomena on heterogeneous small-world networks