Methods for Cutting Down Uniform Random Recursive Trees

This talk by Laura Eslava from the Instituto de Investigación en Matemáticas Aplicadas y en Sistemas explores methods for cutting down uniform random recursive trees. Presented at the International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2025) at the Fields Institute on May 7, 2025, the 48-minute lecture delves into mathematical techniques for analyzing tree structures. Learn about cutting processes on recursive trees and their probabilistic properties, which have applications in combinatorial analysis and algorithm design.