Boosting search by rare events
Statistical Mechanics
2009-11-07 v2 Disordered Systems and Neural Networks
Computational Complexity
Abstract
Randomized search algorithms for hard combinatorial problems exhibit a large variability of performances. We study the different types of rare events which occur in such out-of-equilibrium stochastic processes and we show how they cooperate in determining the final distribution of running times. As a byproduct of our analysis we show how search algorithms are optimized by random restarts.
Cite
@article{arxiv.cond-mat/0112142,
title = {Boosting search by rare events},
author = {Andrea Montanari and Riccardo Zecchina},
journal= {arXiv preprint arXiv:cond-mat/0112142},
year = {2009}
}
Comments
4 pages, 3 eps figures. References updated