On a random recursive tree with n vertices, parking is supercritical at every positive density, and the first outward flux for binary car arrivals appears when the mean number of cars per vertex is about (log n)^{-2+o(1)}.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Parking on the Random Recursive Tree
On a random recursive tree with n vertices, parking is supercritical at every positive density, and the first outward flux for binary car arrivals appears when the mean number of cars per vertex is about (log n)^{-2+o(1)}.