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...
Autori principali: | Haslegrave, J, Sauerwald, T, Sylvester, J |
---|---|
Natura: | Journal article |
Lingua: | English |
Pubblicazione: |
Association for Computing Machinery
2022
|
Documenti analoghi
-
The power of two choices for random walks
di: Georgakopoulos, A, et al.
Pubblicazione: (2021) -
Biased random walks on combs
di: Elliott, T, et al.
Pubblicazione: (2007) -
Biased Continuous-Time Random Walks with Mittag-Leffler Jumps
di: Thomas M. Michelitsch, et al.
Pubblicazione: (2020-10-01) -
Randomly biased walks on subcritical trees
di: Ben Arous, G, et al.
Pubblicazione: (2012) -
Randomly biased walks on subcritical trees
di: Arous, G, et al.
Pubblicazione: (2011)