Estimating random close packing in polydisperse and bidisperse hard spheres via an equilibrium model of crowding
Carmine Anzivino, Mathias Casiulis, Tom Zhang, Amgad Salah Moussa,, Stefano Martiniani, and Alessio Zaccone

TL;DR
This paper develops an equilibrium model of crowding to estimate the random close packing density of polydisperse and bidisperse hard spheres, showing good agreement with simulations and experiments across various distributions and polydispersities.
Contribution
It introduces a novel analogy between fluid crowding and jammed states to predict RCP volume fractions for mixtures of hard spheres with different size distributions.
Findings
The model accurately predicts RCP density for binary and polydisperse systems.
RCP volume fraction increases with polydispersity and saturates below 1.
A closed-form expression captures the behavior for low polydispersity, with deviations explained by skewness growth.
Abstract
We show that an analogy between crowding in fluid and jammed phases of hard spheres captures the density dependence of the kissing number for a family of numerically generated jammed states. We extend this analogy to jams of mixtures of hard spheres in dimensions, and thus obtain an estimate of the random close packing (RCP) volume fraction, , as a function of size polydispersity. We first consider mixtures of particle sizes with discrete distributions. For binary systems, we show agreement between our predictions and simulations, using both our own and results reported in previous works, as well as agreement with recent experiments from the literature. We then apply our approach to systems with continuous polydispersity, using three different particle size distributions, namely the log-normal, Gamma, and truncated power-law distributions. In all cases, we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
