English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Deterministic Random Walks on Infinite Grids

Friedrich, T. (2005). Deterministic Random Walks on Infinite Grids. Master Thesis, Friedrich-Schiller-Universität Jena, Saarbrücken.

Item is

Files

show Files
hide Files
:
DA.pdf (Any fulltext), 2MB
 
File Permalink:
-
Name:
DA.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Friedrich, Tobias1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 Abstract: The rotor-router model is a simple deterministic analogue of random walk invented by Jim Propp. Instead of distributing chips to randomly chosen neighbors, it serves the neighbors in a fixed order. This thesis investigates how well this process simulates a random walk on an infinite two-dimensional grid. 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$. It is proved that $7.2 < c < 11.8$ in general. Surprisingly, these bounds depend on the order in which the neighbors are served. It is also shown that in a generalized setting, where one just requires that no neighbor gets more than $\Delta$ chips more than another, there is also such a constant $c'$ with $7.7\Delta < c' < 26.9\Delta$.

Details

show
hide
Language(s): eng - English
 Dates: 2006-04-2020052005
 Publication Status: Issued
 Pages: -
 Publishing info: Saarbrücken : Friedrich-Schiller-Universität Jena
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 279153
Other: Local-ID: C1256428004B93B8-F340345DBC6308A4C125714300488CC3-Friedrich2005
 Degree: Master

Event

show

Legal Case

show

Project information

show

Source

show