REVIEW 1 cited by
Parking on trees with a (random) given degree sequence and the Frozen configuration model
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Consider a rooted tree on the top of which we let cars arrive on its vertices. Each car tries to park on its arriving vertex but if it is already occupied, it drives towards the root of the tree and parks as soon as possible. In this article, we establish a natural coupling between the parking process on trees with prescribed degrees and an oriented configuration model. As a consequence, we recover the location of the phase transition for parking on critical Bienaym\'e--Galton--Watson trees already proven by Curien and H\'enard, and Contat.
Forward citations
Cited by 1 Pith paper
-
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)}.
Discussion (0). Continue with ORCID to comment.