A second-row parking paradox

DOI10.1007/S10955-009-9775-4MaRDI QIDQ842329zbMATH OpenOpenAlexFDO

Authors S. R. Fleurke, Christof Külske

Publication date 22 September 2009

Published in Journal of Statistical Physics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://arxiv.org/abs/0811.3599

zbMATH Keywords

car parking problemparticle systemsrandom sequential adsorptionsequential frequency assignment process

Mathematics Subject Classification ID

Trees (05C05) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Continuum models (systems of particles, etc.) arising in equilibrium statistical mechanics (82B21) Traffic problems in operations research (90B20)

Abstract: We consider two variations of the discrete car parking problem where at every vertex of the integers a car arrives with rate one, now allowing for parking in two lines. a) The car parks in the first line whenever the vertex and all of its nearest neighbors are not occupied yet. It can reach the first line if it is not obstructed by cars already parked in the second line (screening). b) The car parks according to the same rules, but parking in the first line can not be obstructed by parked cars in the second line (no screening). In both models, a car that can not park in the first line will attempt to park in the second line. If it is obstructed in the second line as well, the attempt is discarded. We show that both models are solvable in terms of finite-dimensional ODEs. We compare numerically the limits of first and second line densities, with time going to infinity. While it is not surprising that model a) exhibits an increase of the density in the second line from the first line, more remarkably this is also true for model b), albeit in a less pronounced way.

Recommendations

• On the parking problem
• The double-space parking problem
• Revisiting parallel car parking problem
• The problem of selfish parking
• A nonlinear parking problem
• The parking warden tour problem

Cites work

• Blocking and dimer processes on the Cayley tree
• Exact and approximate results for deposition and annihilation processes on graphs
• scientific article; zbMATH DE number 3171475 (Why is no real title available?)
• scientific article; zbMATH DE number 3892344 (Why is no real title available?)
• Parking on a random tree

Cited in

(9)

• Saturation in a Markovian parking process
• Parking cars with spin but no length
• The double-space parking problem
• Multilayer random sequential adsorption
• Per-site occupancy in the discrete parking problem
• Generalized random sequential adsorption on Erdős-Rényi random graphs
• Asymptotics in Knuth's parking problem for caravans
• Where should you park your car? The $\frac{1}{2}$ rule
• Multilayer parking with screening on a random tree

This page was built for publication: A second-row parking paradox

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q842329)