Sensitivity Of Mixing Times

In this note, we demonstrate an instance of bounded-degree graphs of size n, for which the total variation mixing time for the random walk is decreased by a factor of logn/loglogn if we multiply the edge-conductances by bounded factors in a certain way.