Hierarchical scale-free network is fragile against random failure

Abstract

We investigate site percolation in a hierarchical scale-free network known as the Dorogovtsev- Goltsev-Mendes network. We use the generating function method to show that the percolation threshold is 1, i.e., the system is not in the percolating phase when the occupation probability is less than 1. The present result is contrasted to bond percolation in the same network of which the percolation threshold is zero. We also show that the percolation threshold of intentional attacks is 1. Our results suggest that this hierarchical scale-free network is very fragile against both random failure and intentional attacks. Such a structural defect is common in many hierarchical network models.

11 pages, 4 figures

References in corpus (10)

• Critical phenomena in complex networks
• Fractal and Transfractal Recursive Scale-Free Nets
• Percolation on correlated networks
• Bond percolation on a class of clustered random networks
• Percolation in Hierarchical Scale-Free Nets
• Small-World Bonds and Patchy Percolation on the Hanoi Network
• Monte-Carlo simulation study of the two-stage percolation transition in enhanced binary trees
• Generating-function approach for bond percolations in hierarchical networks
• Critical Phase of Bond Percolations on Growing Networks
• Absence of the non-percolating phase for percolation on the non-planar Hanoi network

Cited by in corpus (7)

• Percolation on complex networks: Theory and application
• Scaling of Clusters near Discontinuous Percolation Transitions in Hyperbolic Networks
• Renormalization group theory of percolation on pseudo-fractal simplicial and cell complexes
• Real-Space Renormalization Group for Spectral Properties of Hierarchical Networks
• Degree-ordered percolation on hierarchical scale-free network
• Fractality of Massive Graphs: Scalable Analysis with Sketch-Based Box-Covering Algorithm
• Deterministic simplicial complexes