Percolation of frozen order in glassy combinatorial problems

Physics – Condensed Matter – Disordered Systems and Neural Networks

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

This is a revised version of the manuscript which corrects a misconception in Section II of the earlier version of the paper.

Scientific paper

A local order parameter which is important in the analysis of phase transitions in frustrated combinatorial problems is the probability that a node is frozen in a particular state. There is a percolative transition when an infinite connected cluster of these frozen nodes emerges. In this contribution, we develop theories based on this percolation process and discuss its relation to conventional connectivity percolation and its generalisation to k-connectivity percolation. The emergence of frozen order may also be considered to be a form of constraint percolation (CP) which enables us to draw analogies with rigidity percolation and its associated matching problems. We show that very simple CP processes on Bethe lattices lead to the replica symmetric equations for KSAT, coloring and the Viana-Bray model.

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

Percolation of frozen order in glassy combinatorial problems 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 Percolation of frozen order in glassy combinatorial problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Percolation of frozen order in glassy combinatorial problems will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-694471

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