Abstract
We investigate random walks in graphs whose edges change over time as a function of the current probability distribution of the walk. We show that such systems can be chaotic and can exhibit 'hyper-torpid' mixing. Our main result is that, if each graph is strongly connected, then the dynamics is asymptotically periodic almost surely.
Original language | English (US) |
---|---|
Article number | 8747524 |
Pages (from-to) | 1337-1343 |
Number of pages | 7 |
Journal | IEEE Transactions on Network Science and Engineering |
Volume | 7 |
Issue number | 3 |
DOIs | |
State | Published - Jul 1 2020 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Control and Systems Engineering
- Computer Science Applications
- Computer Networks and Communications
Keywords
- Markov influence systems
- Random walks
- chaos
- hyper-torpid mixing
- temporal networks