Classes of random walks on temporal networks with competing timescales

Research output: Contribution to journalArticle

8 Downloads (Pure)

Abstract

Random walks find applications in many areas of science and are the heart of essential network analytic tools. When defined on temporal networks, even basic random walk models may exhibit a rich spectrum of behaviours, due to the co-existence of different timescales in the system. Here, we introduce random walks on general stochastic temporal networks allowing for lasting interactions, with up to three competing timescales. We then compare the mean resting time and stationary state of different models. We also discuss the accuracy of the mathematical analysis depending on the random walk model and the structure of the underlying network, and pay particular attention to the emergence of non-Markovian behaviour, even when all dynamical entities are governed by memoryless distributions.
Original languageEnglish
Article number72
Pages (from-to)1-20
Number of pages20
JournalApplied Network Science
Volume4
Issue number1
DOIs
Publication statusPublished - 1 Dec 2019

Fingerprint

Random walk
Time Scales
Stationary States
Mathematical Analysis
Coexistence
Model
Class
Interaction

Keywords

  • random walk
  • temporal network
  • memory
  • Memory
  • Random walk
  • Temporal network

Cite this

@article{147dca5c1d7a44d8bbecdfde12e9227c,
title = "Classes of random walks on temporal networks with competing timescales",
abstract = "Random walks find applications in many areas of science and are the heart of essential network analytic tools. When defined on temporal networks, even basic random walk models may exhibit a rich spectrum of behaviours, due to the co-existence of different timescales in the system. Here, we introduce random walks on general stochastic temporal networks allowing for lasting interactions, with up to three competing timescales. We then compare the mean resting time and stationary state of different models. We also discuss the accuracy of the mathematical analysis depending on the random walk model and the structure of the underlying network, and pay particular attention to the emergence of non-Markovian behaviour, even when all dynamical entities are governed by memoryless distributions.",
keywords = "random walk, temporal network, memory, Memory, Random walk, Temporal network",
author = "Julien Petit and Renaud Lambiotte and Timoteo Carletti",
year = "2019",
month = "12",
day = "1",
doi = "https://doi.org/10.1007/s41109-019-0204-6",
language = "English",
volume = "4",
pages = "1--20",
journal = "Applied Network Science",
issn = "2364-8228",
publisher = "Springer Open",
number = "1",

}

Classes of random walks on temporal networks with competing timescales. / Petit, Julien; Lambiotte, Renaud; Carletti, Timoteo.

In: Applied Network Science, Vol. 4, No. 1, 72, 01.12.2019, p. 1-20.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Classes of random walks on temporal networks with competing timescales

AU - Petit, Julien

AU - Lambiotte, Renaud

AU - Carletti, Timoteo

PY - 2019/12/1

Y1 - 2019/12/1

N2 - Random walks find applications in many areas of science and are the heart of essential network analytic tools. When defined on temporal networks, even basic random walk models may exhibit a rich spectrum of behaviours, due to the co-existence of different timescales in the system. Here, we introduce random walks on general stochastic temporal networks allowing for lasting interactions, with up to three competing timescales. We then compare the mean resting time and stationary state of different models. We also discuss the accuracy of the mathematical analysis depending on the random walk model and the structure of the underlying network, and pay particular attention to the emergence of non-Markovian behaviour, even when all dynamical entities are governed by memoryless distributions.

AB - Random walks find applications in many areas of science and are the heart of essential network analytic tools. When defined on temporal networks, even basic random walk models may exhibit a rich spectrum of behaviours, due to the co-existence of different timescales in the system. Here, we introduce random walks on general stochastic temporal networks allowing for lasting interactions, with up to three competing timescales. We then compare the mean resting time and stationary state of different models. We also discuss the accuracy of the mathematical analysis depending on the random walk model and the structure of the underlying network, and pay particular attention to the emergence of non-Markovian behaviour, even when all dynamical entities are governed by memoryless distributions.

KW - random walk

KW - temporal network

KW - memory

KW - Memory

KW - Random walk

KW - Temporal network

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

U2 - https://doi.org/10.1007/s41109-019-0204-6

DO - https://doi.org/10.1007/s41109-019-0204-6

M3 - Article

VL - 4

SP - 1

EP - 20

JO - Applied Network Science

JF - Applied Network Science

SN - 2364-8228

IS - 1

M1 - 72

ER -