Pith. sign in

REVIEW 1 cited by

Universality for catalytic equations and fully parked 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

arxiv 2503.17348 v1 pith:VS476GIE submitted 2025-03-21 math.PR math.CO

classification math.PRmath.CO
keywords treebrowniancatalyticequationsfullyparkedpolynomialrandom
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

We show that critical parking trees conditioned to be fully parked converge in the scaling limits towards the Brownian growth-fragmentation tree, a self-similar Markov tree different from Aldous' Brownian tree recently introduced and studied by Bertoin, Curien and Riera. As a by-product of our study, we prove that positive non-linear polynomial equations involving a catalytic variable display a universal polynomial exponent $5/2$ at their singularity, confirming a conjecture by Chapuy, Schaeffer and Drmota & Hainzl. Compared to previous analytical works on the subject, our approach is probabilistic and exploits an underlying random walk hidden in the random tree model.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

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

    math.PR 2025-05 conditional

    A survey of existing results on parking problems on random trees, with no new theorems, that lists open directions for future research.

Pith tools