arXiv · cond-mat/9411081
Monte Carlo with Absorbing Markov Chains: Fast Local Algorithms for Slow Dynamics
Abstract
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
M. A. Novotny. 1995-06-29. Monte Carlo with Absorbing Markov Chains: Fast Local Algorithms for Slow Dynamics. https://doi.org/10.1103/physrevlett.74.1
Cite the original work for its findings. Save a collection to share your selection of sources.