Pith. sign in

REVIEW

Particle-hopping Models of Vehicular Traffic: Distributions of Distance Headways and Distance Between Jams

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv cond-mat/9706094 v1 pith:JFRL5IRT submitted 1997-06-10 cond-mat.stat-mech

Particle-hopping Models of Vehicular Traffic: Distributions of Distance Headways and Distance Between Jams

classification cond-mat.stat-mech
keywords distancedistributionjamsmodeltrafficanalyticalheadwaysvehicles
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We calculate the distribution of the distance headways (i.e., the instantaneous gap between successive vehicles) as well as the distribution of instantaneous distance between successive jams in the Nagel-Schreckenberg (NS) model of vehicular traffic. When the maximum allowed speed, $V_{max}$, of the vehicles is larger than unity, over an intermediate range of densities of vehicles, our Monte Carlo (MC) data for the distance headway distribution exhibit two peaks, which indicate the coexistence of "free-flowing" traffic and traffic jams. Our analytical arguments clearly rule out the possibility of occurrence of more than one peak in the distribution of distance headways in the NS model when $V_{max} = 1$ as well as in the asymmetric simple exclusion process. Modifying and extending an earlier analytical approach for the NS model with $V_{max} = 1$, and introducing a novel transfer matrix technique, we also calculate the exact analytical expression for the distribution of distance between the jams in this model; the corresponding distributions for $V_{max} > 1$ have been computed numerically through MC simulation.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.