Talk:Wang and Landau algorithm

The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

code

The presented code is not correct. It only considers the proposal functions such that

$g({\boldsymbol {r}}\rightarrow {\boldsymbol {r}}')=g({\boldsymbol {r}}\rightarrow {\boldsymbol {r}}')$

which is not necessarily true. I don't know D language so I will not change it, but someone should.Jorgecarleitao (talk) 08:17, 29 October 2012 (UTC)[reply]

it is stated that the code only is for your case.--129.69.120.39 (talk) 11:58, 2 April 2015 (UTC)[reply]

Done

Error in the presented Algorithm?

Hi the fraction ${\frac {g({\boldsymbol {r}}'\rightarrow {\boldsymbol {r}})}{g({\boldsymbol {r}}\rightarrow {\boldsymbol {r}}')}}$ in

A({\boldsymbol {r}}\rightarrow {\boldsymbol {r}}')=\min \left(1,e^{S-S'}{\frac {g({\boldsymbol {r}}'\rightarrow {\boldsymbol {r}})}{g({\boldsymbol {r}}\rightarrow {\boldsymbol {r}}')}}\right)

does not occur in the original Wang-Landau algorithm. Where does it come from, is it correct? --129.69.120.39 (talk) 11:56, 2 April 2015 (UTC)[reply]

the original algorithm assumed a symmetric proposal distribution. see e.g. Metropolis–Hastings_algorithm Biggerj1 (talk) 13:25, 11 January 2016 (UTC)

Biggerj1 (talk) 13:25, 11 January 2016 (UTC)[reply]