Prefer a chat interface with context about you and your work?
Reducing autocorrelation time in determinant quantum Monte Carlo using the Wang-Landau algorithm: Application to the Holstein model
When performing a Monte Carlo calculation, the running time should, in principle, be much longer than the autocorrelation time in order to get reliable results. Among different lattice fermion models, the Holstein model is notorious for its particularly long autocorrelation time. In this paper, we employ the Wang-Landau algorithm in …