Information Spreading on Almost Torus Networks

Epidemic modeling has been extensively used in the last years in the field of telecommunications and computer networks. In this work, we analyze information spreading on a particular class of networks denoted almost torus networks. We consider the popular Susceptible-Infected-Susceptible spreading model. Almost torus networks consist on the torus network topology where some nodes or edges have been removed. We find explicit expressions for the characteristic polynomial of these graphs and tight upper and lower bounds for its computation. These expressions allow us to estimate their spectral radius and thus how the information spreads on these networks.