The Jammed Phase of the Biham-Middleton-Levine Traffic Model

Simple item page
dc.creatorAngel, Omer
dc.creatorHolroyd, Alexander E
dc.creatorMartin, James B
dc.date2005-03-31
dc.date2005-08-22
dc.date.accessioned2026-07-07T05:18:42Z
dc.date.available2026-07-07T05:18:42Z
dc.descriptionInitially a car is placed with probability p at each site of the two-dimensional integer lattice. Each car is equally likely to be East-facing or North-facing, and different sites receive independent assignments. At odd time steps, each North-facing car moves one unit North if there is a vacant site for it to move into. At even time steps, East-facing cars move East in the same way. We prove that when p is sufficiently close to 1 traffic is jammed, in the sense that no car moves infinitely many times. The result extends to several variant settings, including a model with cars moving at random times, and higher dimensions.
dc.description15 pages, 5 figures; revised journal version
dc.identifierhttps://arxiv.org/abs/math/0504001
dc.identifierhttp://arxiv.org/abs/math/0504001
dc.identifierElec. Comm. Prob. 10 (2005) 167--178
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/74754
dc.subjectProbability
dc.subjectCombinatorics
dc.subject60K35; 82B43
dc.titleThe Jammed Phase of the Biham-Middleton-Levine Traffic Model
dc.typetext

Files

Collections

arXiv