Jamming coverage in competitive random sequential adsorption of a binary mixture

被引：27

作者：

Hassan, M. Kamrul ^{[1
,2
]}

Schmidt, Jürgen ^{[1
]}

Blasius, Bernd ^{[1
]}

Kurths, Jürgen ^{[1
]}

机构：

[1] Department of Physics, University of Potsdam, Postfach 601553, D-14415 Potsdam, Germany

[2] Department of Physics, Theoretical Physics Division, University of Dhaka, Dhaka 1000, Bangladesh

来源：

| 2002年 / American Physical Society卷 / 65期

关键词：

Adsorption - Computer simulation - Interpolation - Parking - Probability - Problem solving;

D O I：

10.1103/PhysRevE.65.045103

中图分类号：

学科分类号：

摘要：

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 unisized case. The analytical results are in good agreement with our direct numerical simulations of the problem. © 2002 The American Physical Society.

引用