Optimizing at the Ergodic Edge
arXiv:physics/0509001 · doi:10.1016/j.physa.2005.10.034
Abstract
Using a simple, annealed model, some of the key features of the recently introduced extremal optimization heuristic are demonstrated. In particular, it is shown that the dynamics of local search possesses a generic critical point under the variation of its sole parameter, separating phases of too greedy (non-ergodic, jammed) and too random (ergodic) exploration. Comparison of various local search methods within this model suggests that the existence of the critical point is essential for the optimal performance of the heuristic.
RevTex4, 17 pages, 3 ps-figures incl., for related information, see http://www.physics.emory.edu/faculty/boettcher/publications.html
References in corpus (7)
- Comparing community structure identification
- Community detection in complex networks using Extremal Optimization
- Basin Hopping with Occasional Jumping
- Continuous extremal optimization for Lennard-Jones Clusters
- Improved extremal optimization for the Ising spin glass
- Comparing extremal and thermal Explorations of Energy Landscapes
- Extremal optimization for sensor report pre-processing