# Occupation measure of random walks and wired spanning forests in balls of Cayley graphs

@article{Lyons2017OccupationMO, title={Occupation measure of random walks and wired spanning forests in balls of Cayley graphs}, author={Russell Lyons and Yuval Peres and Xin Sun and Tianyi Zheng}, journal={arXiv: Probability}, year={2017} }

We show that for finite-range, symmetric random walks on general transient Cayley graphs, the expected occupation time of any given ball of radius $r$ is $O(r^{5/2})$.. We also study the volume-growth property of the wired spanning forests on general Cayley graphs, showing that the expected number of vertices in the component of the identity inside any given ball of radius $r$ is $O(r^{11/2})$.

## Figures from this paper

## 3 Citations

Upper bounds on the growth rate of Diffusion Limited Aggregation

- Mathematics
- 2017

We revisit Kesten's argument for the upper bound on the growth rate of DLA. We are able to make the argument robust enough so that it applies to many graphs, where only control of the heat kernel is…

Rotor Walks on Transient Graphs and the Wired Spanning Forest

- MathematicsSIAM J. Discret. Math.
- 2019

We study rotor walks on transient graphs with initial rotor configuration sampled from the oriented wired uniform spanning forest (OWUSF) measure. We show that the expected number of visits to any ...

Full realization of ergodic IRS entropy in SL2(Z) and free groups

- Mathematics
- 2021

We show that any a-priori possible entropy value is realized by an ergodic IRS, in free groups and in SL2(Z). This is in stark contrast to what may happen in SLn(Z) for n ≥ 3, where only the trivial…

## References

SHOWING 1-10 OF 16 REFERENCES

Uniform spanning forests

- Mathematics
- 2001

We study uniform spanning forest measures on infinite graphs, which are weak limits of uniform spanning tree measures from finite subgraphs. These limits can be taken with free (FSF) or wired (WSF)…

Harmonic maps on amenable groups and a diffusive lower bound for random walks

- Mathematics
- 2013

We prove diffusive lower bounds on the rate of escape of the random walk on infinite transitive graphs. Similar estimates hold for finite graphs, up to the relaxation time of the walk. Our approach…

Generating random spanning trees more quickly than the cover time

- Computer ScienceSTOC '96
- 1996

This paper gives a new algorithm for generating random spanning trees of an undirected graph that is easy to code up, has small running time constants, and has a nice proof that it generates trees with the right probabilities.

Probability on Trees and Networks

- Mathematics
- 2017

Starting around the late 1950s, several research communities began relating the geometry of graphs to stochastic processes on these graphs. This book, twenty years in the making, ties together…

Sharp Bounds on Random Walk Eigenvalues via Spectral Embedding

- Mathematics, Computer ScienceArXiv
- 2012

This work introduces spectral embedding as a new tool in analyzing reversible Markov chains, and designs a local algorithm to approximate the number of spanning trees of massive graphs.

Internal Diffusion Limited Aggregation on Discrete Groups Having Exponential Growth

- Mathematics
- 2005

The internal diffusion limited aggregation (DLA) has been introduced by Diaconis and Fulton [Rend. Sem. Mat. Univ. Pol. Torino 49, 95–119 (1991)]. It is a growth model defined on an infinite set and…

A geometric approach to on-diagonal heat kernel lower bounds on groups

- Mathematics
- 2001

We introduce a new method for obtaining heat kernel on-diagonal lower bounds on noncompact Lie groups and on infinite discrete groups. By using this method, we are able to recover the previously…

The structure of approximate groups

- Mathematics
- 2011

Let K⩾1 be a parameter. A K-approximate group is a finite set A in a (local) group which contains the identity, is symmetric, and such that A⋅A is covered by K left translates of A.The main result of…

A Gaussian upper bound for martingale small-ball probabilities

- Mathematics
- 2014

Consider a discrete-time martingale {Xt}{Xt} taking values in a Hilbert space HH. We show that if for some L≥1L≥1, the bounds E[∥Xt+1−Xt∥2H|Xt]=1E[‖Xt+1−Xt‖H2|Xt]=1 and ∥Xt+1−Xt∥H≤L‖Xt+1−Xt‖H≤L are…