Probabilizing Parking Functions

Add to your list(s) Download to your calendar using vCal

• Persi Diaconis (Stanford)
• Tuesday 09 May 2017, 16:15-17:15
• MR12, CMS, Wilberforce Road, Cambridge, CB3 0WB.

If you have a question about this talk, please contact Perla Sousi.

Parking functions are a novel combinatorial object that come up in computer science hashing, in chip-firing games, MacDonald polynomials and ‘all over the place’. One way to study a new object is to ask ‘what does a typical one ‘look like’?’. In joint work with Angela Hicks, we find new facts about parking functions (what’s the distribution of pi(1)?) and new uses for for some esoteric facts about Brownian excursion. The search also illuminates the statistical mechanics mantra of equivalence of ensembles.

This talk is part of the Probability series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• DPMMS Lists
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• MR12, CMS, Wilberforce Road, Cambridge, CB3 0WB
• Probability
• School of Physical Sciences
• Statistical Laboratory info aggregator
• bld31

Note that ex-directory lists are not shown.