A Study in Markov Chains, Loop-Erased Random Walk and Loop Soups
Abstract
In this paper, we make a few random explorations that relate directly to the items mentioned in the title. We define transient chains and recurrent chains with "killing", the Green's function, the Laplacian operator, and harmonic functions. We then introduce the loop-erased random walk (LERW) and its relationship with the uniform spanning tree (UST). We finish by introducing loop measures and soups and defining the "growing loop" model.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.