Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/104910
DC Field | Value | |
---|---|---|
dc.title | Replica Monte Carlo simulation (revisited) | |
dc.contributor.author | Wang, J.-S. | |
dc.contributor.author | Swendsen, R.H. | |
dc.date.accessioned | 2014-10-28T03:13:23Z | |
dc.date.available | 2014-10-28T03:13:23Z | |
dc.date.issued | 2005 | |
dc.identifier.citation | Wang, J.-S.,Swendsen, R.H. (2005). Replica Monte Carlo simulation (revisited). Progress of Theoretical Physics Supplement 157 : 317-323. ScholarBank@NUS Repository. | |
dc.identifier.issn | 03759687 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/104910 | |
dc.description.abstract | In 1986, Swendsen and Wang proposed a replica Monte Carlo algorithm for Ising spin glasses [Phys. Rev. Lett. 57 (1986), 2607]. Two important ingredients are present, (1) the use of a collection of systems (replicas) at different temperatures, but with the same random couplings, (2) defining and flipping clusters. Exchange of information between the systems is facilitated by fixing the τ spin (τ = σ1σ2) and flipping the two neighboring systems simultaneously. In this talk, we discuss this algorithm and its relationship to replica exchange (also known as parallel tempering) and Houdayer's cluster algorithm for spin glasses. We review some of the early results obtained using this algorithm. We also present new results for the correlation times of replica Monte Carlo dynamics in two and three dimensions and compare them with replica exchange. | |
dc.source | Scopus | |
dc.type | Conference Paper | |
dc.contributor.department | COMPUTATIONAL SCIENCE | |
dc.description.sourcetitle | Progress of Theoretical Physics Supplement | |
dc.description.volume | 157 | |
dc.description.page | 317-323 | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.