  We show that the order of the $L_{\infty}$-mixing time of simple random walks
on a sequence of uniformly bounded degree graphs of size $n$ may increase by an
optimal factor of $\Theta( \log \log n)$ as a result of a bounded perturbation
of the edge weights. This answers a question and a conjecture of Kozma.
