Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 13 Sep 2016 in math.PR and math.MG | (1609.04040v1)

Abstract: Let $(G,\rho)$ be a stationary random graph, and use $BG_{\rho}(r)$ to denote the ball of radius $r$ about $\rho$ in $G$. Suppose that $(G,\rho)$ has annealed polynomial growth, in the sense that $\mathbb{E}[|BG_{\rho}(r)|] \leq O(rk)$ for some $k > 0$ and every $r \geq 1$. Then there is an infinite sequence of times ${t_n}$ at which the random walk ${X_t}$ on $(G,\rho)$ is at most diffusive: Almost surely (over the choice of $(G,\rho)$), there is a number $C > 0$ such that [ \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 $G$ is a stationary random subgraph of $\mathbb{Z}d$. 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 ${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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.