Parking on a random rooted plane tree (Q2214237): Difference between revisions

This paper investigates a parking process on a uniform random rooted plane tree with \(n\) vertices. Every vertex of the tree has a parking space for a single car. Cars arrive at independent uniformly random vertices of the tree. If the parking space at a vertex is unoccupied when a car arrives there, it parks. If not, the car drives towards the root and parks in the first empty space it encounters if there is one. The asymptotic of the probability of the event that all cars can park when \(\lfloor \alpha n \rfloor\) cars arrive for \(\alpha > 0\) is given. The result shows that the event has positive limiting probability if \(\alpha \leq \alpha_c=\sqrt{2}-1\), whereas its probability tends to 0 for \(\alpha > \alpha_c\).