Time Dependent Biased Random Walks
| Autor: | Haslegrave, John, Sauerwald, Thomas, Sylvester, John |
|---|---|
| Rok vydání: | 2020 |
| Předmět: | |
| Zdroj: | ACM Trans. Algorithms, 18(2), 2022 |
| Druh dokumentu: | Working Paper |
| DOI: | 10.1145/3498848 |
| Popis: | 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 walk. We obtain new bounds on the cover and hitting times. Azar et al. conjectured that the controller can increase the stationary probability of a vertex from $p$ to $p^{1-\epsilon}$; while this conjecture is not true in full generality, we propose a best-possible amended version of this conjecture and confirm it for a broad class of graphs. We also consider the problem of computing an optimal strategy for the controller to minimise the cover time and show that for directed graphs determining the cover time is PSPACE-complete. Comment: 32 pages, 5 figures. Theorems 3.4 and 4.3 have been slightly strengthened in version 2. Some results from this paper appeared in The 11th Innovations in Theoretical Computer Science Conference (ITCS 2020), volume 151 of LIPIcs, pages 76:1-76:19 |
| Databáze: | arXiv |
| Externí odkaz: |
|