Papers
Topics
Authors
Recent
Search
2000 character limit reached

Loop cluster on the discrete circle

Published 29 Nov 2013 in math.PR | (1311.7583v2)

Abstract: The loop clusters of a Poissonian ensemble of Markov loops on a finite or countable graph have been studied in \cite{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\rightarrow\infty$, 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\rightarrow\infty$, converges to a Brownian motion on circle $\mathbb{S}{1}=\mathbb{R}/\mathbb{Z}$ with certain drift and killing rate. In the final section, we show that several limit results are predicted by Brownian loop-soup on $\mathbb{S}{1}$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.