TY - JOUR
T1 - The ergodic theory of traffic jams
AU - Gray, Lawrence
AU - Griffeath, David
PY - 2001/11
Y1 - 2001/11
N2 - We introduce and analyze a simple probabilistic cellular automaton which emulates the flow of cars along a highway. Our Traffic CA captures the essential features of several more complicated algorithms, studied numerically by K. Nagel and others over the past decade as prototypes for the emergence of traffic jams. By simplifying the dynamics, we are able to identify and precisely formulate the self-organized critical evolution of our system. We focus here on the Cruise Control case, in which well-spaced cars move deterministically at maximal speed, and we obtain rigorous results for several special cases. Then we introduce a symmetry assumption that leads to a two-parameter model, described in terms of acceleration (α) and braking (β) probabilities. Based on the results of simulations, we map out the (α, β) phase diagram, identifying three qualitatively distinct varieties of traffic which arise, and we derive rigorous bounds to establish the existence of a phase transition from free flow to jams. Many other results and conjectures are presented. From a mathematical perspective, Traffic CA provides local, particle-conserving, one-dimensional dynamics which cluster, and converge to a mixture of two distinct equilibria.
AB - We introduce and analyze a simple probabilistic cellular automaton which emulates the flow of cars along a highway. Our Traffic CA captures the essential features of several more complicated algorithms, studied numerically by K. Nagel and others over the past decade as prototypes for the emergence of traffic jams. By simplifying the dynamics, we are able to identify and precisely formulate the self-organized critical evolution of our system. We focus here on the Cruise Control case, in which well-spaced cars move deterministically at maximal speed, and we obtain rigorous results for several special cases. Then we introduce a symmetry assumption that leads to a two-parameter model, described in terms of acceleration (α) and braking (β) probabilities. Based on the results of simulations, we map out the (α, β) phase diagram, identifying three qualitatively distinct varieties of traffic which arise, and we derive rigorous bounds to establish the existence of a phase transition from free flow to jams. Many other results and conjectures are presented. From a mathematical perspective, Traffic CA provides local, particle-conserving, one-dimensional dynamics which cluster, and converge to a mixture of two distinct equilibria.
KW - Conservative flow
KW - Ergodic
KW - Interacting particle system
KW - Phase separation
KW - Traffic jam
UR - http://www.scopus.com/inward/record.url?scp=0035498174&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0035498174&partnerID=8YFLogxK
U2 - 10.1023/A:1012202706850
DO - 10.1023/A:1012202706850
M3 - Article
AN - SCOPUS:0035498174
SN - 0022-4715
VL - 105
SP - 413
EP - 452
JO - Journal of Statistical Physics
JF - Journal of Statistical Physics
IS - 3-4
ER -