  A random walk on a regular tree (or any non-amenable graph) has positive
speed. We ask whether such a walk can be slowed down by applying carefully
chosen time-dependent permutations of the vertices. We prove that on trees the
random walk can not be slowed down.

Probability