The Critical Beta-splitting Random Tree III: The exchangeable partition representation and the fringe tree
David J. Aldous, Svante Janson

TL;DR
This paper investigates the asymptotic structure of the critical beta-splitting random tree model using probabilistic methods, introducing a continuous-time embedding and describing the limit fringe distribution related to exchangeable partitions.
Contribution
It presents two core probabilistic methods for analyzing the $n o fty$ asymptotics of the beta-splitting tree model, including a continuous-time embedding and a limit fringe distribution description.
Findings
Introduces a continuous-time model (CTCS) for the beta-splitting tree.
Establishes a limit structure CTCS(∞) via exchangeable partitions.
Provides an explicit description of the limit fringe distribution.
Abstract
In the critical beta-splitting model of a random -leaf rooted tree, clades are recursively split into sub-clades, and a clade of leaves is split into sub-clades containing and leaves with probabilities . Study of structure theory and explicit quantitative aspects of the model is an active research topic. It turns out that many results have several different proofs, and detailed studies of analytic proofs are given elsdewhere (via analysis of recursions and via Mellin transforms). This article describes two core probabilistic methods for studying asymptotics of the basic finite--leaf models. (i) There is a canonical embedding into a continuous-time model, that is a random tree CTCS(n) on leaves with real-valued edge lengths, and this model turns out to be more convenient to study. The family (CTCS(n), is consistent…
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.
