Mapping temporal-network percolation to weighted, static event graphs
Loading...
Access rights
openAccess
URL
Journal Title
Journal ISSN
Volume Title
A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
Date
2018-12-01
Department
Major/Subject
Mcode
Degree programme
Language
en
Pages
1-9
Series
Scientific Reports, Volume 8, issue 1
Abstract
The dynamics of diffusion-like processes on temporal networks are influenced by correlations in the times of contacts. This influence is particularly strong for 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). 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.Description
Keywords
Other note
Citation
Kivelä, M, Cambe, J, Saramäki, J & Karsai, M 2018, ' Mapping temporal-network percolation to weighted, static event graphs ', Scientific Reports, vol. 8, no. 1, 12357, pp. 1-9 . https://doi.org/10.1038/s41598-018-29577-2