Enumeration of distinct mechanically stable disk packings in small systems

G. J. Gao, J. Blawzdziewicz, C. S. O'Hern

Research output: Contribution to journalArticle

6 Scopus citations

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 of obtaining an MS packing at packing fractionand find several notable results. Firstly, the probability is highly non-uniform. When averaged over narrow packing fraction intervals, the most probable MS packing occurs at the highestand 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.

Original languageEnglish
Pages (from-to)425-431
Number of pages7
JournalPhilosophical Magazine
Volume87
Issue number3-5
DOIs
StatePublished - Jan 2007

Fingerprint Dive into the research topics of 'Enumeration of distinct mechanically stable disk packings in small systems'. Together they form a unique fingerprint.

  • Cite this