Profiles of random trees: correlation and width of random recursive trees and binary search trees
From MaRDI portal
Publication:5694147
DOI10.1239/AAP/1118858628zbMATH Open1073.60006OpenAlexW2140003446MaRDI QIDQ5694147FDOQ5694147
Authors: Michael Drmota, Hsien-Kuei Hwang
Publication date: 29 September 2005
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1239/aap/1118858628
Recommendations
- Width and mode of the profile for some random trees of logarithmic height
- Bimodality and Phase Transitions in the Profile Variance of Random Binary Search Trees
- Profiles of random trees: Plane-oriented recursive trees
- Profiles of random trees: plane-oriented recursive trees
- Profiles of random trees: Limit theorems for random recursive trees and binary search trees
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Singularity Analysis of Generating Functions
- Title not available (Why is that?)
- The profile of binary search trees
- Asymptotic expansions for the Stirling numbers of the first kind
- Title not available (Why is that?)
- Cutting down recursive trees
- Distribution of nodes of a tree by degree
- Hopf-algebraic structure of families of trees
- On the covariance of the level sizes in random recursive trees
- Profiles of random trees: Limit theorems for random recursive trees and binary search trees
- Linear algorithms on recursive representations of trees
- On the Expected Depth of Random Circuits
- Total Path Length for Random Recursive Trees
- Limiting Distributions for Path Lengths in Recursive Trees
- Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
- Bimodality and Phase Transitions in the Profile Variance of Random Binary Search Trees
- Title not available (Why is that?)
- A Probability Model of a Pyramid Scheme
- Trees, Forests and Rearranging
- On the efficiency of a new method of dictionary construction
- On Random Binary Trees
- More Combinatorial Properties of Certain Trees
- Asymptotic Estimates of Elementary Probability Distributions
- On the analysis of algorithms for trees
Cited In (17)
- Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication
- The shape of unlabeled rooted random trees
- Edgeworth expansions for profiles of lattice branching random walks
- Canonical Trees, Compact Prefix-Free Codes, and Sums of Unit Fractions: A Probabilistic Analysis
- A functional limit theorem for the profile of search trees
- Profiles of random trees: plane-oriented recursive trees
- A functional limit theorem for the profile of \(b\)-ary trees
- Width and mode of the profile for some random trees of logarithmic height
- Analytical results for the in-degree and out-degree distributions of directed random networks that grow by node duplication
- The degree profile of random Pólya trees
- Convergence in distribution of random metric measure spaces (\(\Lambda \)-coalescent measure trees)
- Profile of random exponential recursive trees
- Subtree Sizes in Recursive Trees and Binary Search Trees: Berry–Esseen Bounds and Poisson Approximations
- Profile of random exponential binary trees
- Limit theorems for patterns in phylogenetic trees
- General Edgeworth expansions with applications to profiles of random trees
- Limit theorems for subtree size profiles of increasing trees
This page was built for publication: Profiles of random trees: correlation and width of random recursive trees and binary search trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5694147)