On the structure of random plane‐oriented recursive trees and their branches
- 1 January 1993
- journal article
- research article
- Published by Wiley in Random Structures & Algorithms
- Vol. 4 (2) , 151-176
- https://doi.org/10.1002/rsa.3240040204
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Asymptotic Joint Normality of Outdegrees of Nodes in Random Recursive TreesRandom Structures & Algorithms, 1992
- On the Distribution of Leaves in Rooted Subtrees of Recursive TreesThe Annals of Applied Probability, 1991
- On the complexity of algorithms on recursive treesTheoretical Computer Science, 1990
- Asymptotic Normality in the Generalized Polya–Eggenberger Urn Model, with an Application to Computer Data StructuresSIAM Journal on Algebraic Discrete Methods, 1985
- Two Probability Models of Pyramid or Chain Letter Schemes Demonstrating that Their Promotional Claims are UnreliableOperations Research, 1984
- On the number of terminal vertices in certain random trees with an application to stemma construction in philologyJournal of Applied Probability, 1982
- A Probability Model of a Pyramid SchemeThe American Statistician, 1977
- Branching ProcessesPublished by Springer Nature ,1972
- Distribution of nodes of a tree by degreeMathematical Biosciences, 1970