Random close packing is the idea that particles often pack densely in jumbled random arrangements. This can be gumballs, beans, or rice in containers; sand at a beach; marbles in a bag. If all the particles are the same size, sometimes they pack less randomly: some of the gumballs in the image above are nestled into hexagonal structures (image credit: Eric).
IntroductionAs the list of papers above suggests, we've been interested in the question of how particles pack randomly for several years. This has been a mixture of experimental and computational work. A computational image is shown at right. The basic question we ask about random close packed structures is how densely they are packed: what is the volume fraction (phi) of the particles? That is, what fraction of the volume is solid particles, with the remainder being empty space between the particles? This is called by the Greek letter phi. For mixtures of spheres that are all the same size, the answer for the volume fraction of random close packing is known to be about 0.63 - 0.64. That is, just under two thirds of the volume is solid spheres. The exact number depends on how you do the experiment or simulation. Of course, one can ask more questions beyond just the volume fraction. What does it mean to pack particles "randomly"? What happens if the particles are different shapes, or mixtures of different sizes? In the picture above with gumballs, the container walls may be changing the packing and causing the hexagonal patterns some of the particles are making; how does a particle pack "randomly" against a wall? These are some of the questions we've investigated. |
![]() A computer-generated random close packed configuration. The polydispersity (standard deviation of particle sizes divided by the mean size) is 0.4. |
Computer algorithmWe use a method adapted from Xu, Blawzdziewicz, and O'Hern, PRE 71, 061306 (2005). To computationally generate random close packing states, we start with tiny particles randomly scattered in the simulation box. If we want a mixture of sizes, we pick them appropriately. We then slowly grow all of the particles, keeping their ratios of sizes constant. (For example if we want a mixture of particles with a size ratio 1 : 1.4, at each step we might grow the particles by 0.1% each so that their size ratio stays constant. At each growth step, if the particles overlap, we treat them as soft particles that repel and move them apart. If the particles don't overlap, we let them move a small step randomly, which helps fill in the voids between particles. If at some point we can't move particles to prevent overlapping, then we shrink all of them a tiny bit to remove the overlap. Ultimately we find a close packed state where no particles are overlapping, but where we can't grow them any larger. As mentioned above, the final value of the volume fraction depends on the algorithm, so we don't claim our results are universal. For monodisperse spheres we find the random close packed volume fraction phi is 0.639. For a mixture of 2D circles with size ratio 1 : 1.4, we find phi = 0.841, which compares favorably with previously published results. Click here for Ken Desmond's 2025 N-dimensional RCP software (GitHub repository). Speaking of algorithm dependence, this software tends to pack about 0.01 higher in volume fraction in 3D as compared to our prior results. |
Click here for an animated GIF movie which shows our algorithm for making random close packing. The square box indicates the periodic boundary conditions: particles wrap around from one side of this box to the other. |
|
|
|
|
|
|
|
|
|
|
We also tried some 2D experiments for a while; one experimental image is below. We used laser-cut plastic rings of various sizes in a large one meter diameter 2D container. Photo from Isabela Galoustian and David Meer.