The viral conductance of a network
Computer Communications
Modeling computer virus with the BSDE approach
Computer Networks: The International Journal of Computer and Telecommunications Networking
Coalescing-branching random walks on graphs
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Generalized epidemic mean-field model for spreading processes over multilayer complex networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
Serious epidemics, both in cyber space as well as in our real world, are expected to occur with high probability, which justifies investigations in virus spread models in (contact) networks. The N-intertwined virus spread model of the SIS-type is introduced as a promising and analytically tractable model of which the steady-state behavior is fairly completely determined. Compared to the exact SIS Markov model, the N-intertwined model makes only one approximation of a mean-field kind that results in upper bounding the exact model for finite network size N and improves in accuracy with N. We review many properties theoretically, thereby showing, besides the flexibility to extend the model into an entire heterogeneous setting, that much insight can be gained that is hidden in the exact Markov model.