By Topic

Virus spread in complete bi-partite graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Omic, J.S. ; Fac. of Electr. Eng., Delft Univ. of Technol., Delft ; Kooij, R.E. ; Van Mieghem, P.

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 tauc = 1/radic(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.

Published in:

Bio-Inspired Models of Network, Information and Computing Systems, 2007. Bionetics 2007. 2nd

Date of Conference:

10-12 Dec. 2007