BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Vienna
BEGIN:DAYLIGHT
DTSTART:20250330T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20251026T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260424T214038Z
UID:672a2a99bdbad100423862@ist.ac.at
DTSTART:20250526T160000
DTEND:20250526T170000
DESCRIPTION:Speaker: William da Silva\nhosted by Laszlo Erdös\, Jan Maas\n
 Abstract: The Brownian separable permutons form a one-parameter family of 
 permutons\, which are the universal scaling limits of pattern-avoiding per
 mutations. In this talk\, we will be interested in the length of the longe
 st increasing subsequence (LIS) in permutations of size n sampled from the
  Brownian permutons. We give an answer to the celebrated Ulam-Hammersley p
 roblem in this context: what is the exact behaviour of LIS as n goes to in
 finity? In fact\, we prove a more precise scaling limit result for the LIS
 . A significant portion of the talk will be dedicated to our motivation be
 hind the problem\, emphasising connections to various objects in probabili
 ty\, such as random decorated trees\, random graphs\, directed planar maps
  and SLE/LQG. The talk is based on joint work with Arka Adhikari\, Jacopo 
 Borga\, Thomas Budzinski and Delphin Snizergues.
LOCATION:Central Bldg / O1 / Mondi 2a (I01.O1.008)\, ISTA
ORGANIZER:boosthui@ist.ac.at
SUMMARY:William da Silva: The longest increasing subsequence of Brownian se
 parable permutons
URL:https://talks-calendar.ista.ac.at/events/5384
END:VEVENT
END:VCALENDAR