Tree Height and the Asymptotic Mean of the Colijn–Plazzotta Rank of Unlabeled Binary Rooted Trees

Abstract The Colijn–Plazzotta ranking is a bijective encoding of the unlabeled binary rooted trees with positive integers. We show that the rank f ( t ) of a tree t is closely related to its height h , the maximal path length from a leaf to the root. We consider the rank $$f(\tau _n)$$ f ( τ n ) of a random n -leaf tree $$\tau _n$$ τ n under each of three models: (i) uniformly random unlabeled unordered binary rooted trees, or unlabeled topologies; (ii) uniformly random leaf-labeled binary trees, or labeled topologies under the uniform model; and (iii) random binary search trees, or labeled topologies under the Yule–Harding model. Relying on the close relationship between tree rank and tree height, we obtain results concerning the asymptotic properties of $$\log \log f(\tau _n)$$ log log f ( τ n ) . In particular, we find $${\mathbb {E}}\{\log _2 \log f(\tau _n)\} \sim 2 \sqrt{\pi n}$$ E { log 2 log f ( τ n ) } ∼ 2 π n for uniformly random unlabeled ordered binary rooted trees and uniformly random leaf-labeled binary trees, and for a constant $$\alpha \approx 4.31107$$ α ≈ 4.31107 , $${\mathbb {E}}\{\log _2 \log f(\tau _n)\} \sim \alpha \log n $$ E { log 2 log f ( τ n ) } ∼ α log n for leaf-labeled binary trees under the Yule–Harding model. We show that the mean of $$f(\tau _n)$$ f ( τ n ) itself under the three models is largely determined by the rank $$c_{n-1}$$ c n - 1 of the highest-ranked tree—the caterpillar—obtaining an asymptotic relationship with $$\pi _n c_{n-1}$$ π n c n - 1

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.