Hitting times for random walks with restarts
Svante Janson, Yuval Peres

TL;DR
This paper investigates the expected hitting times for random walks with restart strategies on Euclidean lattices, establishing asymptotic formulas and confirming conjectures about the 'grade' of a vertex, with implications for control problems.
Contribution
It proves conjectures on the asymptotics of the grade in Euclidean lattices and derives precise asymptotics for hitting times with and without restarts.
Findings
Expected hitting time in planar lattice asymptotic to 2|x|^2 log|x|
Confirmed conjectures on the grade's asymptotics in Euclidean lattices
Derived second order asymptotics for lattice disk hitting times
Abstract
The time it takes a random walker in a lattice to reach the origin from another vertex , has infinite mean. If the walker can restart the walk at at will, then the minimum expected hitting time (minimized over restarting strategies) is finite; it was called the ``grade'' of by Dumitriu, Tetali and Winkler. They showed that, in a more general setting, the grade (a variant of the ``Gittins index'') plays a crucial role in control problems involving several Markov chains. Here we establish several conjectures of Dumitriu et al on the asymptotics of the grade in Euclidean lattices. In particular, we show that in the planar square lattice, is asymptotic to as . The proof hinges on the local variance of the potential kernel being almost constant on the level sets of . We also show how the same method yields precise second…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMarkov Chains and Monte Carlo Methods · Stochastic processes and statistical mechanics · Theoretical and Computational Physics
