On the distribution of leaves in rooted subtrees of recursive trees
From MaRDI portal
Publication:1175968
DOI10.1214/aoap/1177005874zbMath0738.05034OpenAlexW2073698762MaRDI QIDQ1175968
Hosam M. Mahmoud, Robert T. Smythe
Publication date: 25 June 1992
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoap/1177005874
Related Items
The Class of Tenable Zero-Balanced Pólya Urn Schemes: Characterization and Gaussian Phases, On rotations in fringe-balanced binary trees, On moment sequences and mixed Poisson distributions, Note on the heights of random recursive trees and random m‐ary search trees, Variance in randomized play-the-winner clinical trials, On the degree distribution of the nodes in increasing trees, The Moran forest, Long and short paths in uniform random recursive dags, A general limit theorem for recursive algorithms and combinatorial structures, Dynamic Pólya-Eggenberger urns, On the distribution of distances between specified nodes in increasing trees, Random sprouts as internet models, and Pólya processes, Asymptotics in randomized urn models, The Hitting Time for the Height of a Random Recursive Tree, Analysis of Statistics for Generalized Stirling Permutations, Limit distribution for the maximum degree of a random recursive tree