BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Duncan Dauvergne (Princeton University)
DTSTART:20210225T130000Z
DTEND:20210225T140000Z
DTSTAMP:20260423T035827Z
UID:DCGParis/3
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/DCGParis/3/"
 >The Archimedean limit of random sorting networks</a>\nby Duncan Dauvergne
  (Princeton University) as part of Discrete and Computational Geometry Sem
 inar in Paris\n\n\nAbstract\nConsider a list of n particles labelled in in
 creasing order. A sorting\nnetwork is a way of sorting this list into decr
 easing order by swapping\nadjacent particles\, using as few swaps as possi
 ble. Simulations of\nlarge-n uniform random sorting networks reveal a surp
 rising and\nbeautiful global structure involving sinusoidal particle traje
 ctories\, a\nsemicircle law\, and a theorem of Archimedes. Based on these 
 simulations\,\nAngel\, Holroyd\, Romik\, and Virag made a series of conjec
 tures about the\nlimiting behaviour of sorting networks. In this talk\, I 
 will discuss how\nto use the local structure and combinatorics of random s
 orting networks\nto prove these conjectures.\n
LOCATION:https://researchseminars.org/talk/DCGParis/3/
END:VEVENT
END:VCALENDAR