Irreversible Monte Carlo Algorithms for Efficient Sampling

Details Irreversible Monte Carlo Algorithms for Efficient Sampling Irreversible Monte Carlo Algorithms for Efficient Sampling

2008-09-04

arxiv.org/abs/0809.0916v2

Physics

Condensed Matter

Statistical Mechanics

4 pages, 2 figures

Scientific paper

Equilibrium systems evolve according to Detailed Balance (DB). This principe guided development of the Monte-Carlo sampling techniques, of which Metropolis-Hastings (MH) algorithm is the famous representative. It is also known that DB is sufficient but not necessary. We construct irreversible deformation of a given reversible algorithm capable of dramatic improvement of sampling from known distribution. Our transformation modifies transition rates keeping the structure of transitions intact. To illustrate the general scheme we design an Irreversible version of Metropolis-Hastings (IMH) and test it on example of a spin cluster. Standard MH for the model suffers from the critical slowdown, while IMH is free from critical slowdown.

Affiliated with

Also associated with

No associations

Rating

Irreversible Monte Carlo Algorithms for Efficient Sampling does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Irreversible Monte Carlo Algorithms for Efficient Sampling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Irreversible Monte Carlo Algorithms for Efficient Sampling will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-658454