Related papers: Random Sequential Adsorption on Fractals
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 packing of spheres inside fractal collectors of dimension 2 < d < 3 is studied numerically using Random Sequential Adsorption (RSA) algorithm. The paper focuses mainly on the measurement of random packing saturation limit.…
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…
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…
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 (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…
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…
Random sequential adsorption algorithm is a popular tool for modelling structure of monolayers built in irreversible adsorption experiments. However, this algorithm becomes very inefficient when the density of molecules in a layer rises.…
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…
An extension of the Random Sequential Adsorption (RSA) model has been proposed recently, motivated by the coverage of oil droplets by DNA-functionalized colloidal particles. Particles arrive to a flat substrate with a uniform flux F but…
A simple multiscale approach to the diffusion-driven adsorption from a solution to a solid surface is presented. The model combines two important features of the adsorption process: (i) the kinetics of the chemical reaction between…
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…
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$,…
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…
We study two-dimensional random sequential adsorption (RSA) of flat polygons and rounded squares aligned in parallel to find a transition in the asymptotic behavior of the kinetics of packing growth. Differences in the kinetics for RSA of…
The first theoretical study of a dimer's adsorption process at homogenous surface is presented. By using the RSA algorithm, we show example monolayers, discuss estimations of random jamming coverage and measure the surface blocking…
Random packings and their properties are a popular and active field of research. Numerical algorithms that can efficiently generate them are useful tools in their study. This paper focuses on random packings produced according to the random…
A notorious problem in mathematics and physics is to create a solvable model for random sequential adsorption of non-overlapping congruent spheres in the $d$-dimensional Euclidean space with $d\geq 2$. Spheres arrive sequentially at…
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…