Random walk on temporal networks with lasting edges

Résultats de recherche: Contribution à un journal/une revueArticleRevue par des pairs

33 Téléchargements (Pure)


We consider random walks on dynamical networks where edges appear and disappear during finite time intervals. The process is grounded on three independent stochastic processes determining the walker's waiting time, the up time, and the down time of the edges. We first propose a comprehensive analytical and numerical treatment on directed acyclic graphs. Once cycles are allowed in the network, non-Markovian trajectories may emerge, remarkably even if the walker and the evolution of the network edges are governed by memoryless Poisson processes. We then introduce a general analytical framework to characterize such non-Markovian walks and validate our findings with numerical simulations.
langue originaleAnglais
Numéro d'article052307
Nombre de pages16
journalPhysical Review E - Statistical, Nonlinear, and Soft Matter Physics
Numéro de publication5
Les DOIs
Etat de la publicationPublié - 20 nov. 2018

Contient cette citation