Loop cluster on the discrete circle

preprint2015arXivOpen access

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)G^{(n)} with nn vertices. We prove a convergence result of the loop clusters on G(n)G^{(n)}, as n→∞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)G^{(n)}, as n→∞n\rightarrow\infty, converges to a Brownian motion on circle S1=R/Z\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 S1\mathbb{S}^{1}.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.