The phase transition for parking on Galton--Watson trees
arXiv:1912.06012 · doi:10.19086/da.33167
Abstract
We establish a phase transition for the parking process on critical Galton--Watson trees. In this model, a random number of cars with mean and variance arrive independently on the vertices of a critical Galton--Watson tree with finite variance conditioned to be large. The cars go down the tree towards the root and try to park on empty vertices as soon as possible. We show a phase transition depending on Specifically, when , if then all but (possibly) a few cars will manage to park, whereas if , then a positive fraction of the cars will not find a spot and exit the tree through the root. This confirms a conjecture of Goldschmidt and Przykucki.
arXiv comment17 pages, 5 figures
References in corpus (6)
- Random trees and applications
- A survey of max-type recursive distributional equations
- Local limits of conditioned Galton-Watson trees I: the infinite spine case
- An exactly solvable continuous-time Derrida--Retaux model
- The boundary of random planar maps via looptrees
- Parking On A Random Rooted Plane Tree