Abstract
Strict detailed balance is essentially unnecessary for Markov chain Monte Carlo simulations to converge to the correct equilibrium distribution. Recently, we proposed a Monte Carlo algorithm based on sequential updating moves with partial randomness to guarantee correct sampling. The proposed algorithm only satisfies the weaker balance condition and converges faster than the Metropolis algorithm with strict detailed balance. In this work, we illustrate the efficiency of the algorithm for the two-dimensional lattice gas model in the grand canonical ensemble. Parallel implementation of the sequential algorithm on lattice systems indicates that parallel Monte Carlo simulations, if treated correctly, are not only as precise as serial implementation, but can also save significant computing time.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
