Pages that link to "Item:Q3529509"
From MaRDI portal
The following pages link to Subtree Sizes in Recursive Trees and Binary Search Trees: Berry–Esseen Bounds and Poisson Approximations (Q3529509):
Displaying 13 items.
- Metric dimension of critical Galton-Watson trees and linear preferential attachment trees (Q2033923) (← links)
- Limit theorems for patterns in phylogenetic trees (Q2340020) (← links)
- Multivariate normal limit laws for the numbers of fringe subtrees in \(m\)-ary search trees and preferential attachment trees (Q2363114) (← links)
- Search trees: metric aspects and strong limit theorems (Q2454410) (← links)
- The subtree size profile of bucket recursive trees (Q2834862) (← links)
- Limit theorems for subtree size profiles of increasing trees (Q2888869) (← links)
- Phase Changes in Subtree Varieties in Random Recursive and Binary Search Trees (Q3614199) (← links)
- On the Subtree Size Profile of Binary Search trees (Q4933600) (← links)
- A non-increasing tree growth process for recursive trees and applications (Q4993121) (← links)
- A study of large fringe and non-fringe subtrees in conditional Galton-Watson trees (Q5278119) (← links)
- On the size of paged recursive trees (Q5347255) (← links)
- Distributions of 4-subtree patterns for uniform random unrooted phylogenetic trees (Q6496316) (← links)
- Phase transitions of composition schemes: Mittag-Leffler and mixed Poisson distributions (Q6620079) (← links)
