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.
Liste complète des métadonnées

https://hal.inria.fr/hal-01610945
Contributeur : Márton Karsai <>
Soumis le : jeudi 5 octobre 2017 - 11:11:03
Dernière modification le : mercredi 19 septembre 2018 - 10:01:23

Lien texte intégral

Identifiants

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

Citation

Mikko Kivelä, Jordan Cambe, Jari Saramäki, Márton Karsai. Mapping temporal-network percolation to weighted, static event graphs. 12 pages, 3 figures. 2017. 〈hal-01610945〉

Partager

Métriques

Consultations de la notice

145