Deterministic random walks on finite graphs
From MaRDI portal
Publication:5265345
DOI10.1002/rsa.20533zbMath1319.05119OpenAlexW2137795931MaRDI QIDQ5265345
Shuji Kijima, Kentaro Koga, Kazuhisa Makino
Publication date: 23 July 2015
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20533
Related Items
Total variation discrepancy of deterministic random walks for ergodic Markov chains ⋮ Deterministic Random Walks for Rapidly Mixing Chains ⋮ A simple approach for adapting continuous load balancing processes to discrete settings ⋮ Unbounded Discrepancy of Deterministic Random Walks on Grids ⋮ The cover time of deterministic random walks for general transition probabilities ⋮ Does adding more agents make a difference? A case study of cover time for the rotor-router
Cites Work
- Unnamed Item
- Unnamed Item
- The cover time of deterministic random walks
- Strong spherical asymptotics for rotor-router aggregation and the divisible sandpile
- Internal diffusion limited aggregation
- Goldbug variations
- Subdiffusive fluctuations for internal diffusion limited aggregation
- Strong robustness of randomized rumor spreading protocols
- Deterministic random walks on the integers
- The rotor-router shape is spherical
- Quasirandom Rumor Spreading on Expanders
- Deterministic random walks on regular trees
- Quasirandom Rumor Spreading on the Complete Graph Is as Fast as Randomized Rumor Spreading
- Simulating a Random Walk with Constant Error
- Deterministic Random Walks on the Two-Dimensional Grid
- Introducing Quasirandomness to Computer Science
- Quasirandom rumor spreading
- Spherical asymptotics for the rotor-router model in $\mathbb{Z}^d$
