Related papers: A fast algorithm for random sequential adsorption …
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…
We obtain long series (28 terms or more) for the coverage (occupation fraction) $\theta$, in powers of time $t$ for two models of random sequential adsorption with diffusional relaxation using an efficient algorithm developed by the…
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 (RSA) is a time-dependent packing process, in which particles of certain shapes are randomly and sequentially placed into an empty space without overlap. In the infinite-time limit, the density approaches a…
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…
We consider the model of random sequential adsorption, with depositing objects, as well as those already at the surface, decreasing in size according to a specified time dependence, from a larger initial value to a finite value in the large…
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…
Random packing of unoriented regular polygons and star polygons on a two-dimensional flat, continuous surface is studied numerically using random sequential adsorption algorithm. Obtained results are analyzed to determine saturated random…
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 consider a random sequential adsorption process on the one-dimensional lattice with nearest-neighbor exclusion. In this model, each site $s \in \mathbb{Z}$ starts empty and we will try to occupy it in time $t_s$, where…
The random sequential adsorption of various particle shapes is studied in order to determine the influence of particle anisotropy on the saturated random packing. For all tested particles there is an optimal level of anisotropy which…
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-,…
Saturated random packing of particles built of two identical, relatively shifted spheres in two and three dimensional flat and homogeneous space was studied numerically using random sequential adsorption algorithm. The shift between centers…
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…
We present an algorithm to simulate random sequential adsorption (random "parking") of discs on constant-curvature surfaces: the plane, sphere, hyperboloid, and projective plane, all embedded in three-dimensional space. We simulate complete…
We push the limit in planning collision-free motions for routing uniform labeled discs in two dimensions. First, from a theoretical perspective, we show that the constant-factor time-optimal routing of labeled discs can be achieved using a…
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…
This paper makes three contributions to estimating the number of perfect matching in bipartite graphs. First, we prove that the popular sequential importance sampling algorithm works in polynomial time for dense bipartite graphs. More…
Kinetics of random sequential adsorption (RSA) of spheres on flat, two-dimensional surfaces is governed by a power law with exponent $-1/2$. The study has shown that for RSA of nearly spherically symmetric particles this exponent is $-1/3$,…