Random particle packing with large particle size variations using reduced-dimension algorithms

We present a generalization of the granocentric model proposed in [Clusel et al., Nature, 2009, 460, 611615] that is capable of describing the local fluctuations inside not only polydisperse but also monodisperse packings of spheres. This minimal model does not take into account the relative particle positions, yet it captures positional disorder through local stochastic processes sampled by efficient Monte Carlo methods. The disorder is characterized by the distributions of ...

We present an efficient Monte Carlo method for the lattice sphere packing problem in d dimensions. We use this method to numerically discover de novo the densest lattice sphere packing in dimensions 9 through 20. Our method goes beyond previous methods not only in exploring higher dimensions but also in shedding light on the statistical mechanics underlying the problem in question. We observe evidence of a phase transition in the thermodynamic limit $d\to\infty$. In the dimen...

In the jamming transition of monodisperse packings, spatial heterogeneity is irrelevant as the transition is described by mean-field theories. Here, we show that this situation drastically changes if the particle-size dispersity is large enough. We use computer simulations to study the structural and vibrational properties of bidisperse sphere packings with a large size ratio. Near the critical point, the small particles tend to form clusters, leading to the emergence of larg...

We have examined extended structures, bridges and arches, in computer generated, non-sequentially stabilized, hard sphere deposits. The bridges and arches have well defined distributions of sizes and shapes. The distribution functions reflect the contraints associated with hard particle packing and the details of the restructuring process. A subpopulation of string-like bridges has been identified. Bridges are fundamental microstructural elements in real granular systems and ...

Disordered jammed packings under confinement have received considerably less attention than their \textit{bulk} counterparts and yet arise in a variety of practical situations. In this work, we study binary sphere packings that are confined between two parallel hard planes, and generalize the Torquato-Jiao (TJ) sequential linear programming algorithm [Phys. Rev. E {\bf 82}, 061302 (2010)] to obtain putative maximally random jammed (MRJ) packings that are exactly isostatic wit...

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 propose locally stable sparse hard-disk packings, as introduced by B\"or\"oczky, as a model for the analysis and benchmarking of Markov-chain Monte Carlo (MCMC) algorithms. We first generate such packings in a square box with periodic boundary conditions and analyze their properties. We then study how local MCMC algorithms, namely the Metropolis algorithm and several versions of event-chain Monte Carlo (ECMC), escape from configurations that are obtained by slightly reduci...

When are athermal soft sphere packings jammed ? Any experimentally relevant definition must at the very least require a jammed packing to resist shear. We demonstrate that widely used (numerical) protocols in which particles are compressed together, can and do produce packings which are unstable to shear - and that the probability of generating such packings reaches one near jamming. We introduce a new protocol that, by allowing the system to explore different box shapes as i...

The random packing fraction of binary particles in D-dimensional Euclidean space R^D is studied using a geometric approach. First, the binary packing fraction of assemblies with small size difference are studied, using the excluded volume model by Onsager for particles in three-dimensional space (D = 3). According to this model the packing increase by bidispersity is proportional to (1 - f)(u^D - 1)^2, with f as monosized packing fraction, u as size ratio and D as space dimen...

We consider the consequences of keeping the total surface fixed for a polydisperse system of $N$ hard spheres. In contrast with a similar model (J. Zhang {\it et al.}, J. Chem. Phys. {\bf 110}, 5318 (1999)), the Percus-Yevick and Mansoori equations of state work very well and do not show a breakdown. For high pressures Monte Carlo simulation we show three mechanically stable polydisperse crystals with either a unimodal or bimodal particle-size distributions.