Hierarchical scale-free network is fragile against random failure

Takehisa Hasegawa and Koji Nemoto
Phys. Rev. E 88, 062807 – Published 6 December 2013

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.

  • Figure
  • Figure
  • Figure
  • Figure
  • Received 19 June 2013

DOI:https://doi.org/10.1103/PhysRevE.88.062807

©2013 American Physical Society

Authors & Affiliations

Takehisa Hasegawa*

  • Graduate School of Information Science, Tohoku University, 6-3-09, Aramaki-Aza-Aoba, Sendai, Miyagi 980-8579, Japan

Koji Nemoto

  • Department of Physics, Hokkaido University, Kita 10 Nisi 8, Kita-ku, Sapporo, Hokkaido 060-0810, Japan

  • *hasegawa@m.tohoku.ac.jp
  • nemoto@statphys.sci.hokudai.ac.jp

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 88, Iss. 6 — December 2013

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review E

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×