Related papers: Replica Monte Carlo Simulation (Revisited)
We propose an efficient Monte Carlo algorithm for simulating a ``hardly-relaxing" system, in which many replicas with different temperatures are simultaneously simulated and a virtual process exchanging configurations of these replica is…
A new Monte Carlo algorithm for 2-dimensional spin glasses is presented. The use of clusters makes possible global updates and leads to a gain in speed of several orders of magnitude. As an example, we study the 2-dimensional +/-J…
We report the results of Monte Carlo simulations on several spin glass models at low temperatures. By using the parallel tempering (Exchange Monte Carlo) technique we are able to equilibrate down to low temperatures, for moderate sizes, and…
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…
Recently a cluster Monte Carlo algorithm has been used very successfully in the two-dimensional Edwards-Anderson (EA) model. We show that this algorithm and a variant thereof can also be used successfully in models with a non-zero spin…
We present a study of the parallel tempering (replica exchange) Monte Carlo method, with special focus on the feedback-optimized parallel tempering algorithm, used for generating an optimal set of simulation temperatures. This method is…
We describe a number of recently developed cluster-flipping algorithms for the efficient simulation of classical spin models near their critical temperature. These include the algorithms of Wolff, Swendsen and Wang, and Niedermeyer, as well…
We propose and use a novel, hybrid Monte Carlo algorithm that combines configurational bias particle swaps with parallel tempering. We use this new method to simulate a standard model of a glass forming binary mixture above and below the…
We introduce a new update scheme to systematically improve the efficiency of parallel tempering simulations. We show that by adapting the number of sweeps between replica exchanges to the canonical autocorrelation time, the average…
In finite-size scaling analyses of Monte Carlo simulations of second-order phase transitions one often needs an extended temperature/energy range around the critical point. By combining the replica-exchange algorithm with cluster updates…
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…
In this paper I report results for simulations of the three-dimensional gauge glass and the four-dimensional XY spin glass using the parallel tempering Monte Carlo method at low temperatures for moderate sizes. The results are qualitatively…
Parallel tempering Monte Carlo has proven to be an efficient method in optimization and sampling applications. Having an optimized temperature set enhances the efficiency of the algorithm through more-frequent replica visits to the…
We report results for simulations of the four-dimensional XY spin glass using the parallel tempering Monte Carlo method at low temperatures for moderate sizes. Our results are qualitatively consistent with earlier work on the…
It is shown, by means of Monte Carlo simulation and Finite Size Scaling analysis, that the Heisenberg spin glass undergoes a finite-temperature phase transition in three dimensions. There is a single critical temperature, at which both a…
Monte Carlo simulations are methods for simulating statistical systems. The aim is to generate a representative ensemble of configurations to access thermodynamical quantities without the need to solve the system analytically or to perform…
Starting from a Cluster Variational Method, and inspired by the correctness of the paramagnetic Ansatz (at high temperatures in general, and at any temperature in the 2D Edwards-Anderson model) we propose a novel message passing algorithm…
The swap Monte Carlo algorithm combines the translational motion with the exchange of particle species, and is unprecedentedly efficient for some models of glass former. In order to clarify the physics underlying this acceleration, we study…
In this paper we present a dynamical Monte Carlo algorithm which is applicable to systems satisfying a clustering condition: during the dynamical evolution the system is mostly trapped in deep local minima (as happens in glasses, pinning…
In finite-size scaling analyses of Monte Carlo simulations of second-order phase transitions one often needs an extended temperature range around the critical point. By combining the parallel tempering algorithm with cluster updates and an…