Abstract
The structure of Galton-Watson trees conditioned to be of a given size is wellunderstood. We provide yet another embedding theorem that permits us to obtain asymptotic probabilities of events that are determined by what happens near the root of these trees. As an example, we derive the probability that a Galton-Watson tree is cut when each node is independently removed with probability p, where by cutting a tree we mean that every path from root to leaf must have at least one removed node. © 2011 Applied Probability Trust.
Author supplied keywords
Cite
CITATION STYLE
Devroye, L. (2011). A note on the probability of cutting a Galton-Watson tree. Electronic Journal of Probability, 16, 2001–2019. https://doi.org/10.1214/EJP.v16-952
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.