Eigenvalue analysis of an irreversible random walk with skew detailed balance conditions.
basic_science · Level V
Where this comes from
- Record sourced from PubMed, PMID 27176439.
- Also identified by DOI 10.1103/PhysRevE.93.043318.
- No licence information is recorded for this record.
- Because redistribution is not established, this page shows the abstract only. Follow the links below for the full text.
Abstract
An irreversible Markov-chain Monte Carlo (MCMC) algorithm with skew detailed balance conditions originally proposed by Turitsyn et al. is extended to general discrete systems on the basis of the Metropolis-Hastings scheme. To evaluate the efficiency of our proposed method, the relaxation dynamics of the slowest mode and the asymptotic variance are studied analytically in a random walk on one dimension. It is found that the performance in irreversible MCMC methods violating the detailed balance condition is improved by appropriately choosing parameters in the algorithm.