Influence of Particle Size Distribution on Random Close Packing

Unraveling the complexities of random packing in three dimensions has long puzzled physicists. While both experiments and simulations consistently show a maximum density of 64 percent for tightly packed random spheres, we still lack an unambiguous and universally accepted definition of random packing. This paper introduces an innovative standpoint, depicting random packing as spheres closest to a quenched Poisson field of random points. We furnish an efficacious algorithm to ...

We study jammed configurations of hard spheres as a function of compression speed using an event-driven molecular dynamics algorithm. We find that during the compression, the pressure follows closely the metastable liquid branch until the system gets arrested into a glass state as the relaxation time exceeds the compression speed. Further compression yields a jammed configuration that can be regarded as the infinite pressure configuration of that glass state. Consequently, we...

We introduce a model for particles that are extremely polydisperse in size compared to monodisperse and bidisperse systems. In two dimensions (2D), size polydispersity inhibits crystallization and increases packing fraction at jamming points. However, no packing pattern common to diverse polydisperse particles has been reported. We focused on polydisperse particles with a power size distribution $r^{-a}$ as a ubiquitous system that can be expected to be scale-invariant. We ex...

We present the first systematic algorithm to estimate the maximum packing density of spheres when the grain sizes are drawn from an arbitrary size distribution. With an Apollonian filling rule, we implement our technique for disks in 2d and spheres in 3d. As expected, the densest packing is achieved with power-law size distributions. We also test the method on homogeneous and on empirical real distributions, and we propose a scheme to obtain experimentally accessible distribu...

We present an analytical derivation of the volume fractions for random close packing (RCP) in both $d=3$ and $d=2$, based on the same methodology. Using suitably modified nearest neigbhour statistics for hard spheres, we obtain $\phi_{\mathrm{RCP}}=0.65896$ in $d=3$ and $\phi_{\mathrm{RCP}}=0.88648$ in $d=2$. These values are well within the interval of values reported in the literature using different methods (experiments and numerical simulations) and protocols. This order-...

Despite its long history, there are many fundamental issues concerning random packings of spheres that remain elusive, including a precise definition of random close packing (RCP). We argue that the current picture of RCP cannot be made mathematically precise and support this conclusion via a molecular dynamics study of hard spheres using the Lubachevsky-Stillinger compression algorithm. We suggest that this impasse can be broken by introducing the new concept of a maximally ...

In this paper, the binary random packing fraction of similar particles with size ratios ranging from unity to well over 2 is studied. The classic excluded volume model for spherocylinders and cylinders proposed by Onsager [1] is revisited to derive an asymptotically correct expression for these binary packings. the packing fraction increase by binary polydispersity equals 2f(1 - f)X1(1 - X1)(u - 1)^2 + O((u - 1)^3), where f is the monosized packing fraction, X1 is the number ...

Sphere packings are essential to the development of physical models for powders, composite materials, and the atomic structure of the liquid state. There is a strong scientific need to be able to assess the fit of packing models to data, but this is complicated by the lack of formal probabilistic models for packings. Without formal models, simulation algorithms and collections of physical objects must be used as models. Identification of common aspects of different realizatio...

We present a reduced-dimension, ballistic deposition, Monte Carlo particle packing algorithm and discuss its application to the analysis of the microstructure of hard-sphere systems with broad particle size distributions. We extend our earlier approach (the ``central string'' algorithm) to a reduced-dimension, quasi-3D approach. Our results for monomodal hard-sphere packs exhibit a calculated packing fraction that is slightly less than the generally accepted value for a maxim...

Understanding the way disordered particle packings transition between jammed (rigid) and unjammed (fluid) states is of both great practical importance and strong fundamental interest. The values of critical packing fraction (and other state variables) at the jamming transition are protocol dependent. Here, we demonstrate that this variability can be systematically traced to structural measures of packing, as well as to energy measures inside the jamming regime. A novel genera...