Jacob, Pierre E.; Ryder, Robin - Université Paris-Dauphine (Paris IX) - 2014
variations of the algorithm, the Wang-Landau algorithm reaches the so-called Flat Histogram criterion in finite time, and that … this criterion can be never reached for other variations. The arguments are shown on an simple context -- compact spaces …