English

Diffusive estimates for random walks on stationary random graphs of polynomial growth

Probability 2016-09-15 v1 Metric Geometry

Abstract

Let (G,ρ)(G,\rho) be a stationary random graph, and use BρG(r)B^G_{\rho}(r) to denote the ball of radius rr about ρ\rho in GG. Suppose that (G,ρ)(G,\rho) has annealed polynomial growth, in the sense that E[BρG(r)]O(rk)\mathbb{E}[|B^G_{\rho}(r)|] \leq O(r^k) for some k>0k > 0 and every r1r \geq 1. Then there is an infinite sequence of times {tn}\{t_n\} at which the random walk {Xt}\{X_t\} on (G,ρ)(G,\rho) is at most diffusive: Almost surely (over the choice of (G,ρ)(G,\rho)), there is a number C>0C > 0 such that E[distG(X0,Xtn)2X0=ρ,(G,ρ)]Ctnn1. \mathbb{E} \left[\mathrm{dist}_G(X_0, X_{t_n})^2 \mid X_0 = \rho, (G,\rho)\right]\leq C t_n\qquad \forall n \geq 1\,. This result is new even in the case when GG is a stationary random subgraph of Zd\mathbb{Z}^d. Combined with the work of Benjamini, Duminil-Copin, Kozma, and Yadin (2015), it implies that GG 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}\{t_n\} 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.

Keywords

Cite

@article{arxiv.1609.04040,
  title  = {Diffusive estimates for random walks on stationary random graphs of polynomial growth},
  author = {Shirshendu Ganguly and James R. Lee and Yuval Peres},
  journal= {arXiv preprint arXiv:1609.04040},
  year   = {2016}
}
R2 v1 2026-06-22T15:48:55.152Z