 
 
 
 
 
   
The parallel tempering (PT) algorithm solves this problem by supplementing local configurational Metropolis moves with global `swap' moves that update an entire set of configurations.  Several MC simulations (`replicas') are run in parallel at a series of different temperatures  , with inverse temperature denoted
, with inverse temperature denoted  =
= .  The simulations at higher temperatures will be able to explore configuration space more freely, crossing energy barriers at phase transitions and `hopping' among shallow energy minima.  The PT algorithm takes advantage of this by exchanging these higher-temperature configurations with configurations at the low temperature of interest, allowing the low-temperature simulation to sample configurations much more efficiently than with local Metropolis updates only.
.  The simulations at higher temperatures will be able to explore configuration space more freely, crossing energy barriers at phase transitions and `hopping' among shallow energy minima.  The PT algorithm takes advantage of this by exchanging these higher-temperature configurations with configurations at the low temperature of interest, allowing the low-temperature simulation to sample configurations much more efficiently than with local Metropolis updates only.
| ![\includegraphics[width = 1.0\textwidth]{data/images/pt_schematic.eps}](img7.png) | 
To understand the theory, consider a simulation with configuration  at inverse temperature
 at inverse temperature  and one with
 and one with  at
 at  .  After a series of local updates on each replica, we consider a swap move, wherein the replica at
.  After a series of local updates on each replica, we consider a swap move, wherein the replica at  assumes configuration
 assumes configuration  and the replica at
 and the replica at  has configuration
 has configuration  .  Given a hamiltonian
.  Given a hamiltonian  , a system with configuration
, a system with configuration  has energy
 has energy  . Then the proposed swap is accepted with probability
. Then the proposed swap is accepted with probability
![\begin{displaymath}p  = \min [1,e^{-\Delta S}] with \Delta S = (\beta_j - \beta_i)(H(C_i) - H(C_j)). \end{displaymath}](img13.png) 
Parallel tempering was developed in 1991 [5] and has since been used for a number of applications [6], including studying systems with large energy barriers, solving zeolite structure [4], and investigating water clusters [7,8].
 
 
 
 
