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...
Autors principals: | Haslegrave, J, Sauerwald, T, Sylvester, J |
---|---|
Format: | Journal article |
Idioma: | English |
Publicat: |
Association for Computing Machinery
2022
|
Ítems similars
-
The power of two choices for random walks
per: Georgakopoulos, A, et al.
Publicat: (2021) -
Biased random walks on combs
per: Elliott, T, et al.
Publicat: (2007) -
Biased Continuous-Time Random Walks with Mittag-Leffler Jumps
per: Thomas M. Michelitsch, et al.
Publicat: (2020-10-01) -
Randomly biased walks on subcritical trees
per: Ben Arous, G, et al.
Publicat: (2012) -
Randomly biased walks on subcritical trees
per: Arous, G, et al.
Publicat: (2011)