Hierarchical scale-free network is fragile against random failure
arXiv:1312.2336 · doi:10.1103/PhysRevE.88.062807
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.
arXiv comment11 pages, 4 figures
References in corpus (31)
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Error and attack tolerance of complex networks
- Network robustness and fragility: Percolation on random graphs
- Resilience of the Internet to random breakdowns
- Critical phenomena in complex networks
- Hierarchical Organization in Complex Networks
- Breakdown of the Internet under intentional attack
- Pseudofractal Scale-free Web
- Properties of highly clustered networks
- Deterministic Scale-Free Networks
- Are randomly grown graphs really random?
- Fractal and Transfractal Recursive Scale-Free Nets
- Percolation on correlated networks
- Anomalous percolating properties of growing networks
- How clustering affects the bond percolation threshold in complex networks
- Robustness of onion-like correlated networks against targeted attacks
- Bond percolation on a class of clustered random networks
- Ordinary Percolation with Discontinuous Transitions
- Percolation in Hierarchical Scale-Free Nets
- Phase Transitions on Nonamenable Graphs
- Small-World Bonds and Patchy Percolation on the Hanoi Network
- Monte-Carlo simulation study of the two-stage percolation transition in enhanced binary trees
- Analytical results for bond percolation and k-core sizes on clustered networks
- Generating-function approach for bond percolations in hierarchical networks
- Renormalization group for evolving networks
- Properties of a random attachment growing network
- Critical Phase of Bond Percolations on Growing Networks
- Profile and scaling of the fractal exponent of percolations in complex networks
- Absence of the non-percolating phase for percolation on the non-planar Hanoi network
- Phase transition without global ordering in a hierarchical scale-free 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