Cover times of the massive random walk loop soup
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913284812177408 |
|---|---|
| author | Broman, Erik I. Camia, Federico |
| author_facet | Broman, Erik I. Camia, Federico |
| contents | We study cover times of subsets of ${\mathbb Z}^2$ by a two-dimensional massive random walk loop soup. We consider a sequence of subsets $A_n \subset {\mathbb Z}^2$ such that $|A_n| \to \infty$ and determine the distributional limit of their cover times ${\mathcal T}(A_n).$ We allow the killing rate $κ_n$ (or equivalently the ``mass'') of the loop soup to depend on the size of the set $A_n$ to be covered. In particular, we determine the limiting behavior of the cover times for inverse killing rates all the way up to $κ_n^{-1}=|A_n|^{1-8/(\log \log |A_n|)},$ showing that it can be described by a Gumbel distribution. Since a typical loop in this model will have length at most of order $κ_n^{-1/2}=|A_n|^{1/2},$ if $κ_n^{-1}$ exceeded $|A_n|,$ the cover times of all points in a tightly packed set $A_n$ (i.e. a square or close to a ball) would presumably be heavily correlated, complicating the analysis. Our result comes close to this extreme case. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_17663 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Cover times of the massive random walk loop soup Broman, Erik I. Camia, Federico Probability 60K35, 60G50 We study cover times of subsets of ${\mathbb Z}^2$ by a two-dimensional massive random walk loop soup. We consider a sequence of subsets $A_n \subset {\mathbb Z}^2$ such that $|A_n| \to \infty$ and determine the distributional limit of their cover times ${\mathcal T}(A_n).$ We allow the killing rate $κ_n$ (or equivalently the ``mass'') of the loop soup to depend on the size of the set $A_n$ to be covered. In particular, we determine the limiting behavior of the cover times for inverse killing rates all the way up to $κ_n^{-1}=|A_n|^{1-8/(\log \log |A_n|)},$ showing that it can be described by a Gumbel distribution. Since a typical loop in this model will have length at most of order $κ_n^{-1/2}=|A_n|^{1/2},$ if $κ_n^{-1}$ exceeded $|A_n|,$ the cover times of all points in a tightly packed set $A_n$ (i.e. a square or close to a ball) would presumably be heavily correlated, complicating the analysis. Our result comes close to this extreme case. |
| title | Cover times of the massive random walk loop soup |
| topic | Probability 60K35, 60G50 |
| url | https://arxiv.org/abs/2403.17663 |