BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Probabilizing Parking Functions - Persi Diaconis (Stanford)
DTSTART:20170509T151500Z
DTEND:20170509T161500Z
UID:TALK71851@talks.cam.ac.uk
CONTACT:Perla Sousi
DESCRIPTION:Parking functions are a novel combinatorial object that come\n
 up in computer science hashing\, in chip-firing games\, MacDonald\npolynom
 ials and 'all over the place'. One way to study a new object is\nto ask 'w
 hat does a typical one 'look like'?'. In joint work with\nAngela Hicks\, w
 e find new facts about parking functions (what's the\ndistribution of pi(1
 )?) and new uses for for some esoteric facts about\nBrownian excursion. Th
 e search also illuminates the statistical\nmechanics mantra of equivalence
  of ensembles.
LOCATION:MR12\, CMS\, Wilberforce Road\, Cambridge\, CB3 0WB
END:VEVENT
END:VCALENDAR