Network immunization under limited budget using graph spectra

Zahedi, R ; Sharif University of Technology

365 Viewed
  1. Type of Document: Article
  2. DOI: 10.1142/S0129183116500960
  3. Publisher: World Scientific Publishing Co. Pte Ltd
  4. Abstract:
  5. In this paper, we propose a new algorithm that minimizes the worst expected growth of an epidemic by reducing the size of the largest connected component (LCC) of the underlying contact network. The proposed algorithm is applicable to any level of available resources and, despite the greedy approaches of most immunization strategies, selects nodes simultaneously. In each iteration, the proposed method partitions the LCC into two groups. These are the best candidates for communities in that component, and the available resources are sufficient to separate them. Using Laplacian spectral partitioning, the proposed method performs community detection inference with a time complexity that rivals that of the best previous methods. Experiments show that our method outperforms targeted immunization approaches in both real and synthetic networks
  6. Keywords:
  7. Community ; Complex networks ; Graph spectra ; Immunization
  8. Source: International Journal of Modern Physics C ; Volume 27, Issue 8 , 2016 ; 01291831 (ISSN)
  9. URL: http://www.worldscientific.com/doi/abs/10.1142/S0129183116500960