On the study of jamming percolation

Physics – Condensed Matter – Disordered Systems and Neural Networks

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

13 pages, 18 figures; Spiral model does satisfy property B

Scientific paper

10.1007/s10955-008-9514-2

We investigate kinetically constrained models of glassy transitions, and determine which model characteristics are crucial in allowing a rigorous proof that such models have discontinuous transitions with faster than power law diverging length and time scales. The models we investigate have constraints similar to that of the knights model, introduced by Toninelli, Biroli, and Fisher (TBF), but differing neighbor relations. We find that such knights-like models, otherwise known as models of jamming percolation, need a ``No Parallel Crossing'' rule for the TBF proof of a glassy transition to be valid. Furthermore, most knight-like models fail a ``No Perpendicular Crossing'' requirement, and thus need modification to be made rigorous. We also show how the ``No Parallel Crossing'' requirement can be used to evaluate the provable glassiness of other correlated percolation models, by looking at models with more stable directions than the knights model. Finally, we show that the TBF proof does not generalize in any straightforward fashion for three-dimensional versions of the knights-like models.

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

On the study of jamming percolation 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 On the study of jamming percolation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the study of jamming percolation will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-533704

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