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)