홈 › Papers

The GFB Tree and Tree Imbalance Indices

Tree balance plays an important role in various research areas in phylogenetics and computer science. Typically, it is measured with the help of a balance index or imbalance index. There are more than 25 such indices available, recently surveyed in a book by Fischer et al. They are used to rank rooted binary trees on a scale from the most balanced to the stringiest. We show that a wide range of subtree-sized based measures satisfying concavity and monotonicity conditions are minimized by the complete or greedy-from-the-bottom (GFB) tree and maximized by the caterpillar tree, yielding an infinitely large family of distinct new imbalance indices. Answering an open question from the literature, we show that one such established measure, the $\widehat{s}$-shape statistic, has the GFB tree as its unique minimizer. We also provide an alternative characterization of GFB trees, showing that they are equivalent to complete trees, which arise in different contexts. We give asymptotic bounds on the expected $\widehat{s}$-shape statistic under the uniform and Yule-Harding distributions of trees, and answer questions for the related $Q$-shape statistic as well.

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반