BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//132.216.98.100//NONSGML kigkonsult.se iCalcreator 2.20.4//
BEGIN:VEVENT
UID:20251111T164258EST-9952CJrOua@132.216.98.100
DTSTAMP:20251111T214258Z
DESCRIPTION:Title: The largest common subtree of two random trees.\n\nAbstr
 act: Given two trees\, what is the size and structure of their largest com
 mon 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 Biena
 ymé-Galton-Watson trees with finite-variance offspring distributions\, con
 ditioned to have size n. The main result will be a scaling limit for the s
 ize of the largest common subtrees of two such Bienaymé trees under some l
 ight assumptions. The talk is based on joint work with Omer Angel\, Anna B
 randenberger\, Serte Donderwinkel\, and Robin Khanfir.\n\nZoom link: https
 ://umontreal.zoom.us/j/83832644262?pwd=gQDOX4997Yehibng7GjtEKwUhqAqNV.1\n
DTSTART:20251113T163000Z
DTEND:20251113T173000Z
LOCATION:Room 920\, Burnside Hall\, CA\, QC\, Montreal\, H3A 0B9\, 805 rue 
 Sherbrooke Ouest
SUMMARY:Caelan Atamanchuk (ɬÀï·¬)
URL:/smerg/channels/event/caelan-atamanchuk-mcgill-uni
 versity-368828
END:VEVENT
END:VCALENDAR