Logarithmic Convergence of Random Heuristic Search

@article{Vose1996LogarithmicCO,
  title={Logarithmic Convergence of Random Heuristic Search},
  author={Michael D. Vose},
  journal={Evolutionary Computation},
  year={1996},
  volume={4},
  pages={395-404}
}
This paper speaks to the inherent emergent behavior of genetic search. For completeness and generality, a class of stochastic search algorithms, random heuristic search, is reviewed. A general convergence theorem for this class is then proved. Since the simple genetic algorithm (GA) is an instance of random heuristic search, a corollary is a result concerning GAs and time to convergence.