Generalized Monte Carlo loop algorithm for two-dimensional frustrated Ising models.
نویسندگان
چکیده
We introduce a generalized loop move (GLM) update for Monte Carlo simulations of frustrated Ising models on two-dimensional lattices with bond-sharing plaquettes. The GLM updates are designed to enhance Monte Carlo sampling efficiency when the system's low-energy states consist of an extensive number of degenerate or near-degenerate spin configurations, separated by large energy barriers to single spin flips. Through implementation on several frustrated Ising models, we demonstrate the effectiveness of the GLM updates in cases where both degenerate and near-degenerate sets of configurations are favored at low temperatures. The GLM update's potential to be straightforwardly extended to different lattices and spin interactions allows it to be readily adopted on many other frustrated Ising models of physical relevance.
منابع مشابه
Generalized cluster algorithms for frustrated spin models.
Standard Monte Carlo cluster algorithms have proven to be very effective for many different spin models, however they fail for frustrated spin systems. Recently a generalized cluster algorithm was introduced that works extremely well for the fully frustrated Ising model on a square lattice, by placing bonds between sites based on information from plaquettes rather than links of the lattice. Her...
متن کاملFeedback-optimized parallel tempering Monte Carlo
We introduce an algorithm for systematically improving the efficiency of parallel tempering Monte Carlo simulations by optimizing the simulated temperature set. Our approach is closely related to a recently introduced adaptive algorithm that optimizes the simulated statistical ensemble in generalized broad-histogram Monte Carlo simulations. Conventionally, a temperature set is chosen in such a ...
متن کامل2 8 M ay 2 00 8 Logarithmic corrections in the aging of the fully - frustrated Ising model
We study the dynamics of the critical two-dimensional fully-frustrated Ising model by means of Monte Carlo simulations. The dynamical exponent is estimated at equilibrium and is shown to be compatible with the value zc = 2. In a second step, the system is prepared in the paramagnetic phase and then quenched at its critical temperature Tc = 0. Numerical evidences for the existence of logarithmic...
متن کاملA worm algorithm for the fully-packed loop model
We present a Markov-chain Monte Carlo algorithm of worm type that correctly simulates the fully-packed loop model on the honeycomb lattice, and we prove that it is ergodic and has uniform stationary distribution. The fully-packed loop model on the honeycomb lattice is equivalent to the zero-temperature triangular-lattice antiferromagnetic Ising model, which is fully frustrated and notoriously d...
متن کاملNovel Monte Carlo algorithms and their applications
We describe a generalized scheme for the probability-changing cluster (PCC) algorithm, based on the study of the finite-size scaling property of the correlation ratio, the ratio of the correlation functions with different distances. We apply this generalized PCC algorithm to the two-dimensional 6-state clock model. We also discuss the combination of the cluster algorithm and the extended ensemb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Physical review. E, Statistical, nonlinear, and soft matter physics
دوره 85 3 Pt 2 شماره
صفحات -
تاریخ انتشار 2012