Dynamic Space Packing
arXiv:2306.14358 · doi:10.1088/1742-5468/ad0223
Abstract
Dynamic space packing (DSP) is a random process with sequential addition and removal of identical objects into space. In the lattice version, objects are particles occupying single lattice sites, and adding a particle to a lattice site leads to the removal of particles on neighboring sites. We show that the model is solvable and determine the steady-state occupancy, correlation functions, desorption probabilities, and other statistical features for the DSP of hyper-cubic lattices. We also solve a continuous DSP of balls into .
24 pages, 8 figures; v3: small corrections, Appendix B and refs added
References in corpus (18)
- Point processes in arbitrary dimension from fermionic gases, random matrix theory, and number theory
- Glass transition of hard spheres in high dimensions
- Exactly Solvable Disordered Sphere-Packing Model in Arbitrary-Dimension Euclidean Spaces
- Improved sphere packing lower bounds from Hurwitz lattices
- Active hard-spheres in infinitely many dimensions
- Gaussian core model phase diagram and pair correlations in high Euclidean dimensions
- On the most compact regular lattice in large dimensions: A statistical mechanical approach
- Application of Edwards' statistical mechanics to high dimensional jammed sphere packings
- Counterintuitive ground states in soft-core models
- Large Deviations in One-Dimensional Random Sequential Adsorption
- The Statistics of the Number of Minima in a Random Energy Landscape
- Partition of Networks into Basins of Attraction
- Three simple scenarios for high-dimensional sphere packings
- Three-point bounds for sphere packing
- Random Sequential Covering
- Birds on a Wire
- Sphere packing bounds via rescaling
- How densely can spheres be packed with moderate effort in high dimensions?