Diffusive estimates for random walks on stationary random graphs of polynomial growth
arXiv:1609.04040
Abstract
Let be a stationary random graph, and use to denote the ball of radius about in . Suppose that has annealed polynomial growth, in the sense that for some and every . Then there is an infinite sequence of times at which the random walk on is at most diffusive: Almost surely (over the choice of ), there is a number such that \[ \mathbb{E} \left[\mathrm{dist}_G(X_0, X_{t_n})^2 \mid X_0 = ρ, (G,ρ)\right]\leq C t_n\qquad \forall n \geq 1\,. \] This result is new even in the case when is a stationary random subgraph of . Combined with the work of Benjamini, Duminil-Copin, Kozma, and Yadin (2015), it implies that almost surely does not admit a non-constant harmonic function of sublinear growth. To complement this, we argue that passing to a subsequence of times is necessary, as there are stationary random graphs of (almost sure) polynomial growth where the random walk is almost surely superdiffusive at an infinite subset of times.