Simulating a Random Walk with Constant Error
From MaRDI portal
Publication:3419762
DOI10.1017/S0963548306007565zbMath1113.60047arXivmath/0402323MaRDI QIDQ3419762
J. H. Spencer, Joshua N. Cooper
Publication date: 7 February 2007
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0402323
Related Items (37)
Bounds on the cover time of parallel rotor walks ⋮ Abelian networks. III: The critical group ⋮ Memory Efficient Anonymous Graph Exploration ⋮ Tropical Gaussians: a brief survey ⋮ The Range of a Rotor Walk ⋮ The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks ⋮ Robustness of the rotor-router mechanism ⋮ 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 ⋮ Termination of amnesiac flooding ⋮ Proppian random walks in \(\mathbb Z\) ⋮ Laplacian growth, sandpiles, and scaling limits ⋮ Spiral structures in the rotor-router walk ⋮ Reachability Switching Games ⋮ Deterministic random walks on the integers ⋮ Orbits of rotor-router operation and stationary distribution of random walks on directed graphs ⋮ Deterministic Random Walks on the Two-Dimensional Grid ⋮ Unbounded Discrepancy of Deterministic Random Walks on Grids ⋮ Infinite excursions of router walks on regular trees ⋮ Solving the constrained shortest path problem using random search strategy ⋮ Bounds on the cleaning times of robot vacuums ⋮ Goldbug variations ⋮ Deterministic random walks on regular trees ⋮ Rotor Walks on Transient Graphs and the Wired Spanning Forest ⋮ The rotor-router model on regular trees ⋮ Abelian Networks I. Foundations and Examples ⋮ Deterministic walks with choice ⋮ Randomized diffusion for indivisible loads ⋮ Strong spherical asymptotics for rotor-router aggregation and the divisible sandpile ⋮ Fast Simulation of Large-Scale Growth Models ⋮ The cover time of deterministic random walks for general transition probabilities ⋮ Infinite-step stationarity of rotor walk and the wired spanning forest ⋮ Discrete analog computing with rotor-routers ⋮ Quasirandomness in Graphs ⋮ Deterministic random walks on finite graphs
This page was built for publication: Simulating a Random Walk with Constant Error
