English

Loop cluster on the discrete circle

Probability 2015-04-30 v2

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 nn\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 nn\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}.

Keywords

Cite

@article{arxiv.1311.7583,
  title  = {Loop cluster on the discrete circle},
  author = {Yinshan Chang},
  journal= {arXiv preprint arXiv:1311.7583},
  year   = {2015}
}
R2 v1 2026-06-22T02:17:35.102Z