Related papers: Acceptance rate is a thermodynamic function in loc…
We study the interfacial adsorption phenomena of the three-state ferromagnetic Potts model on the simple cubic lattice by the Monte Carlo method. Finite-size scaling analyses of the net-adsorption yield the evidence of the phase transition…
We employ Monte Carlo techniques, utilizing the Metropolis and Wolff algorithms, to investigate phase behavior and phase transitions in anisotropic Ising models. Our study encompasses the thermodynamic properties, evaluating energy,…
We consider Metropolis Hastings MCMC in cases where the log of the ratio of target distributions is replaced by an estimator. The estimator is based on m samples from an independent online Monte Carlo simulation. Under some conditions on…
We propose an adaptive Metropolis-Hastings algorithm in which sampled data are used to update the proposal distribution. We use the samples found by the algorithm at a particular step to form the information-theoretically optimal mean-field…
The problem of optimally scaling the proposal distribution in a Markov chain Monte Carlo algorithm is critical to the quality of the generated samples. Much work has gone into obtaining such results for various Metropolis-Hastings (MH)…
Hybrid Monte Carlo (HMC) generates samples from a prescribed probability distribution in a configuration space by simulating Hamiltonian dynamics, followed by the Metropolis (-Hastings) acceptance/rejection step. Compressible HMC (CHMC)…
The Metropolis Hastings algorithm and its multi-proposal extensions are aimed at the computation of the expectation $<\pi,f>$ of a function $f$ under a probability measure $\pi$ difficult to simulate. They consist in constructing by an…
The effect of different move sets on the folding kinetics of the Monte Carlo simulations is analysed based on the conformation-network and the temperature-dependent folding kinetics. A new scheme of implementing Metropolis algorithm is…
Stochastic gradient Markov Chain Monte Carlo algorithms are popular samplers for approximate inference, but they are generally biased. We show that many recent versions of these methods (e.g. Chen et al. (2014)) cannot be corrected using…
Delayed-acceptance Markov chain Monte Carlo (DA-MCMC) samples from a probability distribution via a two-stages version of the Metropolis-Hastings algorithm, by combining the target distribution with a "surrogate" (i.e. an approximate and…
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 present a numerical Monte Carlo analysis of a continuos spin Ising chain that can describe the statistical proterties of folded proteins. We find that depending on the value of the Metropolis temperature, the model displays the three…
We investigate the spatial overlap of successive spin configurations in Markov chain Monte Carlo simulations using the local Metropolis algorithm and the Swendsen-Wang and Wolff cluster algorithms. We examine the dynamics of these…
Markov Chain Monte Carlo (MCMC) methods, such as the Metropolis-Hastings (MH) algorithm, are widely used for Bayesian inference. One of the most important issues for any MCMC method is the convergence of the Markov chain, which depends…
We construct a rejection-free Monte Carlo algorithm for a system with continuous degrees of freedom. We illustrate the algorithm by applying it to the classical three-dimensional Heisenberg model with canonical Metropolis dynamics. We…
Among random sampling methods, Markov Chain Monte Carlo algorithms are foremost. Using a combination of analytical and numerical approaches, we study their convergence properties towards the steady state, within a random walk Metropolis…
In this work, we introduce a simple modification of the Monte Carlo algorithm, which we call step Monte Carlo (sMC). The sMC approach allows to simulate processes far from equilibrium and obtain information about the dynamic properties of…
We show that for any multiple-try Metropolis algorithm, one can always accept the proposal and evaluate the importance weight that is needed to correct for the bias without extra computational cost. This results in a general, convenient,…
We study the Metropolis dynamics of the simplest mean-field spin glass model, the Random Energy Model. We show that this dynamics exhibits aging by showing that the properly rescaled time change process between the Metropolis dynamics and a…
The choice of transition kernel critically influences the performance of the Markov chain Monte Carlo method. Despite the importance of kernel choice, guiding principles for optimal kernels have not been established. Here, we propose a…