Extremal optimization is a new general-purpose method for approximating
solutions to hard optimization problems. We study the method in detail by way
of the NP-hard graph partitioning problem. We discuss the scaling behavior of
extremal optimization, focusing on the convergence of the average run as a
function of runtime and system size. The method has a single free parameter,
which we determine numerically and justify using a simple argument. Our
numerical results demonstrate that on random graphs, extremal optimization
maintains consistent accuracy for increasing system sizes, with an
approximation error decreasing over runtime roughly as a power law t^(-0.4). On
geometrically structured graphs, the scaling of results from the average run
suggests that these are far from optimal, with large fluctuations between
individual trials. But when only the best runs are considered, results
consistent with theoretical arguments are recovered.Comment: 34 pages, RevTex4, 1 table and 20 ps-figures included, related papers
available at http://www.physics.emory.edu/faculty/boettcher