Parking on the infinite binary tree
From MaRDI portal
Abstract: Let be i.i.d.~non-negative integers that we interpret as car arrivals on the vertices of the full binary tree . Each car tries to park on its arrival node, but if it is already occupied, it drives towards the root and parks on the first available spot. It is known that the parking process on exhibits a phase transition in the sense that either a finite number of cars do not manage to park in expectation (subcritical regime) or all vertices of the tree contain a car and infinitely many cars do not manage to park (supercritical regime). We characterize those regimes in terms of the law of in an explicit way. We also study in detail the critical regime as well as the phase transition which turns out to be "discontinuous".
Recommendations
- Parking on supercritical Galton-Watson trees
- Parking on a random rooted plane tree
- Parking functions on oriented trees
- Parking functions and tree inversions revisited
- Parking on the integers
- scientific article; zbMATH DE number 7643620
- Multilayer parking with screening on a random tree
- A combinatorial approach for discrete car parking on random labelled trees
- On increasing and invariant parking sequences
- Parking distributions on trees
Cites work
- A Census of Planar Triangulations
- An Occupancy Discipline and Applications
- Analytic combinatorics
- Growth-fragmentation processes in Brownian motion indexed by the Brownian tree
- scientific article; zbMATH DE number 7643620 (Why is no real title available?)
- Martingales in self-similar growth-fragmentations and their connections with random planar maps
- Parking functions for mappings
- Parking on a random tree
- Parking on supercritical Galton-Watson trees
- Phase transition for Parking blocks, Brownian excursion and coalescence
- Polynomial equations with one catalytic variable, algebraic series and map enumeration
- Prime parking functions on rooted trees
- Random planar maps and growth-fragmentations
- Sharpness of the phase transition for parking on random trees
- The Derrida-Retaux conjecture on recursive models
Cited in
(5)
This page was built for publication: Parking on the infinite binary tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6095843)