Abstract
In 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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
