The vertical profile of embedded trees
Mireille Bousquet-M\'elou (LaBRI), Guillaume Chapuy (LIAFA)

TL;DR
This paper derives exact formulas for the distribution of embedded binary trees' vertical profiles, connecting combinatorial enumeration with probabilistic limits like the integrated superbrownian excursion.
Contribution
It introduces explicit combinatorial formulas for the vertical profile of embedded trees and extends these results to related tree families, with bijective proofs.
Findings
Derived explicit formulas for tree profiles.
Connected tree profiles to probabilistic limits.
Extended formulas to other embedded tree families.
Abstract
Consider a rooted binary tree with n nodes. Assign with the root the abscissa 0, and with the left (resp. right) child of a node of abscissa i the abscissa i-1 (resp. i+1). We prove that the number of binary trees of size n having exactly n_i nodes at abscissa i, for l =< i =< r (with n = sum_i n_i), is with n_{l-1}=n_{r+1}=0. The sequence (n_l, ..., n_{-1};n_0, ..., n_r) is called the vertical profile of the tree. The vertical profile of a uniform random tree of size n is known to converge, in a certain sense and after normalization, to a random mesure called the integrated superbrownian excursion, which motivates our interest in the profile. We prove similar looking formulas for other families of trees whose nodes are embedded in Z. We also refine these…
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.
Taxonomy
TopicsStochastic processes and statistical mechanics · Graph theory and applications · Markov Chains and Monte Carlo Methods
