Related papers: A model of random sequential adsorption on a ladde…
In random sequential covering, identical objects are deposited randomly, irreversibly, and sequentially; only attempts increasing the coverage are accepted. A finite system eventually gets congested, and we study the statistics of congested…
Irreversible adsorption of spheres on flat collectors having dimension $d<2$ is studied. Molecules are adsorbed on Sierpinski's Triangle and Carpet like fractals ($1<d<2$), and on General Cantor Set ($d<1$). Adsorption process is modeled…
We introduce a sequential model for the deposition and aggregation of particles in the submonolayer regime. Once a particle has been randomly deposited on the substrate, it sticks to the closest atom or island within a distance \ell,…
The different variants of two-stage random sequential adsorption (RSA) models for packing of disks and discorectangles on a two-dimensional (2D) surface were investigated. In the SD model, the discorectangles were first deposited and then…
Random sequential adsorption (RSA) is a standard method of modeling adsorption of large molecules at the liquid-solid interface. Several studies have recently conjectured that in the RSA of rectangular needles, or $k$-mers, on a square…
Random sequential addition (RSA) models are used in a large variety of contexts to model particle aggregation and jamming. A key feature of these models is the algebraic time dependence of the asymptotic jamming coverage as $t\to\infty$.…
When gas molecules bind to a surface they may do so in such a way that the adsorption of one molecule inhibits the arrival of others. We consider random sequential adsorption in which the empty sites of a graph are irreversibly occupied in…
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…
We filled a void with a regular or asymmetric pattern without overlap using a time-dependent packing method termed random sequential adsorption (RSA). In the infinite-time limit, the density of coverage frequently hits a limit. This study…
The Random Sequential Adsorption (RSA) problem holds crucial theoretical and practical significance, serving as a pivotal framework for understanding and optimizing particle packing in various scientific and technological applications. Here…
Adsorption of trimers and hexamers built of identical spheres was studied numerically using the Random Sequential Adsorption (RSA) algorithm. Particles were adsorbed on a two dimensional, flat and homogeneous surface. Numerical simulations…
We study random sequential adsorption (RSA) of a class of solids that can be obtained from a cube by specific cutting of its vertices, in order to find out how the transition from tetrahedral to octahedral symmetry affects the densities of…
Jamming phenomena on a square lattice are investigated for two different models of anisotropic random sequential adsorption (RSA) of linear $k$-mers (particles occupying $k$ adjacent adsorption sites along a line). The length of a $k$-mer…
The aim of the study presented here was the analysis of packings generated according to random sequential adsorption protocol consisting of identical Platonic and Archimedean solids. The computer simulations performed showed, that the…
We study approach to the large-time jammed state of the deposited particles in the model of random sequential adsorption. The convergence laws are usually derived from the argument of Pomeau which includes the assumption of the dominance,…
Random sequential adsorption (RSA) of various two dimensional objects is studied in order to find a shape which maximizes the saturated packing fraction. This investigation was begun in our previous paper [Cie\'sla et al., Phys. Chem. Chem.…
We study by Monte Carlo computer simulations random sequential adsorption (RSA) with diffusional relaxation, of lattice hard squares in two dimensions. While for RSA without diffusion the coverage approaches its maximum jamming value…
The first theoretical study of a dimer's adsorption process at homogenous surface is presented. By using the RSA algorithm, we show example monolayers, discuss estimations of random jamming coverage and measure the surface blocking…
Random sequential addition (RSA) time-dependent packing process, in which congruent hard hyperspheres are randomly and sequentially placed into a system without interparticle overlap, is a useful packing model to study disorder in high…
Restricted-valence random sequential adsorption~(RSA) is studied in its pure and disordered versions, on the square and triangular lattices. For the simplest case~(pure on the square lattice) we prove the absence of percolation for maximum…