Abstract
We study here, by using a recursive approach, the number of random cuts that are necessary to destroy a random tree of size n for simply generated tree families. Crucial for the applicability of such a recursive approach is a "randomness-preservation" property when cutting off a random edge. We can fully characterize the subclass of simply generated tree families, which satisfy this property and show then for for all these tree families that the number of random cuts to destroy a random size-n tree is asymptotically, for n → ∞, Rayleigh distributed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
