Percolation and blind spots in complex networks

Liang Huang, Ying-Cheng Lai, Kwangho Park, Junshan Zhang

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Recent works on network security have focused on whether a complex network can maintain its integrability under attack or random node failures. In applications of increasing importance such as sensor networks, a somewhat different problem, namely, the occurrence of isolated nodes (or blind spots), is of great interest. We show that, for networks with a stronger ability to form global spanning clusters, it is relatively more difficult to eliminate blind spots, and vice versa. We use the framework of percolation to investigate this phenomenon. Our analysis also yields a formula for the average number of blind spots, which provide an explanation for several numerical findings.

Original languageEnglish
Article number066131
Pages (from-to)-
Number of pages5
JournalPhysical Review. E, Statistical, Nonlinear and Soft Matter Physics
Volume73
Issue number6
DOIs
Publication statusPublished - Jun 2006

Keywords

  • INTERNET
  • ROBUSTNESS
  • ATTACK

Cite this

Percolation and blind spots in complex networks. / Huang, Liang; Lai, Ying-Cheng; Park, Kwangho; Zhang, Junshan.

In: Physical Review. E, Statistical, Nonlinear and Soft Matter Physics, Vol. 73, No. 6, 066131, 06.2006, p. -.

Research output: Contribution to journalArticle

Huang, Liang ; Lai, Ying-Cheng ; Park, Kwangho ; Zhang, Junshan. / Percolation and blind spots in complex networks. In: Physical Review. E, Statistical, Nonlinear and Soft Matter Physics. 2006 ; Vol. 73, No. 6. pp. -.
@article{efede523c7364ab084e1e438615dfa06,
title = "Percolation and blind spots in complex networks",
abstract = "Recent works on network security have focused on whether a complex network can maintain its integrability under attack or random node failures. In applications of increasing importance such as sensor networks, a somewhat different problem, namely, the occurrence of isolated nodes (or blind spots), is of great interest. We show that, for networks with a stronger ability to form global spanning clusters, it is relatively more difficult to eliminate blind spots, and vice versa. We use the framework of percolation to investigate this phenomenon. Our analysis also yields a formula for the average number of blind spots, which provide an explanation for several numerical findings.",
keywords = "INTERNET, ROBUSTNESS, ATTACK",
author = "Liang Huang and Ying-Cheng Lai and Kwangho Park and Junshan Zhang",
year = "2006",
month = "6",
doi = "10.1103/PhysRevE.73.066131",
language = "English",
volume = "73",
pages = "--",
journal = "Physical Review. E, Statistical, Nonlinear and Soft Matter Physics",
issn = "1539-3755",
publisher = "AMER PHYSICAL SOC",
number = "6",

}

TY - JOUR

T1 - Percolation and blind spots in complex networks

AU - Huang, Liang

AU - Lai, Ying-Cheng

AU - Park, Kwangho

AU - Zhang, Junshan

PY - 2006/6

Y1 - 2006/6

N2 - Recent works on network security have focused on whether a complex network can maintain its integrability under attack or random node failures. In applications of increasing importance such as sensor networks, a somewhat different problem, namely, the occurrence of isolated nodes (or blind spots), is of great interest. We show that, for networks with a stronger ability to form global spanning clusters, it is relatively more difficult to eliminate blind spots, and vice versa. We use the framework of percolation to investigate this phenomenon. Our analysis also yields a formula for the average number of blind spots, which provide an explanation for several numerical findings.

AB - Recent works on network security have focused on whether a complex network can maintain its integrability under attack or random node failures. In applications of increasing importance such as sensor networks, a somewhat different problem, namely, the occurrence of isolated nodes (or blind spots), is of great interest. We show that, for networks with a stronger ability to form global spanning clusters, it is relatively more difficult to eliminate blind spots, and vice versa. We use the framework of percolation to investigate this phenomenon. Our analysis also yields a formula for the average number of blind spots, which provide an explanation for several numerical findings.

KW - INTERNET

KW - ROBUSTNESS

KW - ATTACK

U2 - 10.1103/PhysRevE.73.066131

DO - 10.1103/PhysRevE.73.066131

M3 - Article

VL - 73

SP - -

JO - Physical Review. E, Statistical, Nonlinear and Soft Matter Physics

JF - Physical Review. E, Statistical, Nonlinear and Soft Matter Physics

SN - 1539-3755

IS - 6

M1 - 066131

ER -