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