Potential-decomposition strategy in Markov chain Monte Carlo sampling algorithms

DOI10.1088/0253-6102/54/5/15MaRDI QIDQ3010236zbMATH OpenOpenAlexFDO

Authors DanHua ShangGuan, Jing-Dong Bao

Publication date 30 June 2011

Published in Communications in Theoretical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1088/0253-6102/54/5/15

zbMATH Keywords

convergenceIsing modelMarkov chain Monte Carlo sampling algorithmspotential-decomposition strategy

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Monte Carlo methods (65C05) Numerical analysis or methods applied to Markov chains (65C40) Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20)

Recommendations

• Improving the acceptance in Monte Carlo simulations: sampling through intermediate states
• Convergence and efficiency of adaptive importance sampling techniques with partial biasing
• Ensemble preconditioning for Markov chain Monte Carlo simulation
• Efficient strategy for the Markov chain Monte Carlo in high-dimension with heavy-tailed target probability distribution
• A new strategy for speeding Markov chain Monte Carlo algorithms

Cited in

(1)

• Hierarchical uncoupling-coupling of metastable conformations

This page was built for publication: Potential-decomposition strategy in Markov chain Monte Carlo sampling algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3010236)