Answers are grounded in this paper and cite their sources.
The layer of a vertex of a tree is the number of rounds of leaf removal after which the vertex is a leaf. Stepanyants, Krapivsky, Hartle and Krioukov computed the limiting proportion ₖ of vertices at layer k in a random recursive tree as an integral of an iterated nonlinear recursion, showed e⁻ᵏ∑j≥ kⱼ e-k/e, and conjectured that ₖ=exp[-k/e-3/2elog k-O(1)]. We prove that ₖ ek/ek3/(2e) converges to a positive finite constant. The recursion is the law of the minimal position Mₖ in generation k of the Poisson-weighted infinite tree, so that ∑j≥ kⱼ=E e-Mₖ, and the asymptotics follow from the results of Addario-Berry and Ford and of Aïdékon on that branching random walk. We also prove the layer half of their second conjecture: the largest layer Lₙ of a random recursive tree on n vertices equals half its diameter rounded down, and Lₙ=elog n-32loglog n+OP(1).
No takes yet. Share an insight, caveat, or question.
Yitzchak Shmalo (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: