Cluster Algorithm Renormalization Group Method

Abstract

We present a self consistent method based on cluster algorithms and Renormalization Group on the lattice to study critical systems numerically. We illustrate it by means of the 2D Ising model. We compute the critical exponents and η and the renormalization group flow of the probability density function of the magnetization. The results, compared to the standard Monte Carlo Renormalization Group proposed by Swendsen [1], are very accurate and the method works faster by a factor which grows monotonically with the lattice size. This allows to simulate larger lattices in reachable computational times.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…