paper

Jamming coverage in competitive random sequential adsorption of binary mixture

arXiv:cond-mat/0110036 · doi:10.1103/PhysRevE.65.045103

Abstract

We propose a generalized car parking problem where cars of two different sizes are sequentially parked on a line with a given probability . The free parameter interpolates between the classical car parking problem of only one car size and the competitive random sequential adsorption (CRSA) of a binary mixture. We give an exact solution to the CRSA rate equations and find that the final coverage, the jamming limit, of the line is always larger for a binary mixture than for the uni-sized case. The analytical results are in good agreement with our direct numerical simulations of the problem.

4 pages 2-column RevTeX, Four figures, (there was an error in the previous version. We replaced it (including figures) with corrected and improved version that lead to new results and conclusions)

References in corpus (1)

Cited by in corpus (14)