Seminar | September 20 | 3:10-4 p.m. | 1011 Evans Hall
Matthew Junge, Duke University
Parking functions were introduced by combinatorialists in the 1960s, and have recently been studied by probabilists. When the parking lot is an infinite graph and cars drive around at random, we will look at how many parking spots are needed for every car to eventually find a spot. Joint work with Michael Damron, Janko Gravner, Hanbeck Lyu, and David Sivakoff.