Sensitivity of mixing times in Eulerian digraphs

Lucas Boczkowski, Yuval Peres, Perla Sousi

Let $X$ be a lazy random walk on a graph $G$. If $G$ is undirected, then the mixing time is upper bounded by the maximum hitting time of the graph. This fails for directed chains,…