A Cluster Algorithm for the $Z_2$ Kalb-Ramond Model
P.K. Coyle, I.G. Halliday

TL;DR
This paper introduces a cluster algorithm for the $Z_2$ Kalb-Ramond model in four dimensions that significantly improves simulation efficiency by reducing critical slowing down and accurately capturing the phase transition behavior.
Contribution
A novel cluster algorithm tailored for the $Z_2$ Kalb-Ramond model that reduces critical slowing down and effectively updates monopole configurations.
Findings
Critical exponent z reduced from >2 to 0.32±0.06
Algorithm dramatically decreases critical slowing down
Effectively updates monopole configurations responsible for phase transition
Abstract
A cluster algorithm is presented for the Kalb-Ramond plaquette model in four dimensions which dramatically reduces critical slowing. The critical exponent is reduced from (standard Metropolis algorithm) to . The Cluster algorithm updates the monopole configuration known to be responsible for the second order phase transition.
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.
