A Multispin Algorithm for the Kob-Andersen Stochastic Dynamics on Regular Lattices
Roberto Boccagna

TL;DR
This paper introduces a multispin coding algorithm tailored for simulating Kob-Andersen glassy dynamics on regular lattices, enhancing computational efficiency and enabling exploration of phase transitions in complex spin systems.
Contribution
The paper develops a novel multispin coding algorithm for Kob-Andersen dynamics, extending it to random regular graphs and demonstrating its effectiveness through numerical simulations.
Findings
Algorithm significantly speeds up simulations.
Identifies transition points in the model.
Provides detailed numerical results.
Abstract
The aim of the paper is to propose an algorithm based on the Multispin Coding technique for the Kob-Andersen glassy dynamics. We first give motivations to speed up the numerical simulation in the context of spin glass models [M. Mezard, G. Parisi, M. Virasoro, Spin Glass Theory and Beyond (World Scientific, Singapore, 1987)], after defining the Markovian dynamics as in [W. Kob, H.C. Andersen, Phys. Rev. E 48, 4364 (1993)] as well as the related interesting observables, we extend it to the more general framework of random regular graphs, listing at the same time some known analytical results [C. Toninelli, G. Biroli, D.S. Fisher, J. Stat. Phys. 120, 167 (2005)]. The purpose of this work is a dual one, firstly, we describe how bitwise operators can be used to build up the algorithm by carefully exploiting the way data are stored on a computer. Since it was first introduced [M. Creutz, L.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
