Enumeration of distinct mechanically stable disk packings in small systems
arXiv:cond-mat/0605009 · doi:10.1080/14786430600851760
Abstract
We create mechanically stable (MS) packings of bidisperse disks using an algorithm in which we successively grow or shrink soft repulsive disks followed by energy minimization until the overlaps are vanishingly small. We focus on small systems because this enables us to enumerate nearly all distinct MS packings. We measure the probability to obtain a MS packing at packing fraction and find several notable results. First, the probability is highly nonuniform. When averaged over narrow packing fraction intervals, the most probable MS packing occurs at the highest and the probability decays exponentially with decreasing . Even more striking, within each packing-fraction interval, the probability can vary by many orders of magnitude. By using two different packing-generation protocols, we show that these results are robust and the packing frequencies do not change qualitatively with different protocols.
4 pages, 3 figures, Conference Proceedings for X International Workshop on Disordered Systems
References in corpus (9)
- Jamming at Zero Temperature and Zero Applied Stress: the Epitome of Disorder
- Is Random Close Packing of Spheres Well Defined?
- Random Packings of Frictionless Particles
- Packing of Compressible Granular Materials
- Jamming transition in emulsions and granular materials
- Continuum limit of amorphous elastic bodies: A finite-size study of low frequency harmonic vibrations
- Random close packing revisited: How many ways can we pack frictionless disks?
- Potential Energy Landscape Equation of State
- Landscapes, dynamic heterogeneity and kinetic facilitation in a simple off-lattice model