Related papers: On the efficiency of exchange in parallel temperin…
We present an adaptive multi-GPU Exchange Monte Carlo method designed for the simulation of the 3D Random Field Model. The algorithm design is based on a two-level parallelization scheme that allows the method to scale its performance in…
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 discuss the advantages of parallelization by multithreading on graphics processing units (GPUs) for parallel tempering Monte Carlo computer simulations of an exemplified bead-spring model for homopolymers. Since the sampling of a large…
Parallel tempering, also known as replica exchange sampling, is an important method for simulating complex systems. In this algorithm simulations are conducted in parallel at a series of temperatures, and the key feature of the algorithm is…
A new algorithm for Monte Carlo calculation of the double exchange model is studied. The algorithm is commonly applicable to wide classes of strongly correlated electron systems which involve itinerant electrons coupled with…
Parallel tempering, also known as replica exchange Monte Carlo, is studied in the context of two simple free energy landscapes. The first is a double well potential defined by two macrostates separated by a barrier. The second is a `golf…
We study the dynamics of parallel tempering simulations, also known as the replica exchange technique, which has become the method of choice for simulation of proteins and other complex systems. Recent results for the optimal choice of the…
We present results from our study of the Parallel Tempering algorithm. We examine the swapping acceptance rate of a twin subensemble PT system. We use action matching technology in an attempt to maximise the swap acceptance rate. We model…
We show that the acceptance probability for swaps in the parallel tempering Monte Carlo method for classical canonical systems is given by a universal function that depends on the average statistical fluctuations of the potential and on the…
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 present a novel Exchange Monte Carlo (EMC) method designed for application in continuous-space Path Integral Monte Carlo (PIMC) simulations at finite temperature. Traditional PIMC methods for bosonic systems suffer from long…
A variant of the parallel tempering method is proposed in terms of a stochastic switching process for the coupled dynamics of replica configuration and temperature permutation. This formulation is shown to facilitate the analysis of 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…
Simulated and parallel tempering are families of Markov Chain Monte Carlo algorithms where a temperature parameter is varied during the simulation to overcome bottlenecks to convergence due to multimodality. In this work we introduce and…
Parallel tempering, or replica exchange, is a popular method for simulating complex systems. The idea is to run parallel simulations at different temperatures, and at a given swap rate exchange configurations between the parallel…
We discuss the possibility of implementing asynchronous replica-exchange (or parallel tempering) molecular dynamics. In our scheme, the exchange attempts are driven by asynchronous messages sent by one of the computing nodes, so that…
We review the history of the parallel tempering simulation method. From its origins in data analysis, the parallel tempering method has become a standard workhorse of physiochemical simulations. We discuss the theory behind the method and…
Parallel tempering simulates at many quark masses simultaneously, by changing the mass during the simulation while remaining in equilibrium. The algorithm is faster than pure HMC if more than one mass is needed, and works better the smaller…
We present a novel implementation of the parallel tempering Monte Carlo method in a multicanonical ensemble. Multicanonical weights are derived by a self-consistent iterative process using a Boltzmann inversion of global energy histograms.…
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…