Caelan Atamanchuk (涩里番)
Title:聽The largest common subtree of two random trees.
Abstract: Given two trees, what is the size and structure of their largest common shared subtree? This question has been a growing topic of interest in the probability/combinatorics community in recent years, with the problem having been discussed for a few different models of random trees. In this talk, we will discuss the case where the two trees are independent Bienaym茅-Galton-Watson trees with finite-variance offspring distributions, conditioned to have size n. The main result will be a scaling limit for the size of the largest common subtrees of two such Bienaym茅 trees under some light assumptions. The talk is based on joint work with Omer Angel, Anna Brandenberger, Serte Donderwinkel, and Robin Khanfir.
Zoom link:
