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)