January 16, 2022
Similar papers 2
March 25, 2000
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 ...
March 11, 2006
We introduce a generalization of the well-known random sequential addition (RSA) process for hard spheres in $d$-dimensional Euclidean space $\mathbb{R}^d$. We show that all of the $n$-particle correlation functions of this nonequilibrium model, in a certain limit called the "ghost" RSA packing, can be obtained analytically for all allowable densities and in any dimension. This represents the first exactly solvable disordered sphere-packing model in arbitrary dimension. The f...
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...
September 20, 2022
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 ...
January 29, 2010
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 ...
November 14, 2022
We revisit the scaling properties of growing spheres randomly seeded in d=2,3 and 4 dimensions using a mean-field approach. We model the insertion probability without assuming a priori a functional form for the radius distribution. The functional form of the insertion probability shows an unprecedented agreement with numerical simulations in d=2, 3 and 4 dimensions. We infer from the insertion probability the scaling behavior of the Random Apollonian Packing and its fractal d...
October 12, 2007
We propose an interpretation of the random close packing of granular materials as a phase transition, and discuss the possibility of experimental verification.
May 16, 2023
In this paper the random packing fraction of hard disks in a plane is analyzed, following a geometric probabilistic approach. First, the random close packing (RCP) of equally sized disks is modelled. Subsequently, following the same methodology, a simple, statistical geometric model is proposed for the random loose packing (RLP) of monodisperse disks. This very basic derivation of RLP leads to a packing value (~ 0.66) that is in very good agreement with values that have been ...
March 20, 2005
We create collectively jammed (CJ) packings of 50-50 bidisperse mixtures of smooth disks in 2d using an algorithm in which we successively compress or expand soft particles and minimize the total energy at each step until the particles are just at contact. We focus on small systems in 2d and thus are able to find nearly all of the collectively jammed states at each system size. We decompose the probability $P(\phi)$ for obtaining a collectively jammed state at a particular pa...
November 23, 2000
We review results about the density of typical lattices in $R^n.$ They state that such density is of the order of $2^{-n}.$ We then obtain similar results for random packings in $R^n$: after taking suitably a fraction $\nu$ of a typical random packing $\sigma$, the resulting packing $\tau$ has density $C(\nu) 2^{-n},$ with a reasonable $C(\nu).$ We obtain estimates on $C(\nu).$