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...
Asıl Yazarlar: | Haslegrave, J, Sauerwald, T, Sylvester, J |
---|---|
Materyal Türü: | Journal article |
Dil: | English |
Baskı/Yayın Bilgisi: |
Association for Computing Machinery
2022
|
Benzer Materyaller
-
The power of two choices for random walks
Yazar:: Georgakopoulos, A, ve diğerleri
Baskı/Yayın Bilgisi: (2021) -
Biased random walks on combs
Yazar:: Elliott, T, ve diğerleri
Baskı/Yayın Bilgisi: (2007) -
Biased Continuous-Time Random Walks with Mittag-Leffler Jumps
Yazar:: Thomas M. Michelitsch, ve diğerleri
Baskı/Yayın Bilgisi: (2020-10-01) -
Randomly biased walks on subcritical trees
Yazar:: Ben Arous, G, ve diğerleri
Baskı/Yayın Bilgisi: (2012) -
Randomly biased walks on subcritical trees
Yazar:: Arous, G, ve diğerleri
Baskı/Yayın Bilgisi: (2011)