Title
Virus spread in complete bi-partite graphs
Author
TNO Informatie- en Communicatietechnologie
Omic, J.S.
Kooij, R.E.
van Mieghem, P.
Publication year
2007
Abstract
In this paper we study the spread of viruses on the complete bi-partite graph Km,n. Using mean field theory we first show that the epidemic threshold for this type of graph satifies Tc = 1/√MN, hence, confirming previous results from literature. Next, we find an expression for the average number of infected nodes in the steady state. In addition, our model is improved by the introduction of infection delay. We validate our models by means of simulations. Inspired by simulation results, we analyze the probability distribution of the number of infected nodes in the steady state for the case without infection delay. The mathematical model we obtain is able to predict the probability distribution very well, in particular, for large values of the effective spreading rate. It is also shown that the probabilistic analysis and the mean field theory predict the same average number of infected nodes in the steady state. Finally, we present a heuristic for the prediction of the extinction probability in the first phase of the infection. Simulations show that, for the case without infection delay, this time dependent heuristic is quite accurate. © 2007 ICST.
Subject
Computer virus
Epidemiology
Modeling
Simulation
Computer systems
Graph theory
Network protocols
Sensor networks
Viruses
Epidemiology
To reference this document use:
http://resolver.tudelft.nl/uuid:4d35eb2a-d47f-4ca3-8867-1868e1a502e8
DOI
https://doi.org/10.1109/bimnics.2007.4610080
TNO identifier
240522
Publisher
ICST / IEEE, Piscataway, NJ
Source
2nd International Conference on Bio-Inspired Models of Network, Information, and Computing Systems, BIONETICS 2007, 10-12 December 2007, Budapest, Hungary, 49-56
Document type
conference paper