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
|
類似資料
-
The power of two choices for random walks
著者:: Georgakopoulos, A, 等
出版事項: (2021) -
Biased random walks on combs
著者:: Elliott, T, 等
出版事項: (2007) -
Biased Continuous-Time Random Walks with Mittag-Leffler Jumps
著者:: Thomas M. Michelitsch, 等
出版事項: (2020-10-01) -
Randomly biased walks on subcritical trees
著者:: Ben Arous, G, 等
出版事項: (2012) -
Randomly biased walks on subcritical trees
著者:: Arous, G, 等
出版事項: (2011)