2 research outputs found
Extremal Optimization of Graph Partitioning at the Percolation Threshold
The benefits of a recently proposed method to approximate hard optimization
problems are demonstrated on the graph partitioning problem. The performance of
this new method, called Extremal Optimization, is compared to Simulated
Annealing in extensive numerical simulations. While generally a complex
(NP-hard) problem, the optimization of the graph partitions is particularly
difficult for sparse graphs with average connectivities near the percolation
threshold. At this threshold, the relative error of Simulated Annealing for
large graphs is found to diverge relative to Extremal Optimization at equalized
runtime. On the other hand, Extremal Optimization, based on the extremal
dynamics of self-organized critical systems, reproduces known results about
optimal partitions at this critical point quite well.Comment: 7 pages, RevTex, 9 ps-figures included, as to appear in Journal of
Physics
