Critical Nonequilibrium Cluster-flip Relaxations in Ising Models
arXiv:1808.07761 · doi:10.1103/PhysRevE.98.052110
Abstract
We investigate nonequilibrium relaxations of Ising models at the critical point by using a cluster update. While preceding studies imply that nonequilibrium cluster-flip dynamics at the critical point are universally described by the stretched-exponential function, we find that the dynamics changes from the stretched-exponential to the power function as the dimensionality is increased: The two-, three-, four-, and infinite-dimensional Ising models are numerically studied, and the four- and infinite-dimensional Ising models exhibit the power-law relaxation. We also show that the finite-size scaling analysis using the normalized correlation length is markedly effective for the analysis of relaxational processes rather than the direct use of the Monte Carlo step.
9 pages, 4 figures
References in corpus (9)
- Precision Islands in the Ising and Models
- Pushing the Limits of Monte Carlo Simulations for the 3d Ising Model
- Order-N Cluster Monte Carlo Method for Spin Systems with Long-range Interactions
- Critical behaviour of the Ising model on the 4-dimensional lattice
- Large-scale Monte Carlo simulation of two-dimensional classical XY model using multiple GPUs
- GPU-based Swendsen-Wang multi-cluster algorithm for the simulation of two-dimensional classical spin systems
- Dynamic critical behavior of the Chayes-Machta-Swendsen-Wang algorithm
- Dynamic scaling of topological ordering in classical systems
- New Nonequilibrium-to-Equilibrium Dynamical Scaling and Stretched-Exponential Critical Relaxation in Cluster Algorithms
Cited by in corpus (3)
- Effects of geometry, boundary condition and dynamical rules on the magnetic relaxation of Ising ferromagnet
- Nonequilibrium-relaxation approach to quantum phase transitions: Nontrivial critical relaxation in cluster-update quantum Monte Carlo
- Temperature scaling in nonequilibrium relaxation in three-dimensional Heisenberg model in the Swendsen-Wang and Metropolis algorithms