Jamming and asymptotic behavior in competitive random parking of bidisperse cars

From MaRDI portal
Publication:1848211

DOI10.1016/S0378-4371(02)01236-0zbMATH Open1001.90012arXivcond-mat/0205315OpenAlexW2091483973WikidataQ57067408 ScholiaQ57067408MaRDI QIDQ1848211FDOQ1848211


Authors: M. K. Hassan, Jürgen Schmidt, Bernd Blasius, J. Kurths Edit this on Wikidata


Publication date: 19 November 2002

Published in: Physica A (Search for Journal in Brave)

Abstract: We propose a generalized car parking problem where either a car of size sigma or of size msigma (m>1) is sequentially parked on a line with probability q and (1q), respectively. The free parameter q interpolates between the classical car parking problem at either extreme (q=0 and q=1) and the competitive random sequential adsorption of a binary mixture in between. We find that the coverage in the jamming limit for a mixture always exceeds the value obtained for the uni-sized case. The introduction of a bidisperse mixture results in the slow approach (simt1) to the jamming limit by the smaller species while the larger species reach their asymptotic values exponentially fast simt1e(m1)qt.


Full work available at URL: https://arxiv.org/abs/cond-mat/0205315




Recommendations




Cites Work


Cited In (4)





This page was built for publication: Jamming and asymptotic behavior in competitive random parking of bidisperse cars

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