Related papers: Parallel tempering Monte Carlo simulations of sphe…
Markov Chain Monte Carlo (MCMC) algorithms are essential tools in computational statistics for sampling from unnormalised probability distributions, but can be fragile when targeting high-dimensional, multimodal, or complex target…
Markov Chain Monte Carlo methods are algorithms used to sample probability distributions, commonly used to sample the Boltzmann distribution of physical/chemical models (e.g., protein folding, Ising model, etc.). This allows us to study…
In this paper we study from a numerical analysis perspective the Fractional Step Kinetic Monte Carlo (FS-KMC) algorithms proposed in [1] for the parallel simulation of spatially distributed particle systems on a lattice. FS-KMC are…
Using the Wang-Landau flat histogram Monte Carlo (FHMC) simulation technique, we were able to study two types of triangulated spherical surface models in which the two-dimensional extrinsic curvature energy is assumed in the Hamiltonian.…
Markov Chain Monte Carlo (MCMC) underlies both statistical physics and combinatorial optimization, but mixes slowly near critical points and in rough landscapes. Parallel Tempering (PT) improves mixing by swapping replicas across…
This paper describes a state-of-the-art parallel Lattice QCD Monte Carlo code for staggered fermions, purposely designed to be portable across different computer architectures, including GPUs and commodity CPUs. Portability is achieved…
Parallel tempering is a meta-algorithm for Markov Chain Monte Carlo that uses multiple chains to sample from tempered versions of the target distribution, enhancing mixing in multi-modal distributions that are challenging for traditional…
We study the applicability of the {\it parallel tempering method} (PT) in the investigation of first- order phase transitions. In this method, replicas of the same system are simulated simultaneously at different temperatures and the…
We present a highly scalable Monte Carlo (MC) three-dimensional photon transport simulation platform designed for heterogeneous computing systems. Through the development of a massively parallel MC algorithm using the Open Computing…
The tempered Lefschetz thimble method (TLTM) is a parallel-tempering algorithm towards solving the numerical sign problem, where the system is tempered by the antiholomorphic gradient flow to tame both the sign and ergodicity problems…
We study a model of phantom tethered membranes, embedded in three-dimensional space, by extensive Monte Carlo simulations. The membranes have hexagonal lattice structure where each monomer is interacting with six nearest-neighbors (NN).…
Nearest-neighbor Heisenberg antiferromagnet on a face-centered cubic lattice is studied by extensive Monte Carlo simulations in zero magnetic field. The parallel tempering algorithm is utilized, which allows to overcome a slow relaxation of…
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…
Parallel tempering (PT) methods are a popular class of Markov chain Monte Carlo schemes used to sample complex high-dimensional probability distributions. They rely on a collection of $N$ interacting auxiliary chains targeting tempered…
A tethered surface model is investigated by using the canonical Monte Carlo simulation technique on a torus with an intrinsic curvature. We find that the model undergoes a first-order phase transition between the smooth phase and the…
The Multilevel Monte Carlo (MLMC) method has proven to be an effective variance-reduction statistical method for Uncertainty Quantification (UQ) in Partial Differential Equation (PDE) models, combining model computations at different levels…
We present a mathematical framework for constructing and analyzing parallel algorithms for lattice Kinetic Monte Carlo (KMC) simulations. The resulting algorithms have the capacity to simulate a wide range of spatio-temporal scales in…
We have developed a technique to accelerate the acquisition of effectively uncorrelated configurations for off-lattice models of dense polymer melts which makes use of both parallel tempering and large scale Monte Carlo moves. The method is…
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…
QCD with infinite heavy quark masses exhibits a first-order thermal transition which is driven by the spontaneous breaking of the global $\mathcal{Z}_3$ center symmetry. We analyze the corresponding order parameter, namely the Polyakov loop…