Related papers: A Noisy Monte Carlo Algorithm
In the present paper we examine the effects of noise on Monte Carlo algorithms, a problem raised previously by Kennedy and Kuti (Phys. Rev. Lett. {\bf 54}, 2473 (1985)). We show that the effects of introducing unbiased noise into the…
We develop an implementation for a recently proposed Noisy Monte Carlo approach to the simulation of lattice QCD with dynamical fermions by incorporating the full fermion determinant directly. Our algorithm uses a quenched gauge field…
We study the improvement of Kennedy-Kuti's linear accept/reject algorithm with different ordering criterion and modified Bhanot-Kennedy estimator of $e^{\Delta H}$ to reduce probability-bound violation. A new stochastic Monte Carlo…
We present an exact Monte Carlo algorithm designed to sample theories where the energy is a sum of many couplings of decreasing strength. The algorithm avoids the computation of almost all non-leading terms. Its use is illustrated by…
We analyze the kinematics of multigrid Monte Carlo algorithms by investigating acceptance rates for nonlocal Metropolis updates. With the help of a simple criterion we can decide whether or not a multigrid algorithm will have a chance to…
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 present an exact Monte Carlo algorithm designed to sample theories where the energy is a sum of many couplings of decreasing strength. Our algorithm, simplified from that of L. Lin et al. hep-lat/9905033, avoids the computation of almost…
Previous investigations have shown that the canonical approach to simulating QCD at finite density is promising. The algorithm we used in our earlier work employs an exact calculation of the fermionic determinant which limits the size of…
We present a new quantum Monte Carlo algorithm suitable for generically complex problems, such as systems coupled to external magnetic fields or anyons in two spatial dimensions. We find that the choice of gauge plays a nontrivial role, and…
We develop the no-propagate algorithm for sampling the linear response of random dynamical systems, which are non-uniform hyperbolic deterministic systems perturbed by noise with smooth density. We first derive a Monte-Carlo type formula…
An approximation formula is derived for acceptance rates of nonlocal Metropolis updates in simulations of lattice field theories. The predictions of the formula agree quite well with Monte Carlo simulations of 2-dimensional Sine Gordon, XY…
Conventional Monte Carlo simulations are stochastic in the sense that the acceptance of a trial move is decided by comparing a computed acceptance probability with a random number, uniformly distributed between 0 and 1. Here we consider the…
Hamiltonian Monte Carlo (HMC) sampling methods provide a mechanism for defining distant proposals with high acceptance probabilities in a Metropolis-Hastings framework, enabling more efficient exploration of the state space than standard…
Quantum Monte Carlo and quantum simulation are both important tools for understanding quantum many-body systems. As a classical algorithm, quantum Monte Carlo suffers from the sign problem, preventing its application to most fermion systems…
We examine the behaviour of the pseudo-marginal random walk Metropolis algorithm, where evaluations of the target density for the accept/reject probability are estimated rather than computed precisely. Under relatively general conditions on…
We propose an algorithm for optimizations in which the gradients contain stochastic noise. This arises, for example, in structural optimizations when computations of forces and stresses rely on methods involving Monte Carlo sampling, such…
We introduce a new algorithm which we call the {Rational Hybrid Monte Carlo} Algorithm (RHMC). This method uses a rational approximation to the fermionic kernel together with a noisy Kennedy-Kuti acceptance step to give an efficient…
We introduce a dynamical fermion algorithm which is based on the hybrid Monte Carlo (HMC) algorithm, but without pseudofermions. The molecular dynamics steps in HMC are retained except the derivatives with respect to the gauge fields are…
We consider a generalization of the standard Metropolis algorithm acceptance/rejection decision rule and numerically explore its properties using auxiliary field quantum Monte Carlo. The generalization involves a free parameter which, given…
We study the kinematics of multigrid Monte Carlo algorithms by means of acceptance rates for nonlocal Metropolis update proposals. An approximation formula for acceptance rates is derived. We present a comparison of different coarse-to-fine…