arXiv · cond-mat/0110036
Jamming coverage in competitive random sequential adsorption of binary mixture
Abstract
We propose a generalized car parking problem where cars of two different sizes are sequentially parked on a line with a given probability $q$. The free parameter $q$ 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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
M. K. Hassan, J. Schmidt, B. Balsius, J. Kurths. 2001-12-23. Jamming coverage in competitive random sequential adsorption of binary mixture. https://doi.org/10.1103/physreve.65.045103
Cite the original work for its findings. Save a collection to share your selection of sources.