Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2012
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/1210.2520 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912440338350080 |
|---|---|
| author | Chang, Yinshan |
| author_facet | Chang, Yinshan |
| contents | Consider a sequence of Poisson point processes of non-trivial loops with certain intensity measures $(μ^{(n)})_n$, where each $μ^{(n)}$ is explicitly determined by transition probabilities $p^{(n)}$ of a random walk on a finite state space $V^{(n)}$ together with an additional killing parameter $c^{(n)}=e^{-a\cdot\sharp V^{(n)}+o(\sharp V^{(n)})}$. We are interested in asymptotic behavior of typical loops. Under general assumptions, we study the asymptotics of the length of a loop sampled from the normalized intensity measure $\barμ^{(n)}$ as $n\rightarrow\infty$. A typical loop is small for $a=0$ and extremely large for $a=\infty$. For $a=(0,\infty)$, we observe both small and extremely large loops. We obtain explicit formulas for the asymptotics of the mass of intensity measures, the asymptotics of the proportion of big loops, limit results on the number of vertices (with multiplicity) visited by a loop sampled from $\barμ^{(n)}$. We verify our general assumptions for random walk loop soups on discrete tori and truncated regular trees. Finally, we consider random walk loop soups on complete graphs. Here, our general assumptions are violated. In this case, we observe different asymptotic behavior of the length of a typical loop. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1210_2520 |
| institution | arXiv |
| publishDate | 2012 |
| record_format | arxiv |
| spellingShingle | A convergence result on the lengths of Markovian loops Chang, Yinshan Probability Consider a sequence of Poisson point processes of non-trivial loops with certain intensity measures $(μ^{(n)})_n$, where each $μ^{(n)}$ is explicitly determined by transition probabilities $p^{(n)}$ of a random walk on a finite state space $V^{(n)}$ together with an additional killing parameter $c^{(n)}=e^{-a\cdot\sharp V^{(n)}+o(\sharp V^{(n)})}$. We are interested in asymptotic behavior of typical loops. Under general assumptions, we study the asymptotics of the length of a loop sampled from the normalized intensity measure $\barμ^{(n)}$ as $n\rightarrow\infty$. A typical loop is small for $a=0$ and extremely large for $a=\infty$. For $a=(0,\infty)$, we observe both small and extremely large loops. We obtain explicit formulas for the asymptotics of the mass of intensity measures, the asymptotics of the proportion of big loops, limit results on the number of vertices (with multiplicity) visited by a loop sampled from $\barμ^{(n)}$. We verify our general assumptions for random walk loop soups on discrete tori and truncated regular trees. Finally, we consider random walk loop soups on complete graphs. Here, our general assumptions are violated. In this case, we observe different asymptotic behavior of the length of a typical loop. |
| title | A convergence result on the lengths of Markovian loops |
| topic | Probability |
| url | https://arxiv.org/abs/1210.2520 |