Related papers: Efficient predecision scheme for Metropolis Monte …
We introduce a new algorithm for the simulation of Euclidean dynamical triangulations that mimics the Metropolis-Hastings algorithm, but where all proposed moves are accepted. This rejection-free algorithm allows for the factorization of…
We have developed an efficient Monte Carlo algorithm, which accelerates slow Monte Carlo dynamics in quasi-one-dimensional Ising spin systems. The loop algorithm of the quantum Monte Carlo method is applied to the classical spin models with…
Long ranged electrostatic interactions are time consuming to calculate in molecular dynamics and Monte-Carlo simulations. We introduce an algorithmic framework for simulating charged particles which modifies the dynamics so as to allow…
In the first part of the thesis we consider the constraints of causality and unitarity for particles interacting via strictly finite-range interactions. We generalize Wigner's causality bound to the case of non-vanishing partial-wave…
We introduce a Monte Carlo algorithm to efficiently compute transport properties of chaotic dynamical systems. Our method exploits the importance sampling technique that favors trajectories in the tail of the distribution of displacements,…
We propose and test an algorithm to simulate a lattice system of interacting fermions in two spatial dimensions. The approach is an extension of the entanglement renormalization technique [Phys. Rev. Lett. 99, 220405 (2007)] and the related…
On the base of a Feynman-Kac--type formula involving Poisson stochastic processes, recently a Monte Carlo algorithm has been introduced, which describes exactly the real- or imaginary-time evolution of many-body lattice quantum systems. We…
Starting from a Cluster Variational Method, and inspired by the correctness of the paramagnetic Ansatz (at high temperatures in general, and at any temperature in the 2D Edwards-Anderson model) we propose a novel message passing algorithm…
We present a universal quantum Monte Carlo algorithm for simulating arbitrary high-spin (spin greater than 1/2) Hamiltonians, based on the recently developed permutation matrix representation (PMR) framework. Our approach extends a…
We report a Monte Carlo simulation of the $2D$ Edwards-Anderson spin glass model within the recently introduced multicanonical ensemble. Replica on lattices of size $L^2$ up to $L=48$ are investigated. Once a true groundstate is found, we…
Monte Carlo simulation using a combination of Wang Landau (WL) and Transition Matrix (TM) Monte Carlo algorithms to simulate two lattice spin models with continuous energy is described. One of the models, the one dimensional Lebwohl-Lasher…
Markov chain Monte Carlo (MCMC) algorithms provide a very general recipe for estimating properties of complicated distributions. While their use has become commonplace and there is a large literature on MCMC theory and practice, MCMC users…
We point out that a newly introduced recursive algorithm for lattice polymers has a much wider range of applicability. In particular, we apply it to the simulation of off-lattice polymers with Lennard-Jones potentials between non-bonded…
Monte Carlo methods play an important role in scientific computation, especially when problems have a vast phase space. In this lecture an introduction to the Monte Carlo method is given. Concepts such as Markov chains, detailed balance,…
We propose a new sampling algorithm combining two quite powerful ideas in the Markov chain Monte Carlo literature -- adaptive Metropolis sampler and two-stage Metropolis-Hastings sampler. The proposed sampling method will be particularly…
Large-scale Monte Carlo simulations, together with scaling, are used to obtain the critical behavior of the Hastings long-range model and two corresponding models based on small-world networks. These models have combined short- and…
We propose a method for simulating the stochastic dynamics of classical spin systems with long-range interactions. The method incorporates the stochastic cutoff (SCO) method, which is originally specialized for simulating equilibrium state,…
We present an effcient Monte-Carlo method for lattice glass models which are characterized by hard constraint conditions. The basic idea of the method is similar to that of the $N$-fold way method. By using a list of sites into which we can…
We introduce a Markov Chain Monte Carlo (MCMC) algorithm to generate samples from probability distributions supported on a $d$-dimensional lattice $\Lambda = \mathbf{B}\mathbb{Z}^d$, where $\mathbf{B}$ is a full-rank matrix. Specifically,…
We show how a Monte Carlo method for generating self-avoiding walks on lattice geometries which employs a binary-tree data structure can be adapted for hard-sphere polymers with continuous degrees of freedom. Data suggests that the time per…