Poisson-Dirichlet Scaling Limits of Kemp's Supertrees

In this 27-minute conference talk from the International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2025), speaker Benedikt Stufler from TU Wien explores Poisson-Dirichlet scaling limits of Kemp's supertrees. Delivered on May 6, 2025 at the Fields Institute, discover advanced mathematical concepts at the intersection of probability theory and combinatorial structures. Learn about the asymptotic behavior of these specialized tree structures and their relationship to Poisson-Dirichlet distributions, a key topic in modern algorithmic analysis.