Random Sequential Covering
arXiv:2209.03992 · doi:10.1088/1742-5468/acbc20
Abstract
In random sequential covering, identical objects are deposited randomly, irreversibly, and sequentially; only attempts increasing the coverage are accepted. A finite system eventually gets congested, and we study the statistics of congested configurations. For the covering of an interval by dimers, we determine the average number of deposited dimers, compute all higher cumulants, and establish the probabilities of reaching minimally and maximally congested configurations. We also investigate random covering by segments with sites and sticks. Covering an infinite substrate continues indefinitely, and we analyze the dynamics of random sequential covering of and .
arXiv comment16 pages, 8 figures; v3: minor additions and corrections, added references
References in corpus (13)
- Jammed Hard-Particle Packings: From Kepler to Bernal and Beyond
- Glass and Jamming Transitions: From Exact Results to Finite-Dimensional Descriptions
- Solution of the dynamics of liquids in the large-dimensional limit
- A conceptual breakthrough in sphere packing
- Reformulation of the Covering and Quantizer Problems as Ground States of Interacting Particles
- Triangular Trimers on the Triangular Lattice: an Exact Solution
- Computational Approaches to Lattice Packing and Covering Problems
- Dynamical models for circle covering: Brownian motion and Poisson updating
- Large Deviations in One-Dimensional Random Sequential Adsorption
- Bethe Ansatz solution of triangular trimers on the triangular lattice
- Local Covering Optimality of Lattices: Leech Lattice versus Root Lattice E8
- A Breakthrough in Sphere Packing: The Search for Magic Functions
- Mean Number of Visible Confetti