Related papers: Random sequential adsorption of tetramers
The different variants of two-stage random sequential adsorption (RSA) models for packing of disks and discorectangles on a two-dimensional (2D) surface were investigated. In the SD model, the discorectangles were first deposited and then…
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 study the adsorption of ideal random lattice copolymers with correlations in the sequences on homogeneous substrates with two different methods: An analytical solution of the problem based on the constrained annealed approximation…
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…
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…
Understanding the dynamic adsorption of colloidal particles at fluid interfaces is essential for applications ranging from emulsion stabilization to interfacial assembly of functional materials. Adsorption dynamics is often described…
We study saturated packings produced according to random sequential adsorption (RSA) protocol built of identical rectangles deposited on a flat, continuous plane. An aspect ratio of rectangles is defined as the length-to-width ratio,…
In random sequential adsorption (RSA), objects are deposited randomly, irreversibly, and sequentially; attempts leading to an overlap with previously deposited objects are discarded. The process continues until the system reaches a jammed…
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…
Relaxation of the packing of elongated particles (discorectangles) aligned on a line was studied numerically. The aspect ratio (length-to-width ratio) for the discorectangles was varied within the range $\varepsilon \in [1;50]$. The initial…
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…
Random sequential addition (RSA) time-dependent packing process, in which congruent hard hyperspheres are randomly and sequentially placed into a system without interparticle overlap, is a useful packing model to study disorder in high…
We present a model of one-dimensional irreversible adsorption in which particles once adsorbed immediately shrink to a smaller size or expand to a larger size. Exact solutions for the fill factor and the particle number variance as a…
We construct the complete structural phase diagram of polymer adsorption at substrates with attractive stripe-like patterns in the parameter space spanned by the adsorption affinity of the stripes and temperature. Results were obtained by…
The irreversible adsorption of polymers to a two-dimensional solid surface is studied. An operator formalism is introduced for chemisorption from a polydisperse solution of polymers which transforms the analysis of the adsorption process to…
Inspired by observations of beads packed on a thin string in such systems as sea-grapes and dental plaque, we study the random sequential adsorption of spheres on a cylinder. We determine the asymptotic fractional coverage of the cylinder…
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…
Many idealized problems in signal processing, machine learning and statistics can be reduced to the problem of finding the symmetric canonical decomposition of an underlying symmetric and orthogonally decomposable (SOD) tensor. Drawing…
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 propose a theoretical investigation of the physical adsorption of neutral comb-polymers with an adsorbing skeleton and non-adsorbing side-chains on a flat surface. Such polymers are particularly interesting as "dynamic coating" matrices…