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...
| Main Authors: | , , |
|---|---|
| 格式: | Journal article |
| 語言: | English |
| 出版: |
Association for Computing Machinery
2022
|