Critical Slowing Down in Polynomial Time Algorithms
Open Access
- 17 December 2001
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 88 (1), 017202
- https://doi.org/10.1103/PhysRevLett.88.017202
Abstract
Combinatorial optimization algorithms that compute exact ground states for disordered magnets are seen to exhibit critical slowing down at zero temperature phase transitions. Using the physical features of the models, such as vanishing stiffness on one side of the transition and the ground state degeneracy, the number of operations needed in the push-relabel algorithm for the random field Ising model and in the algorithm for the 2D spin glass is estimated. These results strengthen the connections between algorithms and the physical picture and may be used to improve the speed of computations.Keywords
Other Versions
This publication has 16 references indexed in Scilit:
- Fast Monte Carlo algorithm for site or bond percolationPhysical Review E, 2001
- Determining computational complexity from characteristic ‘phase transitions’Nature, 1999
- Computing Minimum-Weight Perfect MatchingsINFORMS Journal on Computing, 1999
- Computational complexity of determining the barriers to interface motion in random systemsPhysical Review E, 1999
- Rigorous lower bound on the dynamic critical exponents of the Swendsen-Wang algorithmPhysical Review Letters, 1989
- Nonuniversal critical dynamics in Monte Carlo simulationsPhysical Review Letters, 1987
- Spin glasses: Experimental facts, theoretical concepts, and open questionsReviews of Modern Physics, 1986
- Integer Optimization and Zero-Temperature Fixed Point in Ising Random-Field SystemsPhysical Review Letters, 1986
- On the computational complexity of Ising spin glass modelsJournal of Physics A: General Physics, 1982
- On the random-cluster modelPhysica, 1972