Parallel-tempering cluster algorithm for computer simulations of critical phenomena

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 adaptive routine to find the temperature window of interest, we introduce a flexible and powerful method for systematic investigations of critical phenomena. As a result, we gain one to two orders of magnitude in the performance for 2D and 3D Ising models in comparison with the recently proposed Wang-Landau recursion for cluster algorithms based on the multibondic algorithm, which is already a great improvement over the standard multicanonical variant.

💡 Research Summary

The paper introduces a highly efficient Monte‑Carlo framework for studying second‑order phase transitions, where a broad temperature window around the critical point is required for accurate finite‑size scaling (FSS) analyses. The authors combine parallel tempering (replica‑exchange) with the non‑local Swendsen‑Wang cluster update and embed an adaptive routine that automatically determines the optimal temperature interval for a given system size. The algorithm proceeds as follows: (i) an initial estimate of the temperature range and the number of replicas (N_rep) is made; (ii) replicas are placed at equally spaced inverse temperatures β, a short equilibration and measurement run is performed, and energy histograms are collected; (iii) histogram overlap between neighboring replicas is checked, and additional replicas are inserted until the overlap exceeds a 10 % threshold; (iv) multi‑histogram reweighting is applied to locate the peaks of key observables (specific heat C, susceptibility χ, structure factor S_k1, etc.) and to determine the β values where each observable reaches a chosen fraction r of its maximum; (v) the overall “desired” simulation window is defined as