An algebraic-combinatorial framework for finding the average hitting times in graphs with high regularity

Aida Abiad, Yusaku Nishimura

For any given vertices $u$ and $v$ in a graph, the hitting time of a random walk on a finite graph is the number of steps it takes for a random walk to reach vertex $v$ starting at…