REVIEW 1 cited by
Parking on supercritical geometric Bienaym\'e--Galton--Watson trees
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
Signed reviews
abstract
Consider a supercritical Bienaym\'e--Galton--Watson tree $ \mathcal{T}$ with geometric offspring distribution. Each vertex of this tree represents a parking spot which can accommodate at most one car. On the top of this tree, we add $(A_u : u \in \mathcal{T})$ i.i.d.\ non negative integers sampled according to a given law $ \mu$, which are the car arrivals on $ \mathcal{T}$. Each car tries to park on its arriving vertex and if the spot is already occupied, it drives towards the root and takes the first available spot. If no spot is found, then it exits the tree without parking. In this paper, we provide a criterion to determine the phase of the parking process (subcritical, critical, or supercritical) depending on the generating function of $ \mu$.
Forward citations
Cited by 1 Pith paper
-
Short survey of results and open problems for parking problems on random trees
A survey of existing results on parking problems on random trees, with no new theorems, that lists open directions for future research.
Discussion (0). Continue with ORCID to comment.