BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//132.216.98.100//NONSGML kigkonsult.se iCalcreator 2.20.4//
BEGIN:VEVENT
UID:20260526T074211EDT-9778M9FJAg@132.216.98.100
DTSTAMP:20260526T114211Z
DESCRIPTION:Title: Precise asymptotics for the height of weighted recursive
  trees\n\nAbstract:  Weighted recursive trees (WRT) are built by adding su
 ccessively vertices with predetermined weights to a tree: each new vertex 
 is attached to a parent chosen randomly proportionally to its weight. Rece
 ntly\, Delphin Sénizergues used branching random walk methods to describe 
 the profile of WRT and proved that their height behaves asymptotically as 
 a constant multiple of log(n) under certain regularity assumptions for the
  weights. In this talk\, I will present a future work with Delphin Sénizer
 gues where we obtained the second and third order for the height\, proving
  that the behavior is similar to one appearing for the maximum of a branch
 ing random walk. I will present the main ideas of the proof\, comparing th
 em with the branching random walk case.\n\n \n\nLink: https://mcgill.zoom.
 us/j/97093259428?pwd=d25yR0J6WGViSzFZOE5rT01YZnBJQT09\n\nMeeting ID: 970 9
 325 9428\n\nPasscode: problab\n
DTSTART:20200930T150000Z
DTEND:20200930T160000Z
SUMMARY:Michel Pain (NYU/Courant)
URL:https://www.mcgill.ca/mathstat/channels/event/michel-pain-nyucourant-32
 4947
END:VEVENT
END:VCALENDAR