Random walk on temporal networks with lasting edges
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 an...
| Prif Awduron: | , , , , |
|---|---|
| Fformat: | Journal article |
| Cyhoeddwyd: |
American Physical Society
2018
|
| _version_ | 1826274193901092864 |
|---|---|
| author | Petit, J Gueuning, M Carletti, T Lauwens, B Lambiotte, R |
| author_facet | Petit, J Gueuning, M Carletti, T Lauwens, B Lambiotte, R |
| author_sort | Petit, J |
| collection | OXFORD |
| description | 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. |
| first_indexed | 2024-03-06T22:39:44Z |
| format | Journal article |
| id | oxford-uuid:5b2203c8-f821-4cc5-9b86-ae83369de081 |
| institution | University of Oxford |
| last_indexed | 2024-03-06T22:39:44Z |
| publishDate | 2018 |
| publisher | American Physical Society |
| record_format | dspace |
| spelling | oxford-uuid:5b2203c8-f821-4cc5-9b86-ae83369de0812022-03-26T17:20:10ZRandom walk on temporal networks with lasting edgesJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:5b2203c8-f821-4cc5-9b86-ae83369de081Symplectic Elements at OxfordAmerican Physical Society2018Petit, JGueuning, MCarletti, TLauwens, BLambiotte, RWe 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. |
| spellingShingle | Petit, J Gueuning, M Carletti, T Lauwens, B Lambiotte, R Random walk on temporal networks with lasting edges |
| title | Random walk on temporal networks with lasting edges |
| title_full | Random walk on temporal networks with lasting edges |
| title_fullStr | Random walk on temporal networks with lasting edges |
| title_full_unstemmed | Random walk on temporal networks with lasting edges |
| title_short | Random walk on temporal networks with lasting edges |
| title_sort | random walk on temporal networks with lasting edges |
| work_keys_str_mv | AT petitj randomwalkontemporalnetworkswithlastingedges AT gueuningm randomwalkontemporalnetworkswithlastingedges AT carlettit randomwalkontemporalnetworkswithlastingedges AT lauwensb randomwalkontemporalnetworkswithlastingedges AT lambiotter randomwalkontemporalnetworkswithlastingedges |