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

Abstract

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(r5/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(r11/2).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…