Related papers: On the random filling of $R^d$ by non-\-overlappin…
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…
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…
As the main problem, we consider covering of a $d$-dimensional cube by $n$ balls with reasonably large $d$ (10 or more) and reasonably small $n$, like $n=100$ or $n=1000$. We do not require the full coverage but only 90\% or 95\% coverage.…
We consider the reversible random sequential adsorption of line segments on a one-dimensional lattice. Line segments of length $l \geq 2$ adsorb on the lattice with a adsorption rate $K_a$, and leave with a desorption rate $K_d$. We…
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…
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…
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…
We express the coverage (occupation fraction) $\theta$, in powers of time $t$ for four models of two-dimensional lattice random sequential adsorption (RSA) to very high orders by improving an algorithm developed by the present authors [J.…
We discuss two important techniques, series expansion and Monte Carlo simulation, for random sequential adsorption study. Random sequential adsorption is an idealization for surface deposition where the time scale of particle relaxation is…
A model for cooperative sequential adsorption that incorporates nearest-neighbor exclusion and next-nearest neighbor interaction is presented. It is analyzed for the case of one-dimensional dimer and two-dimensional monomer adsorption.…
Random sequential adsorption of linear and square particles with excluded volume interaction is studied numerically on planar lattices considering Gaussian distributions of lateral sizes of the incident particles, with several values of the…
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$.…
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…
The isostatic jamming limit of frictionless spherical particles from Edwards' statistical mechanics [Song \emph{et al.}, Nature (London) {\bf 453}, 629 (2008)] is generalized to arbitrary dimension $d$ using a liquid-state description. The…
In this work we extend recent study of the properties of the dense packing of "superdisks," by Y. Jiao, F. H. Stillinger and S. Torquato, Phys. Rev. Lett. 100, 245504 (2008), to the jammed state formed by these objects in random sequential…
Simple random coverage models, well studied in Euclidean space, can also be defined on a general compact metric space. By analogy with the geometric models, and with the discrete coupon collector's problem and with cover times for finite…
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 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,…
In this paper we use counting arguments to prove that the expected percentage coverage of a $d$ dimensional parameter space of size $n$ when performing $k$ trials with either Latin Hypercube sampling or Orthogonal sampling (when $n=p^d$) is…
The properties of the number of iterations in random sequential adsorption protocol needed to generate finite saturated random packing of spherically symmetric shapes were studied. Numerical results obtained for one, two, and three…