Random sequential bisection and its associated binary tree

DOI10.1007/BF02491450zbMath0622.60020OpenAlexW1978494366MaRDI QIDQ1091019

Yoshiaki Itoh, Masaaki Sibuya

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

zbMATH Keywords

random packing problemrandom sequential bisection

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Central limit and other weak theorems (60F05)

Related Items (11)

Weak convergence results for the Kakutani interval splitting procedure. ⋮ One-sided variations on binary search trees ⋮ Paths in \(m\)-ary interval trees ⋮ Normal limiting distribution of the size of binary interval trees ⋮ Moments of a non‐homogenous bi‐variate fragmentation process using integral equations tools ⋮ On Random Fragmentations Arising From Binary Splitting ⋮ The size of random fragmentation trees ⋮ Fragment size distributions in random fragmentations with cutoff ⋮ Statistical aspects of random fragmentations ⋮ Probabilistic analysis of maximal gap and total accumulated length in interval division ⋮ One-sided variations on interval trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Random sequential bisection and its associated binary tree