Relevance of temporal cores for epidemic spread in temporal networks
arXiv:2003.09377 · doi:10.1038/s41598-020-69464-3
Abstract
Temporal networks are widely used to represent a vast diversity of systems, including in particular social interactions, and the spreading processes unfolding on top of them. The identification of structures playing important roles in such processes remains largely an open question, despite recent progresses in the case of static networks. Here, we consider as candidate structures the recently introduced concept of span-cores: the span-cores decompose a temporal network into subgraphs of controlled duration and increasing connectivity, generalizing the core-decomposition of static graphs. To assess the relevance of such structures, we explore the effectiveness of strategies aimed either at containing or maximizing the impact of a spread, based respectively on removing span-cores of high cohesiveness or duration to decrease the epidemic risk, or on seeding the process from such structures. The effectiveness of such strategies is assessed in a variety of empirical data sets and compared to baselines that use only static information on the centrality of nodes and static concepts of coreness, as well as to a baseline based on a temporal centrality measure. Our results show that the most stable and cohesive temporal cores play indeed an important role in epidemic processes on temporal networks, and that their nodes are likely to represent influential spreaders.
References in corpus (26)
- Epidemic processes in complex networks
- Identification of influential spreaders in complex networks
- Temporal Networks
- Immunization of complex networks
- Efficient Immunization Strategies for Computer Networks and Populations
- High-resolution measurements of face-to-face contact patterns in a primary school
- What's in a crowd? Analysis of face-to-face behavioral networks
- Modern temporal network theory: A colloquium
- Contact patterns in a high school: a comparison between data collected using wearable sensors, contact diaries and friendship surveys
- Estimating Potential Infection Transmission Routes in Hospital Wards Using Wearable Proximity Sensors
- Detecting the community structure and activity patterns of temporal networks: a non-negative tensor factorization approach
- Can co-location be used as a proxy for face-to-face contacts?
- Mitigation of infectious disease at school: targeted class closure vs school closure
- Controlling Contagion Processes in Time-Varying Networks
- Data on face-to-face contacts in an office building suggests a low-cost vaccination strategy based on community linkers
- Optimizing surveillance for livestock disease spreading through animal movements
- Competing activation mechanisms in epidemics on networks
- Exploiting temporal network structures of human interaction to effectively immunize populations
- Immunization strategies for epidemic processes in time-varying contact networks
- Predicting epidemic risk from past temporal contact data
- Cost-efficient vaccination protocols for network epidemiology
- Activity clocks: spreading dynamics on temporal networks of human contact
- Mining (maximal) span-cores from temporal networks
- Fundamental difference between superblockers and superspreaders in networks
- Systematic comparison between methods for the detection of influential spreaders in complex networks
- Infection propagator approach to compute epidemic thresholds on temporal networks: impact of immunity and of limited temporal resolution
Cited by in corpus (9)
- Hyper-cores promote localization and efficient seeding in higher-order processes
- The Temporal Rich Club Phenomenon
- From temporal network data to the dynamics of social relationships
- Infection patterns in simple and complex contagion processes on networks
- Modelling virus spreading in ride-pooling networks
- The structural evolution of temporal hypergraphs through the lens of hyper-cores
- Generating surrogate temporal networks from mesoscale building blocks
- Dynamic models of gentrification
- Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees