Comparison of the clock, stochastic cutoff, and Tomita Monte Carlo methods in simulating the dipolar triangular lattice at criticality
arXiv:2502.01560 · doi:10.1103/PhysRevE.111.025308
Abstract
Magnetic nanostructures find application in diverse technological domains and their behavior is significantly influenced by long-range dipolar interactions. However, simulating these systems using the traditional Metropolis Monte Carlo method poses high computational demand. Several methods, including the clock, stochastic cutoff, and Tomita approaches, can reduce the computational burden of simulating 2D systems with dipolar interactions. Although these three methods rely on distinct theoretical concepts, they all achieve complexity reduction by a common strategy. Instead of calculating the energy difference between a spin and all its neighbors, they evaluate the energy difference with only a limited number of randomly chosen neighbors. This is achieved through methods like the dynamic thinning and Fukui-Todo techniques. In this article, we compared the performance of the clock, SCO, Tomita, and Metropolis methods near the critical point of the dipolar triangular lattice to identify the most suitable algorithm for this type of simulation. Our findings show that while these methods are less suitable for simulating this system in their untuned implementation, incorporating the boxing nearby neighbors method and overrelaxation moves makes them significantly more efficient and better suited than the Metropolis method with overrelaxation.
arXiv comment22 pages, 15 figures
References in corpus (30)
- Generalized Dynamic Scaling for Critical Magnetic Systems
- Event-chain Monte Carlo algorithms for hard-sphere systems
- Markov Chain Monte Carlo Method without Detailed Balance
- Generalized event-chain Monte Carlo: Constructing rejection-free global-balance algorithms from infinitesimal steps
- Irreversible Monte Carlo Algorithms for Efficient Sampling
- Order-N Cluster Monte Carlo Method for Spin Systems with Long-range Interactions
- Monte-Carlo study of the reorientation transition in Heisenberg models with dipole interactions
- Violation of detailed balance accelerates relaxation
- Dipolar ground state of planar spins on triangular lattices
- Event-chain Monte Carlo for classical continuous spin models
- Event-chain Monte Carlo algorithms for three- and many-particle interactions
- Event-chain algorithm for the Heisenberg model: Evidence for dynamic scaling
- Monte Carlo study of first-order transition in Heisenberg fcc antiferromagnet
- Large-scale Monte Carlo simulations of the three-dimensional XY spin glass
- Cell-veto Monte Carlo algorithm for long-range systems
- Phase transitions and ordering structures of a model of chiral helimagnet in three dimensions
- Stochastic Cutoff Method for Long-Range Interacting Systems
- Fast, hierarchical, and adaptive algorithm for Metropolis Monte Carlo simulations of long-range interacting systems
- Efficient Irreversible Monte Carlo samplers
- Optimized energy calculation in lattice systems with long-range interactions
- Clock Monte Carlo methods
- Efficient simulation of the random-cluster model
- JeLLyFysh-Version1.0 -- a Python application for all-atom event-chain Monte Carlo
- Kosterlitz-Thouless transition of magnetic dipoles on the two-dimensional plane
- Cluster Monte Carlo and dynamical scaling for long-range interactions
- The phase transition in the anisotropic Heisenberg model with long range dipolar interactions
- Hard-disk dipoles and non-reversible Markov chains
- Temperature-field phase diagram of the two-dimensional dipolar Ising ferromagnet
- Relaxational processes in the one-dimensional Ising model with long-range interactions
- Cluster Monte Carlo study of magnetic dipoles