BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Vienna
BEGIN:DAYLIGHT
DTSTART:20190331T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20191027T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260405T223545Z
UID:5b3b5421dedaa028449062@ist.ac.at
DTSTART:20190611T163000
DTEND:20190611T173000
DESCRIPTION:Speaker: Soumik Pal\nhosted by M. Beiglböck\, N. Berestycki\, 
 L. Erdös\, J. Maas\nAbstract: Consider a binary tree with n labeled leave
 s. Randomly select a leaf for removal and then reinsert it back on an edge
  selected at random from the remaining structure. This produces a Markov c
 hain on the space of n-leaved binary trees whose invariant distribution is
  the uniform distribution. David Aldous\, who introduced and analyzed this
  Markov chain\, conjectured the existence of a continuum limit of this pro
 cess if we remove labels from leaves\, scale edge-length and time appropri
 ately with n\, and let n go to infinity. The conjectured diffusion will ha
 ve an invariant distribution given by the so-called Brownian Continuum Ran
 dom Tree. In a series of papers\, co-authored with N. Forman\, D. Rizzolo\
 , and M. Winkel\, we construct this continuum limit. This talk will be an 
 overview of our construction and describe the path behavior of this limiti
 ng object.
LOCATION:Big Seminar room Ground floor / Office Bldg West (I21.EG.101)\, IS
 TA
ORGANIZER:boosthui@ist.ac.at
SUMMARY:Soumik Pal: The Aldous diffusion on continuum trees
URL:https://talks-calendar.ista.ac.at/events/2003
END:VEVENT
END:VCALENDAR