AbstractIn this paper we study the relationships between two Markov Chain Monte Carlo algorithms—the Swapping Algorithm (also known as the Metropolis-coupled algorithm) and the simulated tempering algorithm. We give a proof that the spectral gap of the simulated tempering chain is bounded below by a multiple of that of the swapping chain
We derive new results comparing the asymptotic variance of diffusions by writing them as appropriate...
Parallel tempering (PT) methods are a popular class of Markov chain Monte Carlo schemes used to samp...
The so-called swapping algorithm was designed to simulate from spin glass distributions, among other...
In this paper we study the relationships between two Markov Chain Monte Carlo algorithms--the Swappi...
In the current work we present two generalizations of the Parallel Tempering algorithm, inspired by ...
We consider optimal temperature spacings for Metropolis-coupled Markov chain Monte Carlo (MCMCMC) an...
In this paper various extensions of the parallel-tempering algorithm are developed and their propert...
We obtain upper bounds on the spectral gap of Markov chains constructed by parallel and simulated te...
Funder: Alexander von Humboldt-Stiftung; doi: http://dx.doi.org/10.13039/100005156Abstract: In the c...
Abstract. Sampling from complex distributions is an important but challenging topic in scientific an...
Parallel tempering, also known as replica exchange sampling, is an important method for simulating c...
Parallel tempering is a generic Markov chainMonteCarlo samplingmethod which allows good mixing with ...
<div><p>Sampling from complex distributions is an important but challenging topic in scientific and ...
Abstract. Multimodal structures in the sampling density (e.g. two competing phases) can be a serious...
We present here two novel algorithms for simulated tempering simulations, which break the detailed b...
We derive new results comparing the asymptotic variance of diffusions by writing them as appropriate...
Parallel tempering (PT) methods are a popular class of Markov chain Monte Carlo schemes used to samp...
The so-called swapping algorithm was designed to simulate from spin glass distributions, among other...
In this paper we study the relationships between two Markov Chain Monte Carlo algorithms--the Swappi...
In the current work we present two generalizations of the Parallel Tempering algorithm, inspired by ...
We consider optimal temperature spacings for Metropolis-coupled Markov chain Monte Carlo (MCMCMC) an...
In this paper various extensions of the parallel-tempering algorithm are developed and their propert...
We obtain upper bounds on the spectral gap of Markov chains constructed by parallel and simulated te...
Funder: Alexander von Humboldt-Stiftung; doi: http://dx.doi.org/10.13039/100005156Abstract: In the c...
Abstract. Sampling from complex distributions is an important but challenging topic in scientific an...
Parallel tempering, also known as replica exchange sampling, is an important method for simulating c...
Parallel tempering is a generic Markov chainMonteCarlo samplingmethod which allows good mixing with ...
<div><p>Sampling from complex distributions is an important but challenging topic in scientific and ...
Abstract. Multimodal structures in the sampling density (e.g. two competing phases) can be a serious...
We present here two novel algorithms for simulated tempering simulations, which break the detailed b...
We derive new results comparing the asymptotic variance of diffusions by writing them as appropriate...
Parallel tempering (PT) methods are a popular class of Markov chain Monte Carlo schemes used to samp...
The so-called swapping algorithm was designed to simulate from spin glass distributions, among other...
DOI
Add to ORKG