The Structure of Spreading on Temporal Networks

Abstract

The physics of spreading in static networks is well understood through mappings to percolation. We show that spreading dynamics on temporal networks can analogously be mapped to reachability in temporal event graphs. This provides a theoretical and computational framework for a class of processes, such as variants of the susceptible-infected-susceptible model. Without explicit simulations, through the component analysis of event graphs, we obtain epidemic prevalence and derive epidemic thresholds for temporal networks with arbitrary degree and inter-event time distributions, with significant computational advantages as compared to explicit simulations.