University of Cambridge > > Probability > Parking


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

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

A car or parking spot is placed at each vertex of an infinite graph. Cars drive in search of unparked spots. When a car finds one, both the car and spot are removed. Three distinct traffic flow phases occur as we vary the initial ratio of cars to spots. There is particularly intriguing behavior at criticality. Joint work with Michael Damron, Janko Gravner, Hanbeck Lyu, and David Sivakoff: arXiv id: 1710.10529.

This talk is part of the Probability series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2018, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity