Efficient method for comprehensive computation of agent-level epidemic dissemination in networks

Authored by Gilberto M Nakamura, Ana Carolina P Monteiro, George C Cardoso, Alexandre S Martinez

Date Published: 2017

DOI: 10.1038/srep40885

Sponsors: Brazilian National Council for Scientific and Technological Development (CNPq)

Platforms: No platforms listed

Model Documentation: Other Narrative Mathematical description

Model Code URLs: Model code not found

Abstract

Susceptible-infected (SI) and susceptible-infected-susceptible (SIS) are simple agent-based models often employed in epidemic studies. Both models describe the time evolution of infectious diseases in networks whose vertices are either susceptible (S) or infected (I) agents. Precise estimation for disease spreading is one of the major goals in epidemic studies but often restricted to heavy numerical simulations. Analytic methods using operatorial content are subject to the asymmetric eigenvalue problem, limiting the use of perturbative methods. Numerical methods are limited to small populations, since the vector space increases exponentially with population size N. Here, we propose the use of the squared norm of the probability vector to obtain an algebraic equation, which permits the evaluation of stationary states in Markov processes. The equation requires the eigenvalues of symmetrized time generators and takes full advantage of symmetries, reducing the time evolution to an O(N) sparse problem. The calculation of eigenvalues employs quantum many-body techniques, while the standard perturbation theory accounts for small modifications to the network topology.

Tags

Complex networks models statistics Spread