March 19, 2013
The densest amorphous packing of rigid particles is known as random close packing. It has long been appreciated that higher densities are achieved by using collections of particles with a variety of sizes. The variety of sizes is often quantified by the polydispersity of the particle size distribution: the standard deviation of the radius divided by the mean radius. Several prior studies quantified the increase of the packing density as a function of polydispersity. Of course, a particle size distribution is also characterized by its skewness, kurtosis, and higher moments, but the influence of these parameters has not been carefully quantified before. In this work, we numerically generate many packings with different particle radii distributions, varying polydispersity and skewness independently of one another. We find two significant results. First, the skewness can have a significant effect on the packing density and in some cases can have a larger effect than polydispersity. Second, the packing fraction is relatively insensitive to the value of the kurtosis. We present a simple empirical formula for the value of the random close packing density as a function of polydispersity and skewness.
Similar papers 1
April 2, 2024
Circles of a single size can pack together densely in a hexagonal lattice, but adding in size variety disrupts the order of those packings. We conduct simulations which generate dense random packings of circles with specified size distributions, and measure the area fraction in each case. While the size distributions can be arbitrary, we find that for a wide range of size distributions the random close packing area fraction $\phi_{rcp}$ is determined to high accuracy by the p...
August 21, 2015
Obtaining general relations between macroscopic properties of random assemblies, such as density, and the microscopic properties of their constituent particles, such as shape, is a foundational challenge in the study of amorphous materials. By leveraging existing understanding of the random packing of spherical particles, we estimate the random packing density for all sufficiently spherical shapes. Our method uses the ensemble of random packing configurations of spheres as a ...
June 6, 2010
We develop a model to describe the properties of random assemblies of polydisperse hard spheres. We show that the key features to describe the system are (i) the dependence between the free volume of a sphere and the various coordination numbers between the species, and (ii) the dependence of the coordination numbers with the concentration of species; quantities that are calculated analytically. The model predicts the density of random close packing and random loose packing o...
December 3, 2016
In this paper, we perform molecular dynamics (MD) simulations to study the two-dimensional packing process of both monosized and random size particles with radii ranging from $1.0 \, \mu m$ to $7.0 \, \mu m$. The system was allowed to settle under gravity towards the bottom of a $300 \, \mu m \times 500 \, \mu m$ rectangular box. The initial positions as well as the radii of five thousand fine particles were defined along the box by using a random number generator. Both the t...
January 23, 2023
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 $d=3$ dimensions, and thus obtain an estimate of the random close packing (RCP) volume fraction, $\phi_{\textrm{RCP}}$, as a function of size polydispersity. We first consider mixtures of particle sizes with discrete distributi...
December 4, 2009
The most efficient way to pack equally sized spheres isotropically in 3D is known as the random close packed state, which provides a starting point for many approximations in physics and engineering. However, the particle size distribution of a real granular material is never monodisperse. Here we present a simple but accurate approximation for the random close packing density of hard spheres of any size distribution, based upon a mapping onto a one-dimensional problem. To te...
We apply a recent one-dimensional algorithm for predicting random close packing fractions of polydisperse hard spheres [Farr and Groot, J. Chem. Phys. 133, 244104 (2009)] to the case of lognormal distributions of sphere sizes and mixtures of such populations. We show that the results compare well to two much slower algorithms for directly simulating spheres in three dimensions, and show that the algorithm is fast enough to tackle inverse problems in particle packing: designin...
February 24, 2014
Random packings of objects of a particular shape are ubiquitous in science and engineering. However, such jammed matter states have eluded any systematic theoretical treatment due to the strong positional and orientational correlations involved. In recent years progress on a fundamental description of jammed matter could be made by starting from a constant volume ensemble in the spirit of conventional statistical mechanics. Recent work has shown that this approach, first intr...
July 26, 2013
Finding the optimal random packing of non-spherical particles is an open problem with great significance in a broad range of scientific and engineering fields. So far, this search has been performed only empirically on a case-by-case basis, in particular, for shapes like dimers, spherocylinders and ellipsoids of revolution. Here, we present a mean-field formalism to estimate the packing density of axisymmetric non-spherical particles. We derive an analytic continuation from t...
August 10, 2010
It is presented a numerical study on the unjamming packing fraction of bi- and polydisperse disk packings, which are generated through compression of a monodisperse crystal. In bidisperse systems, a fraction f_+ = 40% up to 80% of the total number of particles have their radii increased by \Delta R, while the rest has their radii decreased by the same amount. Polydisperse packings are prepared by changing all particle radii according to a uniform distribution in the range [-\...