Academic Journal
Time Dependent Biased Random Walks.
| Title: | Time Dependent Biased Random Walks. |
|---|---|
| Authors: | HASLEGRAVE, JOHN, SAUERWALD, THOMAS, SYLVESTER, JOHN |
| Source: | ACM Transactions on Algorithms; Apr2022, Vol. 18 Issue 2, p1-30, 30p |
| Abstract: | 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 p1-ε while this conjecture is not true in full generality, we propose a bestpossible 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. [ABSTRACT FROM AUTHOR] |
| Subject Terms: | RANDOM walks, DIRECTED graphs, MARKOV processes |
| Copyright of ACM Transactions on Algorithms is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| ISSN: | 15496325 |
| DOI: | 10.1145/3498848 |
| Database: | Complementary Index |