Some central limit theorems for critical beta-splitting tree

Abstract

We further explore a connection initially unveiled in Iksanov (2025) between critical beta-splitting trees and infinite `balls-in-boxes' schemes. Using the connection, we derive a new joint central limit theorem for components of the height of a leaf chosen uniformly at random in the discrete version of a critical beta-splitting tree. Also, we obtain a joint central limit theorem for the heights in the discrete and continuous versions of a critical beta-splitting tree.