Random sequential bisection and its associated binary tree
From MaRDI portal
Publication:1091019
DOI10.1007/BF02491450zbMath0622.60020MaRDI QIDQ1091019
Publication date: 1987
Published in: Annals of the Institute of Statistical Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02491450
Related Items
One-sided variations on interval trees, On Random Fragmentations Arising From Binary Splitting, Moments of a non‐homogenous bi‐variate fragmentation process using integral equations tools, Statistical aspects of random fragmentations, The size of random fragmentation trees, Normal limiting distribution of the size of binary interval trees, Fragment size distributions in random fragmentations with cutoff, Weak convergence results for the Kakutani interval splitting procedure., One-sided variations on binary search trees, Paths in \(m\)-ary interval trees, Probabilistic analysis of maximal gap and total accumulated length in interval division
Cites Work
- On growing random binary trees
- The asymptotic behavior of spacings under Kakutani's model for interval subdivision
- A proof of Kakutani's conjecture on random subdivision of longest intervals
- On the Most Probable Shape of a Search Tree Grown from a Random Permutation
- On the minimum of gaps generated by one-dimensional random packing
- A note on the height of binary search trees
- Entropy and maximal spacings for random partitions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item