Repository hosted by TU Delft Library

Home · Contact · About · Disclaimer ·
 

A new metric for robustness with respect to virus spread

Attachments

Author: Kooij, R.E. · Schumm, P. · Scoglio, C. · Youssef, M.
Type:article
Date:2009
Institution: TNO Informatie- en Communicatietechnologie
Source:8th International IFIP-TC 6 Networking Conference, NETWORKING 2009, 11-15 May 2009, Aachen, Germany, 562-572
series:
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Identifier: 241645
doi: doi:10.1007/978-3-642-01399-7_44
Keywords: Informatics · Robustness · Virus spread · Adjacency matrices · Complete bipartite graphs · Epidemic threshold · Largest eigenvalue · Regular graphs · Spreading rate · Viral conductance · Eigenvalues and eigenfunctions · Epidemiology · Computer viruses

Abstract

The robustness of a network is depending on the type of attack we are considering. In this paper we focus on the spread of viruses on networks. It is common practice to use the epidemic threshold as a measure for robustness. Because the epidemic threshold is inversely proportional to the largest eigenvalue of the adjacency matrix, it seems easy to compare the robustness of two networks. We will show in this paper that the comparison of the robustness with respect to virus spread for two networks actually depends on the value of the effective spreading rate τ. For this reason we propose a new metric, the viral conductance, which takes into account the complete range of values τ can obtain. In this paper we determine the viral conductance of regular graphs, complete bipartite graphs and a number of realistic networks. © IFIP International Federation for Information Processing 2009.