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 and over the lattice which can be considered as the limit when the torus length goes to infinity. We consider the popular Susceptible-Infected-Susceptible spreading model as the metric for information spreading. 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 lower bounds for its computation. These expressions allow us to estimate their spectral radius and thus how the information spreads on these networks.
Alonso Silva is currently a Member of Technical Staff at Bell Labs (Alcatel-Lucent), France in the department of Mathematics of Dynamic Networks. He is also member of the Laboratory of Information, Networking and Communication Sciences (LINCS). He has previously worked as a postdoctoral researcher in the Department of Electrical Engineering and Computer Sciences at the University of California, Berkeley and at INRIA. He did his Ph.D. at INRIA and he obtained his Ph.D. degree in Physics from the École Supérieure d’Électricité in 2010. He received his B.Sc. and Mathematical Engineering degree from the Department of Mathematical Engineering (DIM) at the Universidad de Chile in 2004 and 2006, respectively. He is interested on (but not limited to) game theory, social networks, and network economics.