Kinetics and Jamming Coverage in a Random Sequential Adsorption of Polymer Chains

Abstract

Using a highly efficient Monte Carlo algorithm, we are able to study the growth of coverage in a random sequential adsorption (RSA) of self-avoiding walk (SAW) chains for up to 10^{12} time steps on a square lattice. For the first time, the true jamming coverage (theta_J) is found to decay with the chain length (N) with a power-law theta_J propto N^{-0.1}. The growth of the coverage to its jamming limit can be described by a power-law, theta(t) approx theta_J -c/t^y with an effective exponent y which depends on the chain length, i.e., y = 0.50 for N=4 to y = 0.07 for N=30 with y -> 0 in the asymptotic limit N -> infinity.

RevTeX, 5 pages inclduing figures

References in corpus (3)

• A fast algorithm for random sequential adsorption of discs
• Locally Frozen Defects in Random Sequential Adsorption with Diffusional Relaxation
• Collective Effects in Random Sequential Adsorption of Diffusing Hard Squares

Cited by in corpus (8)

• Random sequential adsorption of partially oriented linear $k$-mers on square lattice
• Random Sequential Adsorption, Series Expansion and Monte Carlo Simulation
• Simulation study of random sequential adsorption of mixtures on a triangular lattice
• Morphology and Kinetics of Random Sequential Adsorption of Superballs: From Hexapods to Cubes
• Extended series expansions for random sequential adsorption
• On chemisorption of polymers to solid surfaces
• Random sequential adsorption of spheres on a cylinder
• Density and conformation with relaxed substrate, bulk, and interface electrophoretic deposition of polymer chains