Deterministic Random Walks on the Integers

Cooper, Joshua; Doerr, Benjamin; Spencer, Joel; Tardos, Gábor

doi:10.1016/j.ejc.2007.04.018

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

学術論文

Deterministic Random Walks on the Integers

MPS-Authors

/persons/resource/persons44338

Doerr, Benjamin
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

There are no locators available

Fulltext (restricted access)

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

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Cooper, J., Doerr, B., Spencer, J., & Tardos, G. (2007). Deterministic Random Walks on the Integers. European Journal of Combinatorics, 28(8), 2072-2090. doi:10.1016/j.ejc.2007.04.018.

引用: https://hdl.handle.net/11858/00-001M-0000-000F-1EE5-C

要旨

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 c1, which is approximately 2.29. For intervals of length L, this improves to a difference of O(logL), for the L2 average of a contiguous set of intervals even to . All these bounds are tight.