R.D.L. Persoons
Please Note
4 records found
1
We consider temporal networks that are a union of disjoint cliques at all times t. We call temporal networks that consist of disjoint cliques temporal clique graphs. We extend the exact solution of mean-field SIS epidemics with self-infections on the complete graph, derived by Prasse et al. [Chaos 31, 063115 (2021)], to all temporal clique graphs. Temporal clique graphs cover a range of commonplace models of network dynamics, including metapopulation models and specifically random-walker-induced temporal graphs. Since the exact solution of mean-field SIS on temporal clique graphs is piecewise (i.e., given by different functions on different intervals), we apply further approximations and find an approximate expression for the expected fraction of infected individuals, called the prevalence y(t), at all times t, with as parameters only the infection rate β, the curing rate δ, and the average size θj of each clique j in the steady state of the network dynamics. Our strongest assumption is that the contact network is static and in its steady state, effectively ignoring all graph dynamics. Despite the drastic assumptions, in ignoring any temporal aspects of the contact network, the approximation is remarkably accurate, when the number of walkers is high. We assess our prevalence approximation (15) and indicate and explain its accuracy.
Building on the work of Almasan et al. [IEEE Trans. Netw. Sci. Eng. 12, 1649 (2025)10.1109/TNSE.2025.3537162], we propose a continuous-time Markov model for human contact dynamics denoted the continuous random walkers induced temporal graph model (CRWIG). In CRWIG, M walkers move randomly and independently of each other on a Markov graph with N nodes in continuous time. If walkers are in the same state (node of the Markov graph) at time t, a link is created between them in their temporal contact graph G(t), where each walker corresponds to one of the M nodes. We define the exact Markov governing equation that describes the movement of the ensemble of M walkers. We investigate the consequences of the time discretization of CRWIG. We prove that CRWIG is characterized by exponential decay of the initial condition and exponentially tailed intermeeting times of the walkers. We investigate two special cases of CRWIG and derive analytical results supported by simulations. We extend the model to allow for nonexponential sojourn times for the single walkers. The non-Markovian model extension of CRWIG is able to reproduce empirical properties of human mobility observed on data: arbitrary flight length distribution, arbitrary pause-time distribution, and intermeeting time distributions that are power-law with an exponential tail.
Transition from time-variant to static networks
Timescale separation in N -intertwined mean-field approximation of susceptible-infectious-susceptible epidemics
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 analyzed 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 T(r) and T¯(r) as the boundaries between the intermediate regime and the annealed (fast changing network) and quenched (static network) regimes, respectively, for a fixed accuracy tolerance r. By analyzing the convergence of static NIMFA processes, we analytically derive upper and lower bounds for T¯(r). Our results provide insights and 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 T¯(r) is almost entirely determined by the basic reproduction number R0 of the network. The value of the upper-transition time T¯(r) 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.
Finding the source of an epidemic is important, because correct source identification can help to stop a budding epidemic or prevent new ones. We investigate the backward equations of the N-intertwined mean-field approximation susceptible-infectious-susceptible (SIS) process. The backward equations allow us to trace the epidemic back to its source on networks of sizes up to at least N=1500. Additionally, we show that the source of the "more realistic"Markovian SIS model cannot feasibly be found, even in a "best-case scenario,"where the infinitesimal generator Q, which completely describes the epidemic process and the underlying contact network, is known. The Markovian initial condition s(0), which reveals the epidemic source, can be found analytically when the viral state vector s(t) is known at some time t as s(0)=s(t)e-Qt. However, s(0) can hardly be computed, except for small times t. The numerical errors are largely due to the matrix exponential e-Qt, which is severely ill-behaved.