The golf model on $\mathbb{Z}/n\mathbb{Z}$ and on $\mathbb{Z}$
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866908429027639296 |
|---|---|
| author | Varin, Zoé |
| author_facet | Varin, Zoé |
| contents | We introduce a particle model, that we call the $\textit{golf model}$. Initially, on a graph $G$, balls and holes are placed at random on some distinct vertices. The balls then move one by one, doing a random walk on $G$, starting from their initial vertex and stopping at the first empty hole they encounter, which they fill. On finite graphs, under reasonable assumptions (if there are more holes than balls, and if the Markov chain characterizing the random walks is irreducible) a final configuration is reached almost surely. In the paper, we are mainly interested in ${\bf H}^1$, the set of remaining holes. We give the distribution of ${\bf H}^1$ on $\mathbb{Z}/n\mathbb{Z}$, and describe a phase transition for the largest distance between two consecutive holes when the number of remaining holes is of order $\sqrt{n}$. We show that the model on $\mathbb{Z}$ is well-defined if every vertex contains either a ball with probability $d_{\sf b}$, a hole with probability $d_{\sf h}$, or nothing, independently from the other vertices, as long as $d_{\sf b} \leq d_{\sf h}$, and we describe the law of ${\bf H}^1$ in this case. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_13380 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | The golf model on $\mathbb{Z}/n\mathbb{Z}$ and on $\mathbb{Z}$ Varin, Zoé Probability Combinatorics Primary 60C05, 60F99, secondary 70L99 We introduce a particle model, that we call the $\textit{golf model}$. Initially, on a graph $G$, balls and holes are placed at random on some distinct vertices. The balls then move one by one, doing a random walk on $G$, starting from their initial vertex and stopping at the first empty hole they encounter, which they fill. On finite graphs, under reasonable assumptions (if there are more holes than balls, and if the Markov chain characterizing the random walks is irreducible) a final configuration is reached almost surely. In the paper, we are mainly interested in ${\bf H}^1$, the set of remaining holes. We give the distribution of ${\bf H}^1$ on $\mathbb{Z}/n\mathbb{Z}$, and describe a phase transition for the largest distance between two consecutive holes when the number of remaining holes is of order $\sqrt{n}$. We show that the model on $\mathbb{Z}$ is well-defined if every vertex contains either a ball with probability $d_{\sf b}$, a hole with probability $d_{\sf h}$, or nothing, independently from the other vertices, as long as $d_{\sf b} \leq d_{\sf h}$, and we describe the law of ${\bf H}^1$ in this case. |
| title | The golf model on $\mathbb{Z}/n\mathbb{Z}$ and on $\mathbb{Z}$ |
| topic | Probability Combinatorics Primary 60C05, 60F99, secondary 70L99 |
| url | https://arxiv.org/abs/2401.13380 |