Parking on supercritical geometric Bienaymé--Galton--Watson trees
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_ | 1866913227649056768 |
|---|---|
| author | Chen, Linxiao Contat, Alice |
| author_facet | Chen, Linxiao Contat, Alice |
| contents | Consider a supercritical Bienaymé--Galton--Watson tree $ \mathcal{T}$ with geometric offspring distribution. Each vertex of this tree represents a parking spot which can accommodate at most one car. On the top of this tree, we add $(A_u : u \in \mathcal{T})$ i.i.d.\ non negative integers sampled according to a given law $ μ$, which are the car arrivals on $ \mathcal{T}$. Each car tries to park on its arriving vertex and if the spot is already occupied, it drives towards the root and takes the first available spot. If no spot is found, then it exits the tree without parking. In this paper, we provide a criterion to determine the phase of the parking process (subcritical, critical, or supercritical) depending on the generating function of $ μ$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_05612 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Parking on supercritical geometric Bienaymé--Galton--Watson trees Chen, Linxiao Contat, Alice Probability Combinatorics Consider a supercritical Bienaymé--Galton--Watson tree $ \mathcal{T}$ with geometric offspring distribution. Each vertex of this tree represents a parking spot which can accommodate at most one car. On the top of this tree, we add $(A_u : u \in \mathcal{T})$ i.i.d.\ non negative integers sampled according to a given law $ μ$, which are the car arrivals on $ \mathcal{T}$. Each car tries to park on its arriving vertex and if the spot is already occupied, it drives towards the root and takes the first available spot. If no spot is found, then it exits the tree without parking. In this paper, we provide a criterion to determine the phase of the parking process (subcritical, critical, or supercritical) depending on the generating function of $ μ$. |
| title | Parking on supercritical geometric Bienaymé--Galton--Watson trees |
| topic | Probability Combinatorics |
| url | https://arxiv.org/abs/2402.05612 |