Related papers: Jamming coverage in competitive random sequential …
We propose a generalized car parking problem where either a car of size $\sigma$ or of size $m\sigma$ ($m>1$) is sequentially parked on a line with probability $q$ and $(1-q)$, respectively. The free parameter $q$ interpolates between the…
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 study analytically and numerically a model of random sequential adsorption (RSA) of segments on a line, subject to some constraints suggested by two kinds of physical situations: - deposition of dimers on a lattice where the sites have a…
We consider the non-overlapping irreversible random sequential adsorption (RSA) process on one-dimensional finite line, which is known also as the car parking process. The probability of each coverage in saturating states is analytically…
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…
We study the competitive irreversible adsorption of a binary mixture of monomers and square-shaped particles of linear size $R$ on the square lattice. With the random sequential adsorption model, we investigate how the jamming coverage and…
The goal of random sequential adsorption (RSA), a time-dependent packing method, is to create a regular or asymmetric covering of an empty space that can fit in the allocated space without overlapping. The density of coverage tends to reach…
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 random sequential adsorption (RSA) of identical elongated particles (discorectangles) on a line ("Paris car parking problem") was studied numerically. An off-lattice model with continuous positional and orientational degrees of freedom…
In random sequential adsorption (RSA), objects are deposited randomly, irreversibly, and sequentially; attempts leading to an overlap with previously deposited objects are discarded. The process continues until the system reaches a jammed…
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…
We have studied kinetics of random sequential adsorption of mixtures on a square lattice using Monte Carlo method. Mixtures of linear short segments and long segments were deposited with the probability $p$ and $1-p$, respectively. For…
We performed extensive simulations accompanied by a detailed study of a two-segment size random sequential model on the line. We followed the kinetics towards the jamming state, but we paid particular attention to the characterization of…
In the classical parking problem, unit intervals ("car lengths") are placed uniformly at random without overlapping. The process terminates at saturation, i.e. until no more unit intervals can be stowed. In this paper, we present a…
Consider the following simple parking process on $\Lambda_n := \{-n, \ldots, n\}^d,d\ge1$: at each step, a site $i$ is chosen at random in $\Lambda_n$ and if $i$ and all its nearest neighbor sites are empty, $i$ is occupied. Once occupied,…
The jamming and percolation for two generalized models of random sequential adsorption (RSA) of linear $k$-mers (particles occupying $k$ adjacent sites) on a square lattice are studied by means of Monte Carlo simulation. The classical…
A model for the adsorption of a binary mixture on a one-dimensional infinite lattice with nearest neighbour cooperative effects is considered. The particles of the two species are both monomers but differ in the repulsive interaction…
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 random sequential adsorption (RSA) model is a classical model in Statistical Physics for adsorption on two-dimensional surfaces. Objects are deposited sequentially at random and adsorb irreversibly on the landing site, provided that…
The fluctuations of the jamming coverage upon Random Sequential Adsorption (RSA) are studied using both analytical and numerical techniques. Our main result shows that these fluctuations (characterized by $\sigma_{\theta_J}$) decay with the…