Loop cluster on the discrete circle
Abstract
The loop clusters of a Poissonian ensemble of Markov loops on a finite or countable graph have been studied in Markovian-loop-clusters-on-graphs. In the present article, we study the loop clusters associated with a rotation invariant nearest neighbor walk on the discrete circle G(n) with n vertices. We prove a convergence result of the loop clusters on G(n), as n→∞, under suitable condition of the parameters. These parameters are chosen in such a way that the rotation invariant nearest neighbor walk on G(n), as n→∞, converges to a Brownian motion on circle S1=R/Z with certain drift and killing rate. In the final section, we show that several limit results are predicted by Brownian loop-soup on S1.
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.