Statistical approach of random packing of polydisperse similar hyperspheres: with application to binomial and lognormal size distributions

summary

The gist

Statistical approach of random packing of polydisperse similar hyperspheres: with application to binomial and lognormal size distributions is a study deriving a closed-form expression for the packing…

In short

The study developed a closed-form statistical model to calculate packing fractions for mixtures of polydisperse similar hyperspheres using volume contraction principles. This model is applied to binomial and lognormal size distributions, providing an explicit formula governed by the standard deviation, dimension, and monosized packing fraction. It successfully predicts empirical data across various conditions.

Key concepts

Volume Contraction
This statistical approach uses the concept of volume contraction to derive a closed-form expression for how particles pack together in space. It is based on analyzing the statistically probable combinations of particle pairs, which helps determine the excluded volume effect when mixing different sizes.
Lognormal Distribution
The paper transforms a binomial distribution of particle sizes into a continuous lognormal size distribution by taking the limit as the number of monosized particles increases. This transformation allows for an explicit analytical solution for calculating packing fractions in mixtures with this continuous size variation.
Packing Fraction ($oldsymbol{n_i}$)
The packing fraction ($n_i$) represents the proportion of space occupied by a specific size of particle within the mixture. The general closed-form equation derived allows researchers to calculate this for multicomponent mixes based on the standard deviation, dimension, and monosized packing fraction.
Euclidean Dimension ($oldsymbol{D}$)
The Euclidean dimension ($D$) refers to the number of spatial dimensions in which the particles are packed (e.g., 2 for a plane, 3 for typical space). The derived formula is generalized to be valid for arbitrary $D$, making it applicable beyond simple 2D or 3D sphere packing problems.

Terminology used across episodes

This episode discusses

The paper

Statistical approach of random packing of polydisperse hyperspheres: with application to binomial and lognormal size distributions · Read on arXiv

Eindhoven University of Technology

Transcript

Introduction to the show: ident: Condensed Matter. The day in condensed matter: materials, phases and the measurements under them.

Kai: I'm Kai.

Mira: And I'm Mira, here with Lev.

Kai: We're looking at the paper: "Statistical approach of random packing of polydisperse similar hyperspheres".

Mira: Here's the gist of the paper. Statistical approach of random packing of polydisperse similar hyperspheres: with application to binomial and lognormal size distributions is a study deriving a closed-form expression for the packing fraction of multi-sized particles using a statistical approach based on volume contraction, which is significant because it provides an explicit formula governed by the standard deviation, Euclidean dimension, and monosized packing fraction that matches empirical data across various conditions Derivation of the Closed-Form Expression The paper first derives a closed form expression for a mix consisting of multiple discrete particles in D-dimensional Euclidean space RD with small size differences A recently developed analytical model for binary packings with small size ratio u is used, which has its foundations in the excluded volume model by Onsager, here applying it to the statistically probable particle pairs in the multi-sized mix The new model is subsequently applied to discretely sized particles with a binomial number distribution and a constant size ratio u between each subsequent particle size By taking the limit of u → 1 and an infinite number of particles sizes, the binomial particle distribution is transformed into a continuous lognormal particle size distribution The resulting expression for the packing fraction can be solved in closed form, resulting in an original expression for the packing fraction of mixtures of hyperparticles with a lognormal distribution This explicit expression is governed by the standard deviation, the Euclidean dimension D, and the monosized packing fraction of the considered particle shape Modeling Binary Mixtures The model for binary particles with small size disparity is recapitulated in Section 2 The mean excluded volume of randomly mixing the small and large particles follows from the statistically probable combinations of these particle pairs Based on integral geometry it appeared that the excluded volume that underlies Eqs.

Kai: (10) holds for arbitrary binary similar convex particles, so not for and a (sphero)cylinders (D = 3) only The contraction function i j v D omega, (,) appears in Eq.

Mira: (10), defined as

