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...
Huvudupphovsmän: | Haslegrave, J, Sauerwald, T, Sylvester, J |
---|---|
Materialtyp: | Journal article |
Språk: | English |
Publicerad: |
Association for Computing Machinery
2022
|
Liknande verk
-
The power of two choices for random walks
av: Georgakopoulos, A, et al.
Publicerad: (2021) -
Biased random walks on combs
av: Elliott, T, et al.
Publicerad: (2007) -
Biased Continuous-Time Random Walks with Mittag-Leffler Jumps
av: Thomas M. Michelitsch, et al.
Publicerad: (2020-10-01) -
Randomly biased walks on subcritical trees
av: Ben Arous, G, et al.
Publicerad: (2012) -
Randomly biased walks on subcritical trees
av: Arous, G, et al.
Publicerad: (2011)