Hierarchical scale-free network is fragile against random failure.
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.
Graduate School of Information Science, Tohoku University, 6-3-09, Aramaki-Aza-Aoba, Sendai, Miyagi 980-8579, Japan.
Takehisa
T
Hasegawa
Department of Physics, Hokkaido University, Kita 10 Nisi 8, Kita-ku, Sapporo, Hokkaido 060-0810, Japan.
Koji
K
Nemoto