Deterministic random walks for rapidly mixing chains

Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita

研究成果: ジャーナルへの寄稿学術誌査読

2 被引用数 (Scopus)

抄録

The rotor-router model is a deterministic process analogous to a simple random walk on a graph, and the discrepancy of token configurations between the rotor-router model and its corresponding random walk has been investigated in some contexts. Motivated by general Markov chains beyond simple random walks, this paper investigates a generalized model which imitates a Markov chain (of multiple tokens) possibly containing irrational transition probabilities. We are concerned with the vertexwise discrepancy of the numbers of tokens between the generalized model and its corresponding Markov chain, and present an upper bound of the discrepancy in terms of the mixing time of the Markov chain.

本文言語英語
ページ(範囲)2180-2193
ページ数14
ジャーナルSIAM Journal on Discrete Mathematics
32
3
DOI
出版ステータス出版済み - 2018

!!!All Science Journal Classification (ASJC) codes

  • 数学 (全般)

フィンガープリント

「Deterministic random walks for rapidly mixing chains」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル