Related papers: Reversible random sequential adsorption on a one-d…
We study the deposition of line segments on a two-dimensional square lattice. The estimates for the coverage at jamming obtained by Monte-Carlo simulations and by $7^{th}$-order time-series expansion are successfully compared. The…
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…
Random sequential adsorption of straight rigid rods of length $k$ ($k$-mers) on a simple cubic lattice has been studied by numerical simulations and finite-size scaling analysis. The calculations were performed by using a new theoretical…
We present the results of study of random sequential adsorption of linear segments (needles) on sites of a square lattice. We show that the percolation threshold is a nonmonotonic function of the length of the adsorbed needle, showing a…
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 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…
We report a surprising result, established by numerical simulations and analytical arguments for a one-dimensional lattice model of random sequential adsorption, that even an arbitrarily small imprecision in the lattice-site localization…
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…
Random sequential adsorption of binary mixtures of extended objects on a two-dimensional triangular lattice is studied numerically by means of Monte Carlo simulations. The depositing objects are formed by self-avoiding random walks on the…
Irreversible adsorption of objects of different shapes and sizes on Euclidean, fractal and random lattices is studied. The adsorption process is modeled by using random sequential adsorption (RSA) algorithm. Objects are adsorbed on one-,…
Random sequential adsorption with diffusional relaxation, of two by two square objects on the two-dimensional square lattice is studied by Monte Carlo computer simulation. Asymptotically for large lattice sizes, diffusional relaxation…
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…
Monte Carlo simulations and finite-size scaling analysis have been performed to study the jamming and percolation behavior of linear $k$-mers (also known as rods or needles) on the two-dimensional triangular lattice, considering an…
Random sequential adsorption (RSA) models have been studied due to their relevance to deposition processes on surfaces. The depositing particles are represented by hard-core extended objects; they are not allowed to overlap. Numerical Monte…
Random sequential adsorption is an irreversible surface deposition of extended objects. In systems with continuous degrees of freedom coverage follows a power law, theta(t) = theta_J - c t^{-alpha}, where the exponent alpha depends on the…
The effect of defects on the percolation of linear $k$-mers (particles occupying $k$ adjacent sites) on a square lattice is studied by means of Monte Carlo simulation. The $k$-mers are deposited using a random sequential adsorption…
The behavior of the percolation threshold and the jamming coverage for isotropic random sequential adsorption samples has been studied by means of numerical simulations. A parallel algorithm that is very efficient in terms of its speed and…
We study the random sequential adsorption of $k$-mers on the fully-connected lattice with $N=kn$ sites. The probability distribution $T_n(s,t)$ of the time $t$ needed to cover the lattice with $s$ $k$-mers is obtained using a generating…
We study the percolative properties of bi-dimensional systems generated by a random sequential adsorption of line-segments on a square lattice. As the segment length grows, the percolation threshold decreases, goes through a minimum and…
We have performed extensive simulations of random sequential adsorption and diffusion of $k$-mers, up to $k=5$ in two dimensions with particular attention to the case $k=2$. We focus on the behavior of the coverage and of vacancy dynamics…