Related papers: Random Sequential Adsorption, Series Expansion and…
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…
Standard models of sequential adsorption are implicitly formulated in a {\em scale invariant} form, by assuming adsorption on an infinite surface, with no characteristic length scales. In real situations, however, involving complex…
In random sequential adsorption (RSA), objects are deposited on a substrate randomly, irreversibly, and sequentially. Attempts of deposition that lead to an overlap with previously deposited objects are discarded. The process continues…
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…
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 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…
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.…
Adsorption of tetramer built of four identical spheres was studied numerically using the Random Sequential Adsorption (RSA) algorithm. Tetramers were adsorbed on a two dimensional, flat and homogeneous surface. Two different models of the…
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…
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…
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…
Random sequential adsorption (RSA) of polymer, modeled as a chain of identical spheres, is systematically studied. In order to control precisely anisotropy and number of degrees of freedom, two different kinds of polymers are used. In the…
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…
In random sequential covering, identical objects are deposited randomly, irreversibly, and sequentially; only attempts that increase coverage are accepted. The process continues indefinitely on an infinite substrate, and we analyze the…
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…
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…
It is shown that the fluctuations of the jamming coverage upon Random Sequential Adsorption ($\sigma_{\theta_J}$), decay with the lattice size according to the power-law $\sigma_{\theta_J} \propto L^{-1 / \nu_J}$, with $\nu_{J} = 2 / (2D -…
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 investigate the properties of a sequential Monte Carlo method where the particle weight that appears in the algorithm is estimated by a positive, unbiased estimator. We present broadly-applicable convergence results, including a central…