Figure 4.

Dynamics of the Wang-Landau algorithm. Typical time evolution of the histogram of visited states when starting with different initial guesses. The model parameters are RQGS with LQ = LS = 348. The weights have been updated dynamically with modification factor ϕ = exp(0.1) ≈ 1.105. (a) w(s) = 1 for all s. The Markov chain converges relatively slowly. (b) w(s) ≈ 1/Prob(S = s|LQ = 348, LS = 200) has been used as an initial guess. The histogram becomes flatter within remarkable less computational effort. Inset: a detailed balance simulation (ϕ = 1 during the simulation of 1, 048, 576 steps) with initial weights that are close to the inverse target distribution. Though the histograms are not "flat", each score value on the interval [23, 500] has been visited. The estimate from this data can be used in a longer production run.

Wolfsheimer et al. BMC Bioinformatics 2011 12:47   doi:10.1186/1471-2105-12-47
Download authors' original image