Michel Mayer Krauth 2015
From Werner KRAUTH
(Difference between revisions)
| Revision as of 21:44, 23 September 2015 Werner (Talk | contribs) ← Previous diff |
Revision as of 21:45, 23 September 2015 Werner (Talk | contribs) Next diff → |
||
| Line 5: | Line 5: | ||
| '''Abstract''' | '''Abstract''' | ||
| - | We apply the event-chain Monte Carlo algorithm to classical continuum spin models on a lattice and clarify the condition for its validity. In the two-dimensional XY model, it outperforms the local Monte Carlo algorithm by two orders of magnitude, although it remains slower than the Wolff cluster algorithm. In the three-dimensional XY spin glass at low temperature, the event-chain algorithm is far superior to the other algorithms. | + | |
| + | We apply the event-chain Monte Carlo algorithm to classical continuum spin models on a lattice and clarify the condition for its validity. In the two-dimensional XY model, it outperforms the local Monte Carlo algorithm by two orders of magnitude, although it remains slower than the Wolff cluster algorithm. In the three-dimensional XY spin glass at low temperature, the event-chain algorithm is far superior to the other algorithms. | ||
| [http://arxiv.org/pdf/1508.06541 Electronic version (from arXiv, original version)] | [http://arxiv.org/pdf/1508.06541 Electronic version (from arXiv, original version)] | ||
| [[Category:Publication]] | [[Category:Publication]] | ||
Revision as of 21:45, 23 September 2015
M. Michel, J. Mayer, W. Krauth Event-chain Monte Carlo for classical continuous spin models arXiv 1508.06541
Paper
Abstract
We apply the event-chain Monte Carlo algorithm to classical continuum spin models on a lattice and clarify the condition for its validity. In the two-dimensional XY model, it outperforms the local Monte Carlo algorithm by two orders of magnitude, although it remains slower than the Wolff cluster algorithm. In the three-dimensional XY spin glass at low temperature, the event-chain algorithm is far superior to the other algorithms.
