PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
March 1, 1996Journal of the American Statistical Association84 citations

Studying Convergence of Markov Chain Monte Carlo Algorithms Using Coupled Sample Paths

View Full Paper
VJValen E. Johnson

Key Points

Key points are not available for this paper at this time.

Abstract

I describe a simple procedure for investigating the convergence properties of Markov chain Monte Carlo sampling schemes. The procedure uses coupled chains from the same sampler, obtained by using the same sequence of random deviates for each run. By examining the distribution of the iteration at which all sample paths couple, convergence properties for the system can be established. The procedure also provides a simple diagnostic for detecting modes in multimodal posteriors. Several examples of the procedure are provided. In Ising models, the relation between the correlation parameter and the convergence rate of rudimentary Gibbs samplers is investigated. In another example, the effects of multiple modes on the convergence of coupled paths are explored using mixtures of bivariate normal distributions. The technique is also used to evaluate the convergence properties of a Gibbs sampling scheme applied to a model for rat growth rates.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Valen E. Johnson (1996) studied this question.

synapsesocial.com/papers/6a867f706c87af29fecc6f36https://doi.org/10.1080/01621459.1996.10476672
Ask AI
Helpful
Bookmark
Share
View Full Paper