Under bounded weights satisfying Sn/n oℓ, the depth profile of depth-weighted recursive trees admits an Edgeworth-type scaling limit involving a random analytic function, and depth is a.s. asymptotic to e log n.
Title resolution pending
1 Pith paper cite this work, alongside 21 external citations. Polarity classification is still indexing.
1
Pith paper citing it
21
external citations · OpenAlex
fields
math.PR 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Depth profile of depth-weighted trees with bounded weights
Under bounded weights satisfying Sn/n oℓ, the depth profile of depth-weighted recursive trees admits an Edgeworth-type scaling limit involving a random analytic function, and depth is a.s. asymptotic to e log n.