Year: 1996
Type: article
Abstract: Using a highly efficient Monte Carlo algorithm, we are able to study the growth of coverage in a random sequential adsorption of self-avoiding walk chains for up to \ensuremath{\sim}${10}^{12}$ time steps on a square lattice. For the first time, the true jamming coverage ${\ensuremath{\theta}}_{J}$ is found to decay with the chain length $N$ with a power law ${\ensuremath{\theta}}_{J}\ensuremath{\propto}{N}^{\ensuremath{-}0.1}$. The growth of the coverage to its jamming limit can be described by a power law $\ensuremath{\theta}(t)\ensuremath{\approx}{\ensuremath{\theta}}_{J}\ensuremath{-}\frac{c}{{t}^{y}}$ with an effective exponent $y$ which depends on the chain length, i.e., $y\ensuremath{\simeq}0.50$ for $N=4$ to $y\ensuremath{\simeq}0.07$ for $N=30$ with $y\ensuremath{\rightarrow}0$ in the asymptotic $\mathrm{limit} N\ensuremath{\rightarrow}\ensuremath{\infty}$.
Source: Physical Review Letters
Authors: Jian-Sheng Wang, Ras B. Pandey
Institution: National University of Singapore
Language: English
Subfield: Condensed Matter Physics
Field: Physics and Astronomy
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1968805786