Abstract
We study the asymptotic behavior af the number of cuts needed to isolate the root in a rooted binary random tree with leaves. We focus on the case of subtrees of the Continuum Random Tree generated by uniform sampling of leaves. We elaborate on a recent result by Abraham and Delmas, who showed that converges a.s. towards a Rayleigh-distributed random variable , which gives a continuous analog to an earlier result by Janson on conditioned, finite-variance Galton-Watson trees. We prove a convergence in distribution of towards a random mixture of Gaussian variables. The proofs use martingale limit theory for random processes defined on the CRT, related to the theory of records of Poisson point processes.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.