Deterministic random walks

Joshua Cooper, Benjamin Doerr, Joel Spencer, Garbor Tardos

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Jim Propp's P-machine, also known as 'rotor router model' is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to randomly chosen neighbors, it serves the neighbors in a fixed order. We investigate how well this process simulates a random walk. For the graph being the infinite path, we show that, independent of the starting configuration, at each time and on each vertex, the number of chips on this vertex deviates from the expected number of chips in the random walk model by at most a constant C1, which is approximately 2.29. For intervals of length L, this improves to a difference of O(log L) (instead of 2.29L), for the L2 average of a contiguous set of intervals even to O(√log L). It seems plausible that similar results hold for higher-dimensional grids ℤd instead of the path ℤ.

Original languageEnglish (US)
Title of host publicationProceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics
Pages185-197
Number of pages13
Volume2006
StatePublished - 2006
Event8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics - Miami, FL, United States
Duration: Jan 21 2006Jan 21 2006

Other

Other8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics
CountryUnited States
CityMiami, FL
Period1/21/061/21/06

Fingerprint

Routers
Rotors

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Cooper, J., Doerr, B., Spencer, J., & Tardos, G. (2006). Deterministic random walks. In Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics (Vol. 2006, pp. 185-197)

Deterministic random walks. / Cooper, Joshua; Doerr, Benjamin; Spencer, Joel; Tardos, Garbor.

Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics. Vol. 2006 2006. p. 185-197.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Cooper, J, Doerr, B, Spencer, J & Tardos, G 2006, Deterministic random walks. in Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics. vol. 2006, pp. 185-197, 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics, Miami, FL, United States, 1/21/06.
Cooper J, Doerr B, Spencer J, Tardos G. Deterministic random walks. In Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics. Vol. 2006. 2006. p. 185-197
Cooper, Joshua ; Doerr, Benjamin ; Spencer, Joel ; Tardos, Garbor. / Deterministic random walks. Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics. Vol. 2006 2006. pp. 185-197
@inproceedings{857d973dfa124d4688d79f973a6c9864,
title = "Deterministic random walks",
abstract = "Jim Propp's P-machine, also known as 'rotor router model' is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to randomly chosen neighbors, it serves the neighbors in a fixed order. We investigate how well this process simulates a random walk. For the graph being the infinite path, we show that, independent of the starting configuration, at each time and on each vertex, the number of chips on this vertex deviates from the expected number of chips in the random walk model by at most a constant C1, which is approximately 2.29. For intervals of length L, this improves to a difference of O(log L) (instead of 2.29L), for the L2 average of a contiguous set of intervals even to O(√log L). It seems plausible that similar results hold for higher-dimensional grids ℤd instead of the path ℤ.",
author = "Joshua Cooper and Benjamin Doerr and Joel Spencer and Garbor Tardos",
year = "2006",
language = "English (US)",
isbn = "0898716101",
volume = "2006",
pages = "185--197",
booktitle = "Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics",

}

TY - GEN

T1 - Deterministic random walks

AU - Cooper, Joshua

AU - Doerr, Benjamin

AU - Spencer, Joel

AU - Tardos, Garbor

PY - 2006

Y1 - 2006

N2 - Jim Propp's P-machine, also known as 'rotor router model' is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to randomly chosen neighbors, it serves the neighbors in a fixed order. We investigate how well this process simulates a random walk. For the graph being the infinite path, we show that, independent of the starting configuration, at each time and on each vertex, the number of chips on this vertex deviates from the expected number of chips in the random walk model by at most a constant C1, which is approximately 2.29. For intervals of length L, this improves to a difference of O(log L) (instead of 2.29L), for the L2 average of a contiguous set of intervals even to O(√log L). It seems plausible that similar results hold for higher-dimensional grids ℤd instead of the path ℤ.

AB - Jim Propp's P-machine, also known as 'rotor router model' is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to randomly chosen neighbors, it serves the neighbors in a fixed order. We investigate how well this process simulates a random walk. For the graph being the infinite path, we show that, independent of the starting configuration, at each time and on each vertex, the number of chips on this vertex deviates from the expected number of chips in the random walk model by at most a constant C1, which is approximately 2.29. For intervals of length L, this improves to a difference of O(log L) (instead of 2.29L), for the L2 average of a contiguous set of intervals even to O(√log L). It seems plausible that similar results hold for higher-dimensional grids ℤd instead of the path ℤ.

UR - http://www.scopus.com/inward/record.url?scp=33646842218&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33646842218&partnerID=8YFLogxK

M3 - Conference contribution

SN - 0898716101

SN - 9780898716108

VL - 2006

SP - 185

EP - 197

BT - Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics

ER -