Canonical Trees, Compact Prefix-free Codes and Sums of Unit Fractions: A Probabilistic Analysis
Clemens Heuberger, Daniel Krenn, Stephan Wagner

TL;DR
This paper analyzes the probabilistic properties of canonical trees, compact prefix-free codes, and sums of unit fractions, revealing their distributional behaviors and concentration properties through a comprehensive probabilistic approach.
Contribution
It provides a probabilistic analysis of various parameters of canonical trees and codes, including their height, width, and leaf distribution, establishing normality and concentration results.
Findings
Height distribution is normal.
Number of summands follows a normal distribution.
Width exhibits concentration around its expectation.
Abstract
For fixed , we consider the class of representations of as sum of unit fractions whose denominators are powers of or equivalently the class of canonical compact -ary Huffman codes or equivalently rooted -ary plane "canonical" trees. We study the probabilistic behaviour of the height (limit distribution is shown to be normal), the number of distinct summands (normal distribution), the path length (normal distribution), the width (main term of the expectation and concentration property) and the number of leaves at maximum distance from the root (discrete distribution).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
