Random sequential adsorption

Random sequential adsorption (RSA) is a fundamental model used to describe processes where particles are introduced randomly into a system and irreversibly attach to a surface if they do not overlap with previously adsorbed particles. This process can be studied through computer simulations, mathematical analysis, or physical experiments. The core idea is that once a particle adsorbs, it remains fixed, and subsequent attempts to place particles that would intersect with existing ones are rejected.

This rejection mechanism leads to a characteristic filling behavior: rapid initial adsorption followed by a significant slowdown as the surface becomes crowded, eventually reaching a maximum surface coverage, often termed saturation coverage or jamming.

The study of RSA has a rich history, with early contributions dating back to the mid-20th century. Paul Flory investigated the attachment of pendant groups to polymer chains, a one-dimensional analogue of RSA. Concurrently, Alfréd Rényi explored the 'car-parking problem,' which models the random sequential parking of cars of a fixed length along a curb, another foundational one-dimensional RSA model.

Benjamin Widom also made early contributions. These initial theoretical explorations laid the groundwork for understanding the statistical mechanics of disordered systems and packing problems. The mathematical analysis of these one-dimensional cases provided crucial insights into the limiting behaviors observed in more complex, higher-dimensional systems.

A key outcome of RSA studies is the determination of the maximum surface coverage, or packing fraction, that can be achieved. This saturation coverage is a critical parameter in various scientific and engineering applications. For instance, in materials science, it dictates how densely active sites can be populated on a catalyst surface.

In nanotechnology, it influences the density of components on a surface for electronic devices. The value of saturation coverage is highly dependent on the geometry of the particles being adsorbed and the dimensionality of the system. Understanding these limits is vital for optimizing processes that rely on surface interactions and particle deposition.

The shape of the adsorbing particles profoundly impacts the achievable surface coverage. For instance, in two dimensions, the saturation coverage for randomly placed circular disks is approximately 0.547. However, introducing polydispersity, where particles come in various sizes, can significantly increase coverage because smaller particles can fill the interstitial voids left by larger ones.

Conversely, anisotropic shapes like rods can lead to much lower coverage. A few misaligned rods can block substantial areas, making it difficult for other particles to adsorb. This sensitivity to shape highlights the importance of geometric considerations in modeling and predicting surface phenomena.

The exploration of RSA has led to intriguing mathematical conjectures. Ilona Palásti proposed that the saturation coverage for d-dimensional aligned hypercubes in RSA is equal to the one-dimensional value, θ1d. While this conjecture provided a useful approximation and spurred considerable research, subsequent computer simulations in two and three dimensions have shown it to be a good estimate but not precisely accurate.

The exact saturation coverage for many shapes and dimensions remains an active area of research, often requiring sophisticated computational methods to approximate these complex packing behaviors and understand their deviations from simpler theoretical models.