Deterministic random walks on finite graphs

Shuji Kijima, Kentaro Koga, Kazuhisa Makino

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

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 at 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 at a single vertex is Ω(m) at any time (> 0). For some special graphs, namely hypercube skeletons and Johnson graphs, we give a polylogarithmic upper bound, in terms of the number of nodes, for the discrepancy.

Original languageEnglish
Pages (from-to)739-761
Number of pages23
JournalRandom Structures and Algorithms
Volume46
Issue number4
DOIs
Publication statusPublished - Jul 1 2015

Fingerprint

Finite Graph
Routers
Random walk
Rotors
Discrepancy
Router
Rotor
Vertex of a graph
Graph in graph theory
Configuration
Hypercube
Skeleton
Lower bound
Upper bound
Denote
Model

All Science Journal Classification (ASJC) codes

  • Software
  • Mathematics(all)
  • Computer Graphics and Computer-Aided Design
  • Applied Mathematics

Cite this

Deterministic random walks on finite graphs. / Kijima, Shuji; Koga, Kentaro; Makino, Kazuhisa.

In: Random Structures and Algorithms, Vol. 46, No. 4, 01.07.2015, p. 739-761.

Research output: Contribution to journalArticle

Kijima, Shuji ; Koga, Kentaro ; Makino, Kazuhisa. / Deterministic random walks on finite graphs. In: Random Structures and Algorithms. 2015 ; Vol. 46, No. 4. pp. 739-761.
@article{1124c9f016d443489b767416750c532b,
title = "Deterministic random walks on finite graphs",
abstract = "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 at 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 at a single vertex is Ω(m) at any time (> 0). For some special graphs, namely hypercube skeletons and Johnson graphs, we give a polylogarithmic upper bound, in terms of the number of nodes, for the discrepancy.",
author = "Shuji Kijima and Kentaro Koga and Kazuhisa Makino",
year = "2015",
month = "7",
day = "1",
doi = "10.1002/rsa.20533",
language = "English",
volume = "46",
pages = "739--761",
journal = "Random Structures and Algorithms",
issn = "1042-9832",
publisher = "John Wiley and Sons Ltd",
number = "4",

}

TY - JOUR

T1 - Deterministic random walks on finite graphs

AU - Kijima, Shuji

AU - Koga, Kentaro

AU - Makino, Kazuhisa

PY - 2015/7/1

Y1 - 2015/7/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 at 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 at a single vertex is Ω(m) at any time (> 0). For some special graphs, namely hypercube skeletons and Johnson graphs, we give a polylogarithmic upper 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 at 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 at a single vertex is Ω(m) at any time (> 0). For some special graphs, namely hypercube skeletons and Johnson graphs, we give a polylogarithmic upper bound, in terms of the number of nodes, for the discrepancy.

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

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

U2 - 10.1002/rsa.20533

DO - 10.1002/rsa.20533

M3 - Article

AN - SCOPUS:84929291712

VL - 46

SP - 739

EP - 761

JO - Random Structures and Algorithms

JF - Random Structures and Algorithms

SN - 1042-9832

IS - 4

ER -