Recurrence of the Zd-valued infinite snake via unimodularity
Abstract
We use the concept of unimodular random graph to show that the branching simple random walk on Zd indexed by a critical geometric Galton-Watson tree conditioned to survive is recurrent if and only if d ≤ 4.
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.