no code implementations • 10 Feb 2021 • Fedor Šimkovic, Riccardo Rossi
We propose a minimal generalization of the celebrated Markov-Chain Monte Carlo algorithm which allows for an arbitrary number of configurations to be visited at every Monte Carlo step.
Computational Physics Disordered Systems and Neural Networks Statistical Mechanics Strongly Correlated Electrons
