Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Mapping temporal-network percolation to weighted, static event graphs

Mikko Kivelä 1 Jordan Cambe 1, 2 Jari Saramäki 1 Márton Karsai 2
2 DANTE - Dynamic Networks : Temporal and Structural Capture Approach
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme, IXXI - Institut Rhône-Alpin des systèmes complexes
Abstract : Many processes of spreading and diffusion take place on temporal networks, and their outcomes are influenced by correlations in the times of contact. These correlations have a particularly strong influence on processes where the spreading agent has a limited lifetime at nodes: disease spreading (recovery time), diffusion of rumors (lifetime of information), and passenger routing (maximum acceptable time between transfers). Here, we introduce weighted event graphs as a powerful and fast framework for studying connectivity determined by time-respecting paths where the allowed waiting times between contacts have an upper limit. We study percolation on the weighted event graphs and in the underlying temporal networks, with simulated and real-world networks. We show that this type of temporal-network percolation is analogous to directed percolation, and that it can be characterized by multiple order parameters.
Complete list of metadata
Contributor : Márton Karsai Connect in order to contact the contributor
Submitted on : Thursday, October 5, 2017 - 11:11:03 AM
Last modification on : Wednesday, November 3, 2021 - 7:30:51 AM

Links full text


  • HAL Id : hal-01610945, version 1
  • ARXIV : 1709.05647


Mikko Kivelä, Jordan Cambe, Jari Saramäki, Márton Karsai. Mapping temporal-network percolation to weighted, static event graphs. 2017. ⟨hal-01610945⟩



Les métriques sont temporairement indisponibles