Related papers: Cluster Hybrid Monte Carlo Simulation Algorithms
A spin-1/2 Ising model, defined in the body centered cubic lattice, is used to describe some of the thermodynamic properties of Fe$_p$-Al$_q$ alloys, with $p+q=1$. The model assumes, besides the nearest-neighbor exchange coupling, the…
We provide a deepened study of autocorrelations in Neural Markov Chain Monte Carlo (NMCMC) simulations, a version of the traditional Metropolis algorithm which employs neural networks to provide independent proposals. We illustrate our…
We introduce an algorithm to systematically improve 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…
We propose a new effective cluster algorithm of tuning the critical point automatically, which is an extended version of Swendsen-Wang algorithm. We change the probability of connecting spins of the same type, $p = 1 - e^{- J/ k_BT}$, in…
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,…
In recent years, a better understanding of the Monte Carlo method has provided us with many new techniques in different areas of statistical physics. Of particular interest are so called cluster methods, which exploit the considerable…
Global optimization is an active area of research in atomistic simulations, and many algorithms have been proposed to date. A prominent example is basin hopping Monte Carlo, which performs a modified Metropolis Monte Carlo search to explore…
The random field Ising model with Gaussian disorder is studied using a new Monte Carlo algorithm. The algorithm combines the advantanges of the replica exchange method and the two-replica cluster method and is much more efficient than the…
Since its first description fifty years ago, the Metropolis Monte Carlo method has been used in a variety of different ways for the simulation of continuum quantum many-body systems. This paper will consider some of the generalizations of…
In dynamic Monte Carlo simulations, using for example the Metropolis dynamic, it is often required to simulate for long times and to simulate large systems. We present an overview of advanced algorithms to simulate for larger times and to…
The probability distribution of the order parameter is exploited in order to obtain the criticality of magnetic systems. Monte Carlo simulations have been employed by using single spin flip Metropolis algorithm aided by finite-size scaling…
Equilibrium systems evolve according to Detailed Balance (DB). This principe guided development of the Monte-Carlo sampling techniques, of which Metropolis-Hastings (MH) algorithm is the famous representative. It is also known that DB is…
We apply extensive Monte Carlo simulations to study the probability distribution $P(m)$ of the order parameter $m$ for the simple cubic Ising model with periodic boundary condition at the transition point. Sampling is performed with the…
The Ising model S=1/2 and the S=1 model are studied by efficient Monte Carlo schemes on the (3,4,6,4) and the (3,3,3,3,6) Archimedean lattices. The algorithms used, a hybrid Metropolis-Wolff algorithm and a parallel tempering protocol, are…
We present an algorithm for cluster dynamics to efficiently simulate large systems on MIMD parallel computers with large numbers of processors. The method divides physical space into rectangular cells which are assigned to processors and…
Presented here is an algorithm for a type-II quantum computer which simulates the Ising model in one and two dimensions. It is equivalent to the Metropolis Monte-Carlo method and takes advantage of quantum superposition for random number…
We extend the Wolff algorithm to include correlated spin interactions in diluted magnetic systems. This algorithm is applied to study the site-bond-correlated Ising model on a two dimensional square lattice. We use a finite size scaling…
Monte Carlo methods play an important role in scientific computation, especially when problems have a vast phase space. In this lecture an introduction to the Monte Carlo method is given. Concepts such as Markov chains, detailed balance,…
Monte Carlo simulations are widely employed to measure the physical properties of glass-forming liquids in thermal equilibrium. Combined with local Monte Carlo moves, the Metropolis algorithm can also be used to simulate the relaxation…
We review the background of the cluster algorithms in Monte Carlo simulation of statistical physics problems. One of the first such successful algorithm was developed by Swendsen and Wang eight years ago. In contrast to the local…