A sharp estimate for cover times on binary trees

Jian Ding, Ofer Zeitouni

We compute the second order correction for the cover time of the binary tree of depth $n$ by (continuous-time) random walk, and show that with probability approaching 1 as $n$ incr…