Time dependent biased random walks

We study the biased random walk where at each step of a random walk a “controller” can, with a certain small probability, move the walk to an arbitrary neighbour. This model was introduced by Azar et al. [STOC’1992]; we extend their work to the time dependent setting and consider cover times of this...

詳細記述

書誌詳細
主要な著者: Haslegrave, J, Sauerwald, T, Sylvester, J
フォーマット: Journal article
言語:English
出版事項: Association for Computing Machinery 2022

類似資料