30, 32, 33: Generalization to Multicomponent Mixes The binary mix model is extended to multicomponent mixes by considering the statistical frequencies of all particle pairs in the assembly The resulting polydisperse packing fraction n i in i = 1/n n i in i j jn ij i = 1 i = 1 j = i + 1 f X is given by Eq.

Kai: (25) This general closed-form equation provides the packing fraction as a function of standard deviation, the single-sized packing fraction of the particle shape considered, and the Euclidean dimension Application to Binomial and Lognormal Distributions The paper studies the binomial distribution of n particle sizes and probability p with a constant size ratio u between each subsequent size Adding more monosized particle sizes, all adjacent sizes having the same size ratio u, and letting u → 1, following the central limit theorem the binomial distribution turns into a continuous lognormal distribution The presented analytical model is valid for particles which size ratio is about 1/9 ≤ Ω ≤ 9 Comparison with Reported Data The model predictions are compared with a large collection of experimental data, simulations and theoretical approaches reported before For weak polydispersity, the scaled packing fractions as given by Eq.

Paper summary: Kai: To wrap up this paper, we're looking at "Statistical approach of random packing of polydisperse similar hyperspheres: with application to binomial and lognormal size distributions." The authors developed a closed-form expression for the packing fraction of multi-sized particles using a statistical approach based on volume contraction.

Mira: They successfully derived an analytical expression for binary packings with small size disparity, rooted in Onsager's excluded volume model. Then they used that to move to discrete binomial distributions and then took the limit to get the continuous lognormal distribution.

Lev: The main result is this final expression for the lognormal packing fraction, which matches their analytical model for small standard deviation but also has an asserted asymptote for large standard deviation, and they validated it specifically for Euclidean dimensions D equals two and three.

Kai: So what does this mean in simpler terms? It means they found a way to calculate how much space particles take up when you have many different sizes, using just the standard deviation, the dimension D, and the monosized packing fraction.

Mira: It’s about providing an explicit formula that is governed by those three parameters, which matches their empirical data across various conditions. This is significant because it replaces complex simulations with a direct calculation for packing fractions in these specific distributions.

Lev: For someone building real hardware, this means you have a predictable way to estimate the density of packed states based on the statistical properties of your particle sizes without needing massive computational overhead just to check every combination.

Kai: It’s a geometric approach that successfully links integral geometry to particle packing in dimensions two and three. That connection between the shape and the statistics is what makes this work useful.

Conclusion: Kai: So we've seen how they built this model for packing particles of different sizes using volume contraction statistics.

Mira: Yeah, looking at that title, "Statistical approach of random packing of polydisperse similar hyperspheres," it sounds really technical, but the core idea is just figuring out how much space things take up when they aren't all the same size.

Lev: The authors are applying this statistical approach specifically to particle size distributions that are binomial and lognormal. That's a specific area of physics they’re tackling.

Kai: What does that mean for us? It means we can get a direct calculation for packing fractions when we have mixtures of particles, whether the sizes follow a simple binomial pattern or something more complex like lognormal.

Mira: The implication is that instead of running huge simulations every time we want to know how dense a system is, we can use this closed-form expression. It's governed by the standard deviation, the dimension you're in, and that monosized packing fraction for a single size.

Lev: From an engineering standpoint, it’s about reducing the overhead of those simulations. If you can get a reliable number from these parameters, it makes designing systems with varying particle sizes much faster to iterate on.

Kai: And they validated this stuff in dimensions two and three. That’s where we actually have experimental data for packing things like spheres and cubes.

Mira: They show that this formula works well for small standard deviations, but the way it behaves changes when the standard deviation gets really large. It shifts from being governed by the standard deviation to being governed by something else entirely at high densities.

Lev: That shift is important because it tells you where your assumptions need to change when you push those systems toward their limits.

Kai: So, they've given us a mathematical tool that connects the shape of the particle, its statistical spread, and the space it occupies in a dimension. But what happens when we move beyond just spheres and cubes? We'll take a look at some of those comparisons next.

More episodes

← Home