Large Deviations in One-Dimensional Random Sequential Adsorption

Abstract

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 state when no further additions are possible. We analyze a class of lattice RSA models in which landing on an empty site in a segment is allowed when at least $b$ neighboring sites on the left and the right are unoccupied. For the minimal model ($b=1$), we compute the full counting statistics of the occupation number. We reduce the determination of the full counting statistics to a Riccati equation that appears analytically solvable only when $b=1$. We develop a perturbation procedure which, in principle, allows one to determine cumulants consecutively, and we compute the variance of the occupation number for all $b$.

11 pages, 2 figures

References in corpus (4)

• Probing many-body dynamics on a 51-atom quantum simulator
• Entropic enhancement of spatial correlations in a laser-driven Rydberg gas
• Parking on a Random Tree
• Exact steady-state velocity of ratchets driven by random sequential adsorption

Cited by in corpus (8)

• Jamming and metastability in one dimension: from the kinetically constrained Ising chain to the Riviera model
• A renewal approach to configurational entropy in one dimension
• Random Sequential Covering
• Jamming and percolation in the random sequential adsorption of a binary mixture on the square lattice
• Birds on a Wire
• On the structure factor of jammed particle configurations on the one-dimensional lattice
• Dynamic Space Packing
• Random sequential covering of a one-dimensional lattice by $k$-mers