Percolation in self-similar networks

2010/10/31 by M. Angeles Serrano, Dmitri Krioukov, Marian Boguna · 1 citation
Physics and Astronomy · Computer Science · #cond-mat.dis-nn #cs.SI #physics.soc-ph

paper · pdf · doi:10.1103/physrevlett.106.048701

published as Phys. Rev. Lett. 106, 048701 (2011) · 4 pages, 3 figures

arxiv created 2011/01/27 · arxiv updated 2011/01/28

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.

Cited by

• Escaping the avalanche collapse in self-similar multiplexes

Related

• Scale-free percolation in continuum space: quenched degree and clustering coefficient
• Shortest-path percolation on scale-free networks
• Self-similarity of complex networks and hidden metric spaces
• Explosive Percolation in Scale-Free Networks
• Percolation transition in networks with degree-degree correlation