An efficient immunization strategy for community networks

Kai Gong, Ming Tang, Pak Ming Hui, Hai Feng Zhang, Younghae Do, Ying-Cheng Lai

Research output: Contribution to journalArticle

44 Scopus citations

Abstract

An efficient algorithm that can properly identify the targets to immunize or quarantine for preventing an epidemic in a population without knowing the global structural information is of obvious importance. Typically, a population is characterized by its community structure and the heterogeneity in the weak ties among nodes bridging over communities. We propose and study an effective algorithm that searches for bridge hubs, which are bridge nodes with a larger number of weak ties, as immunizing targets based on the idea of referencing to an expanding friendship circle as a self-avoiding walk proceeds. Applying the algorithm to simulated networks and empirical networks constructed from social network data of five US universities, we show that the algorithm is more effective than other existing local algorithms for a given immunization coverage, with a reduced final epidemic ratio, lower peak prevalence and fewer nodes that need to be visited before identifying the target nodes. The effectiveness stems from the breaking up of community networks by successful searches on target nodes with more weak ties. The effectiveness remains robust even when errors exist in the structure of the networks.

Original languageEnglish (US)
Article numbere83489
JournalPloS one
Volume8
Issue number12
DOIs
StatePublished - Dec 20 2013

ASJC Scopus subject areas

  • Biochemistry, Genetics and Molecular Biology(all)
  • Agricultural and Biological Sciences(all)
  • General

Fingerprint Dive into the research topics of 'An efficient immunization strategy for community networks'. Together they form a unique fingerprint.

  • Cite this

    Gong, K., Tang, M., Hui, P. M., Zhang, H. F., Do, Y., & Lai, Y-C. (2013). An efficient immunization strategy for community networks. PloS one, 8(12), [e83489]. https://doi.org/10.1371/journal.pone.0083489