Asymptotic properties of protected nodes in random recursive trees
From MaRDI portal
Recommendations
Cited in
(20)- Normal limiting distribution of the size of binary interval trees
- \(k\)-protected vertices in unlabeled rooted plane trees
- Limiting probabilities for vertices of a given rank in 1-2 trees
- Stochastic approximation on noncompact measure spaces and application to measure-valued Pólya processes
- Local limits of Galton–Watson trees conditioned on the number of protected nodes
- Enumeration of protected nodes in Motzkin trees
- Protection number in plane trees
- Normal Limit Law for Protected Node Profile of Random Recursive Trees
- Protected vertices in Motzkin trees
- Protection number of recursive trees
- On a random search tree: asymptotic enumeration of vertices by distance from leaves
- Degree profile of m-ary search trees: a vehicle for data structure compression
- On the peel number and the leaf-height of Galton–Watson trees
- On 2-protected nodes in random digital trees
- Protection numbers in simply generated trees and Pólya trees
- On the protected nodes in exponential recursive trees
- The distribution of the maximum protection number in simply generated trees
- Leaves of preferential attachment trees
- Characterization of trees with maximum security
- Protected nodes and fringe subtrees in some random trees
This page was built for publication: Asymptotic properties of protected nodes in random recursive trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5252253)
