Transition from time-variant to static networks: timescale separation in NIMFA SIS epidemics
arXiv:2305.12446 · doi:10.1103/PhysRevE.109.034308
Abstract
We extend the N-Intertwined Mean-Field Approximation (NIMFA) for the Susceptible-Infectious-Susceptible (SIS) epidemiological process to time-varying networks. Processes on time-varying networks are often analysed under the assumption that the process and network evolution happen on different timescales. This approximation is called timescale separation. We investigate timescale separation between disease spreading and topology updates of the network. We introduce the transition times and as the boundaries between the intermediate regime and the annealed (fast changing network) and quenched (static network) regimes, respectively, for a fixed accuracy tolerance . By analysing the convergence of static NIMFA processes, we analytically derive upper and lower bounds for . Our results provide insights/bounds on the time of convergence to the steady state of the static NIMFA SIS process. We show that, under our assumptions, the upper-transition time is almost entirely determined by the basic reproduction number of the network. The value of the upper-transition time around the epidemic threshold is large, which agrees with the current understanding that some real-world epidemics cannot be approximated with the aforementioned timescale separation.
arXiv comment20 pages, 13 figures
References in corpus (13)
- Epidemic spreading in scale-free networks
- Epidemic processes in complex networks
- Temporal Networks
- Epidemic dynamics and endemic states in complex networks
- Activity driven modeling of time varying networks
- Modern temporal network theory: A colloquium
- Temporal Gillespie algorithm: Fast simulation of contagion processes on time-varying networks
- Stability of Spreading Processes over Time-Varying Large-Scale Networks
- Birth and death of links control disease spreading in empirical contact networks
- Epidemic Threshold in Continuous-Time Evolving Networks
- Epidemic spreading in evolving networks
- Universal mean-field framework for SIS epidemics on networks, based on graph partitioning and the isoperimetric inequality
- Clustering for epidemics on networks: a geometric approach