Deterministic random walks on regular trees

DOI10.1002/rsa.20314zbMath1209.05233arXiv1006.1441OpenAlexW2962850529MaRDI QIDQ3055897

Tobias Friedrich, Benjamin Doerr, Joshua N. Cooper, J. H. Spencer

Publication date: 10 November 2010

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

discrepancyrotor-router modelquasirandomness

Mathematics Subject Classification ID

Trees (05C05) Random walks on graphs (05C81)

Related Items (11)

Total variation discrepancy of deterministic random walks for ergodic Markov chains ⋮ Deterministic Random Walks for Rapidly Mixing Chains ⋮ Unnamed Item ⋮ A simple approach for adapting continuous load balancing processes to discrete settings ⋮ Derandomizing random walks in undirected graphs using locally fair exploration strategies ⋮ Reachability Switching Games ⋮ Unbounded Discrepancy of Deterministic Random Walks on Grids ⋮ Deterministic walks with choice ⋮ Fast Simulation of Large-Scale Growth Models ⋮ The cover time of deterministic random walks for general transition probabilities ⋮ Deterministic random walks on finite graphs

Cites Work

• Unnamed Item
• The rotor-router model on regular trees
• Catalan numbers, their generalization, and their uses
• Inequalities for Beta and Gamma functions via some classical and new integral inequalities
• Deterministic random walks on the integers
• The rotor-router shape is spherical
• Simulating a Random Walk with Constant Error
• Deterministic Random Walks on the Two-Dimensional Grid

This page was built for publication: Deterministic random walks on regular trees