Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Nuclear Physics B - Proceedings Supplements

Monte Carlo simulation of critical dynamic spin systems

Lothar Schülke, Bo Zheng

Published Feb 1, 1997• 1 citation
Publisher
DOI
10.1016/s0920-5632(96)00762-1

Related papers

Monte Carlo-Molecular Dynamics Simulation in Two-Dimensional Spin Systems

Chikao Kawabata, M. Takeuchi, Takashi Nakanishi +1 more

Springer series in synergetics•Jan 1, 1989•0 citations

Monte Carlo Simulations of Spin Systems

Wolfhard Janke E

Springer eBooks•Jan 1, 1996•39 citations

Dynamical Scaling Analysis and Estimation of Critical Exponent z for Continuous Spin Systems Simulated Using Event-Chain Algorithm

Yuma Osada, Yukiyasu Ozeki

The event-chain Monte Carlo (ECMC) algorithm is rejection-free and irreversible for Markov chain Monte Carlo simulations. Previous studies have revealed that the ECMC dynamics reduces the dynamical exponent z. In this study, we performed dynamical scaling analysis on systems simulated by the ECMC algorithm and estimated the exponent z for several systems. We show three things as follows. 1. For each model, an appropriate dynamical order parameter is proposed given that it is rotation-invariant, and its applicability to the ECMC dynamics is verified for nonequilibrium relaxation analysis. 2. These values of z are smaller than those obtained using Metropolis dynamics, which confirms that the ECMC dynamics is faster. 3. Although z in the three-dimensional ferromagnetic Heisenberg model is much less than \(z \simeq 2\), it is higher than \(z \simeq 1\) reported in a previous work [Y. Nishikawa et al., Phys. Rev. E 92, 063306 (2015)].

Journal of the Physical Society of Japan•Jul 21, 2023•1 citation

Monte Carlo simulation of model spin systems

S. Ramasesha

Proceedings of the Indian Academy of Sciences Section C Engineering Sciences•Mar 1, 1979•1 citation

Dynamical Criticality of a Machine-learning-assisted Monte Carlo algorithm for a Mean-Field Spin Glass model

Seiya Miyamoto, Masayuki Ohzeki, Yoshihiko Nishikawa

We critically assess the performance of an autoregressive generative neural network model by applying it to an antiferromagnetic Ising model on a random regular graph. We train the network on equilibrium configurations in the low-temperature spin-glass phase of the model and perform Monte Carlo simulations using spin configurations generated by the network. The relaxation time of the Monte Carlo simulations drastically decreases with increasing the size of the training dataset and converges to an optimal value. The dynamical exponent characterizing the growth of the optimal relaxation time as a function of the system size is slightly reduced compared to the local Monte Carlo dynamics. However, we find that the size of the training dataset to achieve the optimal performance grows much faster with the system size than the relaxation time, implying that the total training cost eventually hinders a practical use of the method at large system sizes.

arXiv:2607.20243•Jul 22, 2026•0 citations

Monte Carlo studies of critical phenomena in spin lattice systems

Akai Kurbanovich Murtazaev

Uspekhi Fizicheskih Nauk•Jan 1, 2006•9 citations
The event-chain Monte Carlo (ECMC) algorithm is rejection-free and irreversible for Markov chain Monte Carlo simulations. Previous studies have revealed that the ECMC dynamics reduces the dynamical exponent z. In this study, we performed dynamical scaling analysis on systems simulated by the ECMC algorithm and estimated the exponent z for several systems. We show three things as follows. 1. For each model, an appropriate dynamical order parameter is proposed given that it is rotation-invariant, and its applicability to the ECMC dynamics is verified for nonequilibrium relaxation analysis. 2. These values of z are smaller than those obtained using Metropolis dynamics, which confirms that the ECMC dynamics is faster. 3. Although z in the three-dimensional ferromagnetic Heisenberg model is much less than z≃2z \simeq 2z≃2, it is higher than z≃1z \simeq 1z≃1 reported in a previous work [Y. Nishikawa et al., Phys. Rev. E 92, 063306 (2015)].
We critically assess the performance of an autoregressive generative neural network model by applying it to an antiferromagnetic Ising model on a random regular graph. We train the network on equilibrium configurations in the low-temperature spin-glass phase of the model and perform Monte Carlo simulations using spin configurations generated by the network. The relaxation time of the Monte Carlo simulations drastically decreases with increasing the size of the training dataset and converges to an optimal value. The dynamical exponent characterizing the growth of the optimal relaxation time as a function of the system size is slightly reduced compared to the local Monte Carlo dynamics. However, we find that the size of the training dataset to achieve the optimal performance grows much faster with the system size than the relaxation time, implying that the total training cost eventually hinders a practical use of the method at large system sizes.