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) - Node similarities and random projections in AI search and recommendation systems
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