๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A new strategy for speeding Markov chain Monte Carlo algorithms

โœ Scribed by Antonietta Mira; Daniel J. Sargent

Book ID
110544366
Publisher
Springer
Year
2003
Tongue
English
Weight
689 KB
Volume
12
Category
Article
ISSN
1613-981X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

General over-relaxation Markov chain Mon
General over-relaxation Markov chain Monte Carlo algorithms for Gaussian densities
โœ Piero Barone; Giovanni Sebastiani; Julian Stander ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 128 KB

We study general over-relaxation Markov chain Monte Carlo samplers for multivariate Gaussian densities. We provide conditions for convergence based on the spectral radius of the transition matrix and on detailed balance. We illustrate these algorithms using an image analysis example.

Cool walking: A new Markov chain Monte C
Cool walking: A new Markov chain Monte Carlo sampling method
โœ Scott Brown; Teresa Head-Gordon ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 188 KB ๐Ÿ‘ 1 views

## Abstract Effective relaxation processes for difficult systems like proteins or spin glasses require special simulation techniques that permit barrier crossing to ensure ergodic sampling. Numerous adaptations of the venerable Metropolis Monte Carlo (MMC) algorithm have been proposed to improve it