We obtain upper bounds on the spectral gap of Markov chains constructed by parallel and simulated tempering, and provide a set of sufficient conditions for torpid mixing of both techniques. Combined with the results of [22], these results yield a two-sided bound on the spectral gap of these algorithms. We identify a persistence property of the target distribution, and show that it can lead unexpectedly to slow mixing that commonly used convergence diagnostics will fail to detect. For a multi-modal distribution, the persistence is a measure of how “spiky”, or tall and narrow, one peak is relative to the other peaks of the distribution. We show that this persis-tence phenomenon can be used to explain the torpid mixing of parallel and simulate...
Abstract. Multimodal structures in the sampling density (e.g. two competing phases) can be a serious...
We present several results on the mixing time of the Glauber dynamics for sampling from the Gibbs di...
In the current work we present two generalizations of the Parallel Tempering algorithm, inspired by ...
Simulated tempering and swapping are two families of sampling algorithms in which a parameter repres...
When sampling a multi-modal distribution pi(x), x ∈ Rd, a Markov chain with local proposals is often...
We study two widely used algorithms, Glauber dynamics and the Swendsen-Wang algorithm, on rectangula...
In this paper we study the relationships between two Markov Chain Monte Carlo algorithms--the Swappi...
AbstractIn this paper we study the relationships between two Markov Chain Monte Carlo algorithms—the...
Parallel tempering (PT) methods are a popular class of Markov chain Monte Carlo schemes used to samp...
In this paper various extensions of the parallel-tempering algorithm are developed and their propert...
Parallel tempering (PT) methods are a popular class of Markov chain Monte Carlo schemes used to samp...
Parallel tempering is a generic Markov chainMonteCarlo samplingmethod which allows good mixing with ...
It is well known that traditional Markov chain Monte Carlo (MCMC) methods can fail to effectively ex...
AbstractWe study the problem of sampling uniformly at random from the set of k-colorings of a graph ...
We consider the mixing properties of the Swendsen-Wang process for the 2state Potts model or Ising m...
Abstract. Multimodal structures in the sampling density (e.g. two competing phases) can be a serious...
We present several results on the mixing time of the Glauber dynamics for sampling from the Gibbs di...
In the current work we present two generalizations of the Parallel Tempering algorithm, inspired by ...
Simulated tempering and swapping are two families of sampling algorithms in which a parameter repres...
When sampling a multi-modal distribution pi(x), x ∈ Rd, a Markov chain with local proposals is often...
We study two widely used algorithms, Glauber dynamics and the Swendsen-Wang algorithm, on rectangula...
In this paper we study the relationships between two Markov Chain Monte Carlo algorithms--the Swappi...
AbstractIn this paper we study the relationships between two Markov Chain Monte Carlo algorithms—the...
Parallel tempering (PT) methods are a popular class of Markov chain Monte Carlo schemes used to samp...
In this paper various extensions of the parallel-tempering algorithm are developed and their propert...
Parallel tempering (PT) methods are a popular class of Markov chain Monte Carlo schemes used to samp...
Parallel tempering is a generic Markov chainMonteCarlo samplingmethod which allows good mixing with ...
It is well known that traditional Markov chain Monte Carlo (MCMC) methods can fail to effectively ex...
AbstractWe study the problem of sampling uniformly at random from the set of k-colorings of a graph ...
We consider the mixing properties of the Swendsen-Wang process for the 2state Potts model or Ising m...
Abstract. Multimodal structures in the sampling density (e.g. two competing phases) can be a serious...
We present several results on the mixing time of the Glauber dynamics for sampling from the Gibbs di...
In the current work we present two generalizations of the Parallel Tempering algorithm, inspired by ...