Enumeration of distinct mechanically stable disk packings in small systems

Physics – Condensed Matter – Statistical Mechanics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

4 pages, 3 figures, Conference Proceedings for X International Workshop on Disordered Systems

Scientific paper

10.1080/14786430600851760

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 $\phi$ 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 $\phi$ and the probability decays exponentially with decreasing $\phi$. 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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Enumeration of distinct mechanically stable disk packings in small systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Enumeration of distinct mechanically stable disk packings in small systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enumeration of distinct mechanically stable disk packings in small systems will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-298882

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.