Schedule

Schedule:

July 17:

8:30 - 9:00: Coffee + Opening Remarks
9:00 - 9:30: Jonathan Novak (UCSD) - Invariant ensembles for coin flippers
9:30 - 10:00: Arnab Sen (Minnesota) - Correlation decay of maximum weight matching on sparse graphs
10:00 - 10:30: Lucas Teyssier (UBC) - On the Naruse hook length formula and mixing times

10:30 - 11:00: Coffee break

11:00 - 11:30: Laura Eslava (UNAM) - Methods for cutting down random recursive trees

11:30 - 12:00: Max Newman (Indiana) - Quenched limit laws for coalescents of mean-field populations with selfing
12:00 - 2:00: Lunch break

2:00 - 2:30: Stewart Ethier (Utah) - Testing for dice control at craps
2:30 - 3:00: Marydol Soto Santarriaga (UDel) - The rightmost and k-rightmost columns of ordered Chinese restaurant processes up-down chains: Markov properties and intertwining

3:00 - 3:30: Coffee break + Coin Flipping Competition, Part I

3:30 - 4:00: David Aldous (UC Berkely & Washington) - Three open problems
4:00 - 4:30: Gourab Ray (UVic) 
5:30 - 8:30: Informal dinner meetup at TBD

July 18:

8:30 - 9:00: Coffee
9:00 -  9:30: Sean English (UNCW) - Pattern avoidance for online permutations
9:30 - 10:00: Qiang Wu (Minnesota) - Cluster expansion of mean field spin glasses
10:00 - 10:30: Mokshay Madiman (UDel) - Log-concavity and Tracy-Widom universality

10:30 - 11:00: Coffee break

11:00 - 11:30: Erin Beckman (Utah State) - Chase escape with conversion

11:30 - 12:00: Stephen Melczer (Waterloo) - Automated combinatorial central limit theorems via ACSV
12:00 - 2:00: Lunch break 

2:00 - 2:30: Hugo Panzo (SLU) - Coalescing particles on an interval, permutations, and recursive trees
2:30 - 3:00: Tvrtko Tadić (Microsoft)
3:00 - 3:30: Coffee break + Coin Flipping Competition, Part II
3:30 - 4:00: Kelvin Rivera-Lopez (Gonzaga)
4:00 - 4:30: Noah Forman (McMaster) - Exchangeable hierarchies, tree growth, and self-similar interval partition trees

4:30 - 4:30 + epsilon: Closing Remarks