Monte Carlo with Absorbing Markov Chains: Fast Local Algorithms for Slow Dynamics

Details Monte Carlo with Absorbing Markov Chains: Fast Local Algorithms for Slow Dynamics Monte Carlo with Absorbing Markov Chains: Fast Local Algorithms for Slow Dynamics

1994-11-18

arxiv.org/abs/cond-mat/9411081v3

Physical Review Letters Vol.74, p.1 (1995) + erratum

Physics

Condensed Matter

ReVTeX, Request 3 figures from novotny@scri.fsu.edu

Scientific paper

10.1103/PhysRevLett.74.1

A class of Monte Carlo algorithms which incorporate absorbing Markov chains is presented. In a particular limit, the lowest-order of these algorithms reduces to the $n$-fold way algorithm. These algorithms are applied to study the escape from the metastable state in the two-dimensional square-lattice nearest-neighbor Ising ferromagnet in an unfavorable applied field, and the agreement with theoretical predictions is very good. It is demonstrated that the higher-order algorithms can be many orders of magnitude faster than either the traditional Monte Carlo or $n$-fold way algorithms.

Affiliated with

Also associated with

No associations

Rating

Monte Carlo with Absorbing Markov Chains: Fast Local Algorithms for Slow Dynamics 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 Monte Carlo with Absorbing Markov Chains: Fast Local Algorithms for Slow Dynamics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Monte Carlo with Absorbing Markov Chains: Fast Local Algorithms for Slow Dynamics will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-33494