TY - GEN

T1 - Deterministic random walks on finite graphs

AU - Kijima, Shuji

AU - Koga, Kentaro

AU - Makino, Kazuhisa

PY - 2012/1/1

Y1 - 2012/1/1

N2 - The rotor-router model, also known as the Propp machine, is a deterministic process analogous to a random walk on a graph. Instead of distributing tokens to randomly chosen neighbors, the Propp machine deterministically serves the neighbors in a fixed order by associating to each vertex a "rotor-router" pointing to one of its neighbors. This paper investigates the discrepancy on a single vertex between the number of tokens in the rotor-router model and the expected number of tokens in a random walk, for finite graphs in general. We show that the discrepancy is bounded by O(mn) at any time for any initial configuration if the corresponding random walk is lazy and reversible, where n and m denote the numbers of nodes and edges, respectively. For a lower bound, we show examples of graphs and initial configurations for which the discrepancy on a single vertex is Ω(m) at any time (> 0). For some special graphs, namely hypercube skeletons and Johnson graphs, we give a polylogarithmic bound, in terms of the number of nodes, for the discrepancy.

AB - The rotor-router model, also known as the Propp machine, is a deterministic process analogous to a random walk on a graph. Instead of distributing tokens to randomly chosen neighbors, the Propp machine deterministically serves the neighbors in a fixed order by associating to each vertex a "rotor-router" pointing to one of its neighbors. This paper investigates the discrepancy on a single vertex between the number of tokens in the rotor-router model and the expected number of tokens in a random walk, for finite graphs in general. We show that the discrepancy is bounded by O(mn) at any time for any initial configuration if the corresponding random walk is lazy and reversible, where n and m denote the numbers of nodes and edges, respectively. For a lower bound, we show examples of graphs and initial configurations for which the discrepancy on a single vertex is Ω(m) at any time (> 0). For some special graphs, namely hypercube skeletons and Johnson graphs, we give a polylogarithmic bound, in terms of the number of nodes, for the discrepancy.

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

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

U2 - 10.1137/1.9781611973020.3

DO - 10.1137/1.9781611973020.3

M3 - Conference contribution

AN - SCOPUS:84959862618

T3 - 9th Meeting on Analytic Algorithmics and Combinatorics 2012, ANALCO 2012

SP - 16

EP - 25

BT - 9th Meeting on Analytic Algorithmics and Combinatorics 2012, ANALCO 2012

PB - Society for Industrial and Applied Mathematics Publications

T2 - 9th Meeting on Analytic Algorithmics and Combinatorics, ANALCO 2012

Y2 - 16 January 2012

ER -