Diffusive estimates for random walks on stationary random graphs of polynomial growth
Abstract
Let (G,) be a stationary random graph, and use BG(r) to denote the ball of radius r about in G. Suppose that (G,) has annealed polynomial growth, in the sense that E[|BG(r)|] ≤ O(rk) for some k > 0 and every r ≥ 1. Then there is an infinite sequence of times \tn\ at which the random walk \Xt\ on (G,) is at most diffusive: Almost surely (over the choice of (G,)), there is a number C > 0 such that \[ E [distG(X0, Xtn)2 X0 = , (G,)]≤ C tn ∀ n ≥ 1\,. \] This result is new even in the case when G is a stationary random subgraph of Zd. Combined with the work of Benjamini, Duminil-Copin, Kozma, and Yadin (2015), it implies that G 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 \tn\ 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.