Work

Potential-Decomposition Strategy in Markov Chain Monte Carlo Sampling Algorithms

Year: 2010
Type: article
Abstract: We introduce the potential-decomposition strategy (PDS), which can he used in Markov chain Monte Carlo sampling algorithms. PDS can be designed to make particles move in a modified potential that favors diffusion in phase space, then, by rejecting some trial samples, the target distributions can be sampled in an unbiased manner. Furthermore, if the accepted trial samples are insufficient, they can be recycled as initial states to form more unbiased samples. This strategy can greatly improve efficiency when the original potential has multiple metastable states separated by large barriers. We apply PDS to the 2d Ising model and a double-well potential model with a large barrier, demonstrating in these two representative examples that convergence is accelerated by orders of magnitude.
Authors: Dan-Hua Shangguan, Jing-Dong Bao
Language: English
Open Access status: bronze
OpenAlex ID: W2215913519
FWCI:
Cites: 26
Cited by:
Related to: 10