Short survey of results and open problems for parking problems on random trees

Abstract

Parking problems derive from works in combinatorics by Konheim and Weiss in the 1960s. In a memorable contribution, Lackner and Panholzer (2016) studied parking on a random tree and established a phase transition for this process when \(m \approx \frac{n}{2}\). This relates to the renowned result by David Aldous of convergence results on Erdős-Renyi random graphs of order \(n^{\frac{2}{3}}\). In a series of recent articles, Contat and coauthors have studied the problem in various random tree contexts and derived several novel scaling limit and phase transition results. We survey the present state-of-the-art of this literature and point to its extensions, open directions and possibilities, in particular related to the study of problem in different metric topologies. My intent it to point to importance of this line of research and novel open problems for future study.