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.
Predictive analysis of epidemics often depends on the initial conditions of the outbreak, the structure of the afflicted population, and population size. However, disease outbreaks are subjected to fluctuations that may shape the spreading process. Agent-based epidemic models mitigate the issue by using a transition matrix which replicates stochastic effects observed in real epidemics. They have met considerable numerical success to simulate small scale epidemics. The problem grows exponentially with population size, reducing the usability of agent-based models for large scale epidemics. Here, we present an algorithm that explores permutation symmetries to enhance the computational performance of agent-based epidemic models. Our findings bound the stochastic process to a single eigenvalue sector, scaling down the dimension of the transition matrix to .
We present an algorithm which explores permutation symmetries to describe the time evolution of agent-based epidemic models. The main idea to improve computation times relies on restricting the stochastic process to one sector of the vector space, labeled by a single permutation eigenvalue. In this scheme, the transition matrix reduces to block diagonal form, enhancing computational performance.