A random walk on the Rado graph
arXiv:2205.06894
Abstract
The Rado graph, also known as the random graph , is a classical limit object for finite graphs. We study natural ball walks as a way of understanding the geometry of this graph. For the walk started at , we show that order steps are sufficient, and for infinitely many , necessary for convergence to stationarity. The proof involves an application of Hardy's inequality for trees.
43 pages