Cluster Monte Carlo algorithms and their applications

1Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We introduce the Markov chain Monte Carlo method and review the background of the cluster algorithms in statistical physics. One of the first such successful algorithm was developed by Swendsen and Wang eight years ago. In contrast to the local algorithms, cluster algorithms update dynamical variables in a global fashion. Therefore, large changes are made in a single step. The method is very efficient, especially near the critical point of a second-order phase transition. Studies of various statistical mechanics models and some generalizations of the algorithm will be briefly reviewed. We mention applications in other fields, especially in imaging processing.

Cite

CITATION STYLE

APA

Wang, J. S. (1996). Cluster Monte Carlo algorithms and their applications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1035, pp. 307–315). Springer Verlag. https://doi.org/10.1007/3-540-60793-5_85

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free