Model of random packings of different size balls

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 review a recently proposed theory of random packings. We describe the volume fluctuations in jammed matter through a volume function, amenable to analytical and numerical calculations. We combine an extended statistical mechanics approach 'a la Edwards' (where the role traditionally played by the energy and temperature in thermal systems is substituted by the volume and compactivity) with a constraint on mechanical stability imposed by the isostatic condition. We show how ...

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...

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...

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...

By generalizing a geometric argument for frictionless spheres, a model is proposed for the jamming density $\phi_J$ of mechanically stable packings of bidisperse, frictional spheres. The monodisperse, $\mu_s$-dependent jamming density $\phi_J^{\mathrm{mono}}(\mu_s)$ is the only input required in the model, where $\mu_s$ is the coefficient of friction. The predictions of the model are validated by robust estimates of $\phi_J$ obtained from computer simulations of up to $10^7$ ...

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...

We investigate the distribution of the volume and coordination number associated to each particle in a jammed packing of monodisperse hard sphere using the mesoscopic ensemble developed in Nature 453, 606 (2008). Theory predicts an exponential distribution of the orientational volumes for random close packings and random loose packings. A comparison with computer generated packings reveals deviations from the theoretical prediction in the volume distribution, which can be bet...

Packings of identical objects have fascinated both scientists and laymen alike for centuries, in particular the sphere packings and the packings of identical regular tetrahedra. Mathematicians have tried for centuries to determine the densest packings; Crystallographers and chemists have been fascinated by the lattice packings for centuries as well. On the other hand, physicists, geologists, material scientists and engineers have been challenged by the mysterious random packi...

The notion of random close packings of a bulk static collection of ball bearings or sand grains was introduced in the 1960's by G.D. Scott and J.D. Bernal. There have been numerous attempts to understand the packings. We give a short argument, based on recent experiments and simulations, which explains the packings in purely geometric terms.