Critical slowing down in polynomial time algorithms

Details Critical slowing down in polynomial time algorithms Critical slowing down in polynomial time algorithms

2001-04-10

arxiv.org/abs/cond-mat/0104185v2

Physical Review Letters 88, 017202 (2002)

Physics

Condensed Matter

Disordered Systems and Neural Networks

4 pp., 3 figs

Scientific paper

10.1103/PhysRevLett.88.017202

Combinatorial optimization algorithms which compute exact ground state configurations in disordered magnets are seen to exhibit critical slowing down at zero temperature phase transitions. Using arguments based on the physical picture of the model, including vanishing stiffness on scales beyond the correlation length and the ground state degeneracy, the number of operations carried out by one such algorithm, the push-relabel algorithm for the random field Ising model, can be estimated. Some scaling can also be predicted for the 2D spin glass.

Affiliated with

Also associated with

No associations

Rating

Critical slowing down in polynomial time algorithms 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 Critical slowing down in polynomial time algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Critical slowing down in polynomial time algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-534456