Yuwen Wang, University of Innsbruck

Abstract

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. Joint work with Laurent Saloff-Coste. 

See: https://sites.google.com/view/rutgersdmseminar