Competitive random sequential adsorption of point and fixed-sized particles: analytical results

Abstract

We study the kinetics of competitive random sequential adsorption (RSA) of particles of binary mixture of points and fixed-sized particles within the mean-field approach. The present work is a generalization of the random car parking problem in the sense that it considers the case when either a car of fixed size is parked with probability q or the parking space is partitioned into two smaller spaces with probability (1-q) at each time event. This allows an interesting interplay between the classical RSA problem at one extreme (q=1), and the kinetics of fragmentation processes at the other extreme (q=0). We present exact analytical results for coverage for a whole range of q values, and physical explanations are given for different aspects of the problem. In addition, a comprehensive account of the scaling theory, emphasizing on dimensional analysis, is presented, and the exact expression for the scaling function and exponents are obtained.

7 pages, latex, 3 figures

Cited by in corpus (10)

• Morphology of Fine-Particle Monolayers Deposited on Nanopatterned Substrates
• Jamming coverage in competitive random sequential adsorption of binary mixture
• Gap-Size Distribution Functions of a Random Sequential Adsorption Model of Segments on the Line
• Fluctuations of the partial filling factors in competitive RSA from binary mixtures
• Random sequential adsorption of shrinking or spreading particles
• Jamming and percolation in the random sequential adsorption of a binary mixture on the square lattice
• Jamming and asymptotic behavior in competitive random parking of bidisperse cars
• Jammed state characterization of the random sequential adsorption of segments of two lengths on a line
• The effects of competition between random sequential nucleation of point-sized seeds and island growth by adsorption of finite-sized grains
• An analytic model for a cooperative ballistic deposition in one dimension