A cluster algorithm for Monte Carlo simulations of spin ice

Abstract

We present an algorithm for Monte Carlo simulations of a nearest-neighbor spin ice model based on its cluster representation. To assess its performance, we estimate a relaxation time, and find that, in contrast to the Metropolis algorithm, our algorithm does not develop spin-freezing. Also, to demonstrate the efficiency, we calculate the spin and charge structure factors, and observe pinch points in a high-resolution color map. We then find that Debye screening works among defects and brings about short-range correlations, and that the deconfinement transition triggered by a fugacity of defects $z$ is dictated by a singular part of the free-energy density $f_{\mathrm{s}}\propto z$.

5 pages, 5 figures

References in corpus (3)

• A Three Dimensional Kasteleyn Transition: Spin Ice in a [100] Field
• Topological Sector Fluctuations and Curie Law Crossover in Spin Ice
• Loop algorithm for classical Heisenberg models with spin-ice type degeneracy