Yuwen Wang (Rényi): Expected hitting times on finite graphs

Given two vertices a and b on a finite graph, the hitting time is how long a simple random walk starting at a reaches
b. We give asymptotic estimates for expected hitting times for a large class of lattice-like graphs. Using our
result, we compute the asymptotic expected hitting times for various examples: rectangular tori, birth-death
chains, and some fractal graphs. Joint work with Laurent Saloff-Coste.