Cluster Monte Carlo algorithms
| dc.creator | Krauth, Werner | |
| dc.date | 2003-11-27 | |
| dc.date.accessioned | 2026-07-07T02:54:59Z | |
| dc.date.available | 2026-07-07T02:54:59Z | |
| dc.description | In recent years, a better understanding of the Monte Carlo method has provided us with many new techniques in different areas of statistical physics. Of particular interest are so called cluster methods, which exploit the considerable algorithmic freedom given by the detailed balance condition. Cluster algorithms appear, among other systems, in classical spin models, such as the Ising model, in lattice quantum models (bosons, quantum spins and related systems) and in hard spheres and other `entropic' systems for which the configurational energy is either zero or infinite. In this chapter, we discuss the basic idea of cluster algorithms with special emphasis on the pivot cluster method for hard spheres and related systems, for which several recent applications are presented.We provide less technical detail but more context than in the original papers. | |
| dc.description | Chapter of `New Optimization Algorithms in Physics', edited by A. K. Hartmann and H. Rieger, (Wiley-VCh). ISBN: 3-527-40406-6, Estimated publishing date: June 2004, see: http://www.wiley-vch.de/publish/en/books/ | |
| dc.identifier | https://arxiv.org/abs/cond-mat/0311623 | |
| dc.identifier | http://arxiv.org/abs/cond-mat/0311623 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/22787 | |
| dc.subject | Statistical Mechanics | |
| dc.title | Cluster Monte Carlo algorithms | |
| dc.type | text |