Effects of concurrency on epidemic spreading in Markovian temporal networks
arXiv:2201.00754 · doi:10.1017/S095679252300027X
Abstract
The concurrency of edges, quantified by the number of edges that share a common node at a given time point, may be an important determinant of epidemic processes in temporal networks. We propose theoretically tractable Markovian temporal network models in which each edge flips between the active and inactive states in continuous time. The different models have different amounts of concurrency while we can tune the models to share the same statistics of edge activation and deactivation (and hence the fraction of time for which each edge is active) and the structure of the aggregate (i.e., static) network. We analytically calculate the amount of concurrency of edges sharing a node for each model. We then numerically study effects of concurrency on epidemic spreading in the stochastic susceptible-infectious-susceptible and susceptible-infectious-recovered dynamics on the proposed temporal network models. We find that the concurrency enhances epidemic spreading near the epidemic threshold while this effect is small in many cases. Furthermore, when the infection rate is substantially larger than the epidemic threshold, the concurrency suppresses epidemic spreading in a majority of cases. In sum, our numerical simulations suggest that the impact of concurrency on enhancing epidemic spreading within our model is consistently present near the epidemic threshold but modest. The proposed temporal network models are expected to be useful for investigating effects of concurrency on various collective dynamics on networks including both infectious and other dynamics.
arXiv comment9 figures
References in corpus (19)
- Emergence of scaling in random networks
- Epidemic spreading in scale-free networks
- Finding community structure in networks using the eigenvectors of matrices
- Epidemic processes in complex networks
- Temporal Networks
- Modern temporal network theory: A colloquium
- Optimal Resource Allocation for Network Protection Against Spreading Processes
- Random graph models for dynamic networks
- Bursty Human Dynamics
- Non-backtracking random walks mix faster
- A Gillespie algorithm for non-Markovian stochastic processes
- Concurrency-induced transitions in epidemic dynamics on temporal networks
- Concurrency measures in the era of temporal network epidemiology: A review
- Gillespie algorithms for stochastic multiagent dynamics in populations and network
- Generative models of simultaneously heavy-tailed distributions of inter-event times on nodes and edges
- Saturation Effects and the Concurrency Hypothesis: Insights from an Analytic Model
- Second-Order Moment-Closure for Tighter Epidemic Thresholds
- Exploring concurrency and reachability in the presence of high temporal resolution
- Analysis of the susceptible-infected-susceptible epidemic dynamics in networks via the non-backtracking matrix