The Exact Mixing Time for Trees of Fixed Order and Diameter

Abstract: We characterize the extremal structure for the exact mixing time for random walks on trees $\mathcal{T}{n,d}$ of order $n$ with diameter $d$. Given a graph $G=(V,E)$, let $H(v,\pi)$ denote the expected length of an optimal stopping rule from vertex $v$ to the stationary distributon $\pi$. We show that the quantity $\max{G \in \mathcal{T}{n,d} } T{\mbox{mix}}(G) = \max_{G \in \mathcal{T}{n,d} } \max{v \in V} H(v,\pi)$ is achieved uniquely by the balanced double broom.