Deterministic random walks on the integers

DOI10.1016/j.ejc.2007.04.018zbMath1130.60011arXivmath/0602300OpenAlexW1975911106MaRDI QIDQ2461766

Joshua N. Cooper, Benjamin Doerr, Gábor Tardos, J. H. Spencer

Publication date: 21 November 2007

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0602300

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Combinatorial probability (60C05) Graph theory (05C99)

Related Items (18)

Memory Efficient Anonymous Graph Exploration ⋮ Abelian networks IV. Dynamics of nonhalting networks ⋮ Total variation discrepancy of deterministic random walks for ergodic Markov chains ⋮ Deterministic Random Walks for Rapidly Mixing Chains ⋮ Unnamed Item ⋮ Deterministic Random Walks on Regular Trees ⋮ Proppian random walks in \(\mathbb Z\) ⋮ A simple approach for adapting continuous load balancing processes to discrete settings ⋮ Reachability Switching Games ⋮ Deterministic Random Walks on the Two-Dimensional Grid ⋮ Unbounded Discrepancy of Deterministic Random Walks on Grids ⋮ Deterministic random walks on regular trees ⋮ Deterministic walks with choice ⋮ Fast Simulation of Large-Scale Growth Models ⋮ 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 ⋮ Discrete analog computing with rotor-routers ⋮ Deterministic random walks on finite graphs

Cites Work

• The rotor-router model on regular trees
• Goldbug variations
• Simulating a Random Walk with Constant Error
• Spherical asymptotics for the rotor-router model in $\mathbb{Z}^d$

This page was built for publication: Deterministic random walks on the integers