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

preprint2016arXivOpen access

Abstract

Let (G,ρ)(G,ρ) be a stationary random graph, and use BρG(r)B^G_ρ(r) to denote the ball of radius rr about ρρ in GG. Suppose that (G,ρ)(G,ρ) has annealed polynomial growth, in the sense that E[∣BρG(r)∣]≤O(rk)\mathbb{E}[|B^G_ρ(r)|] \leq O(r^k) for some k>0k > 0 and every r≥1r \geq 1. Then there is an infinite sequence of times {tn}\{t_n\} at which the random walk {Xt}\{X_t\} on (G,ρ)(G,ρ) is at most diffusive: Almost surely (over the choice of (G,ρ)(G,ρ)), there is a number C>0C > 0 such that E[distG(X0,Xtn)2∣X0=ρ,(G,ρ)]≤Ctn∀n≥1 . \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 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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.