Related papers: Computer simulation of two continuous spin models …
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…
We discuss a framework relying on both perturbative and non-perturbative lattice computations which will be able to reliably determine the parameters of the EW phase transition. A motivation for the use of 3d effective theory in the lattice…
We show that a histogram maintained throughout the Wang-Landau (WL) sampling for the energy entries visited during the simulation could be used to make the simulated density of states (DOS) converge. The method is easy to be implemented to…
We report on coding and performance of our polynomial hybrid Monte Carlo program on the Earth Simulator. At present the entire program achieves 25--40% efficiency. An analysis of overheads shows that a tuning of inter-node communications is…
In 1986, Swendsen and Wang proposed a replica Monte Carlo algorithm for spin glasses [Phys. Rev. Lett. 57 (1986) 2607]. Two important ingredients are present, (1) the use of a collection of systems (replicas) at different of temperatures,…
We modified the recently proposed multicanonical MC algorithm for the case of a magnetic field driven order--order phase transition. We test this {\it multimagnetic} Monte Carlo algorithm for the D=2 Ising model at $\beta=0.5$ and simulate…
As the size of engineered systems grows, problems in reliability theory can become computationally challenging, often due to the combinatorial growth in the cut sets. In this paper we demonstrate how Multilevel Monte Carlo (MLMC) - a…
Monte Carlo simulations of lattice quantum field theories on Lefschetz thimbles are non trivial. We discuss a new Monte Carlo algorithm based on the idea of computing contributions to the functional integral which come from complete flow…
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…
Monte-Carlo simulations and ground-state calculations have been used to map out the phase diagram of a system of classical spins, on a simple cubic lattice, where nearest-neighbor pairs of spins are coupled via competing antiferromagnetic…
Reverse Monte Carlo (RMC) is an algorithm that incorporates stochastic modification of the action as part of the process that updates the fields in a Monte Carlo simulation. Such update moves have the potential of lowering or eliminating…
We review a recent approach for the simulation of many-body interacting systems based on an efficient generalization of the Lanczos method for Quantum Monte Carlo simulations. This technique allows to perform systematic corrections to a…
Inspired by the latest developments in multilevel Monte Carlo (MLMC) methods and randomised sketching for linear algebra problems we propose a MLMC estimator for real-time processing of matrix structured random data. Our algorithm is…
We generalize the Hamiltonian Monte Carlo algorithm with a stack of neural network layers and evaluate its ability to sample from different topologies in a two dimensional lattice gauge theory. We demonstrate that our model is able to…
We study interacting Majorana fermions in two dimensions as a low-energy effective model of a vortex lattice in two-dimensional time-reversal-invariant topological superconductors. For that purpose, we implement ab-initio quantum Monte…
We present a novel and open-source implementation of the worm algorithm, which is an algorithm to simulate Bose-Hubbard and sign-positive spin models using a path integral representation of the partition function. The code can deal with…
We formulate and test a hybrid fluid-Monte Carlo scheme for the treatment of elastic collisions in gases and plasmas. While our primary focus and demonstrations of applicability are for moderately collisional plasmas, as described by the…
We present computer simulations of a dynamic Monte Carlo algorithm for polymer chains on the FCC lattice which takes explicitly into account the possibility to overcome topological constraints by controlling the rate at which nearby polymer…
Two cluster algorithms, based on constructing and flipping loops, are presented for worldline quantum Monte Carlo simulations of fermions and are tested on the one-dimensional repulsive Hubbard model. We call these algorithms the loop-flip…
Langevin Monte Carlo (LMC) algorithms are popular Markov Chain Monte Carlo (MCMC) methods to sample a target probability distribution, which arises in many applications in machine learning. Inspired by regime-switching stochastic…