Mapping temporal-network percolation to weighted, static event graphs

Research output: Contribution to journalArticle

Standard

Mapping temporal-network percolation to weighted, static event graphs. / Kivelä, Mikko; Cambe, Jordan; Saramäki, Jari; Karsai, Márton.

In: Scientific Reports, Vol. 8, No. 1, 12357, 01.12.2018, p. 1-9.

Research output: Contribution to journalArticle

Harvard

APA

Vancouver

Author

Bibtex - Download

@article{f65cab03b4f0455b8846c8376c72dbdd,
title = "Mapping temporal-network percolation to weighted, static event graphs",
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.",
author = "Mikko Kivel{\"a} and Jordan Cambe and Jari Saram{\"a}ki and M{\'a}rton Karsai",
year = "2018",
month = "12",
day = "1",
doi = "10.1038/s41598-018-29577-2",
language = "English",
volume = "8",
pages = "1--9",
journal = "Scientific Reports",
issn = "2045-2322",
publisher = "Nature Publishing Group",
number = "1",

}

RIS - Download

TY - JOUR

T1 - Mapping temporal-network percolation to weighted, static event graphs

AU - Kivelä, Mikko

AU - Cambe, Jordan

AU - Saramäki, Jari

AU - Karsai, Márton

PY - 2018/12/1

Y1 - 2018/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85051726065&partnerID=8YFLogxK

U2 - 10.1038/s41598-018-29577-2

DO - 10.1038/s41598-018-29577-2

M3 - Article

VL - 8

SP - 1

EP - 9

JO - Scientific Reports

JF - Scientific Reports

SN - 2045-2322

IS - 1

M1 - 12357

ER -

ID: 27537475