Random walks on regular trees can not be slowed down
arXiv:2302.00760 · doi:10.1214/24-EJP1109
Abstract
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.
17 pages