Google, IBM & Meta Certificates — All 10,000+ Courses at 40% Off
One annual plan covers every course and certificate on Coursera. 40% off for a limited time.
Get Full Access
This lecture by Stephan Wagner from Graz University of Technology explores the statistical properties of random trees generated from depth-centric tree sources. Presented at the International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2025) at the Fields Institute on May 8, 2025, the 27-minute talk delves into mathematical models for tree generation with a focus on depth-related parameters. Learn about probabilistic methods for analyzing tree structures, combinatorial approaches to random tree generation, and asymptotic behaviors of tree statistics that are particularly relevant for algorithm analysis and computational applications.
