Related papers: Optimal Monte Carlo Updating
We propose a new effective cluster algorithm of tuning the critical point automatically, which is an extended version of Swendsen-Wang algorithm. We change the probability of connecting spins of the same type, $p = 1 - e^{- J/ k_BT}$, in…
In nuclear fusion and fission, fluctuation and dissipation arise due to the coupling of collective degrees of freedom with internal excitations. Close to the barrier, both quantum, statistical and non-Markovian effects are expected to be…
The most efficient weights for Markov chain Monte Carlo calculations of physical observables are not necessarily those of the canonical ensemble. Generalized ensembles, which do not exist in nature but can be simulated on computers, lead…
We present an algorithm for the simulation of the exact real-time dynamics of classical many-body systems with discrete energy levels. In the same spirit of kinetic Monte Carlo methods, a stochastic solution of the master equation is found,…
Diagrammatic Monte Carlo -- the technique for numerically exact summation of all Feynman diagrams to high orders -- offers a unique unbiased probe of continuous phase transitions. Being formulated directly in the thermodynamic limit, the…
Metropolis Monte Carlo simulation is a powerful tool for studying the equilibrium properties of matter. In complex condensed-phase systems, however, it is difficult to design Monte Carlo moves with high acceptance probabilities that also…
We consider Monte Carlo approximations to the maximum likelihood estimator in models with intractable norming constants. This paper deals with adaptive Monte Carlo algorithms, which adjust control parameters in the course of simulation. We…
Markov chain Monte Carlo methods have become standard tools in statistics to sample from complex probability measures. Many available techniques rely on discrete-time reversible Markov chains whose transition kernels build up over the…
Algorithms to determine transition probabilities in Monte Carlo simulations are tested using a system of classical particles with effective interactions which reproduce Bose-Einstein statistics. The system is appropriate for testing…
In any valid Monte Carlo sampling that realizes microcanonical property we can collect statistics for a transition matrix in energy. This matrix is used to determine the density of states, from which most of the thermodynamical averages can…
We discuss the improvement in the accuracy of a Monte Carlo integration that can be obtained by optimization of the `a-priori weights' of the various channels. These channels may be either the strata in a stratified-sampling approach, or…
We present an exact quantum Monte Carlo method for spin systems coupled to dissipative bosonic baths which makes use of nonlocal wormhole updates to simulate the retarded spin-flip interactions originating from an off-diagonal spin-boson…
This review treats the mathematical and algorithmic foundations of non-reversible Markov chains in the context of event-chain Monte Carlo (ECMC), a continuous-time lifted Markov chain that employs the factorized Metropolis algorithm. It…
We derive exact, universal, closed-form quantum Monte Carlo estimators for finite-temperature energy susceptibility and fidelity susceptibility, applicable to essentially arbitrary Hamiltonians. Combined with recent advancements in Monte…
In this article, we present an event-driven algorithm that generalizes the recent hard-sphere event-chain Monte Carlo method without introducing discretizations in time or in space. A factorization of the Metropolis filter and the concept…
The Hybrid Monte Carlo algorithm is adapted to the simulation of a system of classical degrees of freedom coupled to non self-interacting lattices fermions. The diagonalization of the Hamiltonian matrix is avoided by introducing a…
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…
An improved real-time quantum Monte Carlo procedure is presented and applied to describe the electronic transfer dynamics along molecular chains. The model consists of discrete electronic sites coupled to a thermal environment which is…
The Metropolis algorithm is arguably the most fundamental Markov chain Monte Carlo (MCMC) method. But the algorithm is not guaranteed to converge to the desired distribution in the case of multivariate binary distributions (e.g., Ising…
An algorithm for Monte Carlo simulations is proposed in which the parameter controlling the strength of the transition becomes a dynamical variable and in which efficient transitions are achieved by cluster steps. It allows to avoid the…