Work

Extremal subtrees of critical beta-splitting trees

Year: 2026

Type: preprint

Abstract: We determine the most and least likely shapes for an instance of the critical beta-splitting tree via a connection to data compression and Huffman's minimum redundancy codes. This allows us to answer combinatorial questions about the distribution of clades posed by Aldous and Janson, stated as problem 7 in arXiv:2303.02529.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2609.24973

Authors: Brandenberger, Anna, Chin, Byron, Mossel, Elchanan

Institutions: Massachusetts Institute of Technology, Georgia Institute of Technology

Language: English

Topic: Stochastic processes and statistical mechanics

Subfield: Mathematical Physics

Field: Mathematics

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W7214002205

Cites: 4

Cited by:

Related to: 10