Random walks on regular trees can not be slowed down
Probability
2025-11-04 v1
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.
Cite
@article{arxiv.2302.00760,
title = {Random walks on regular trees can not be slowed down},
author = {Omer Angel and Jacob Richey and Yinon Spinka and Amir Yehudayoff},
journal= {arXiv preprint arXiv:2302.00760},
year = {2025}
}
Comments
17 pages