# Item

ITEM ACTIONSEXPORT

Released

Paper

#### Deterministic Random Walks on the Integers

##### External Resource

No external resources are shared

##### Fulltext (restricted access)

There are currently no full texts shared for your IP range.

##### Fulltext (public)

math_0602300.pdf

(Preprint), 222KB

##### Supplementary Material (public)

There is no public supplementary material available

##### Citation

Cooper, J., Doerr, B., Spencer, J., & Tardos, G. (2006). Deterministic Random Walks on the Integers. Retrieved from http://arxiv.org/abs/math/0602300.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0019-E4DB-B

##### Abstract

Jim Propp's P-machine, also known as the "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 c_1, which is approximately 2.29. For intervals of length L,
this improves to a difference of O(log L), for the L_2 average of a contiguous
set of intervals even to O(sqrt{log L}). All these bounds are tight.