Markov chain Monte Carlo methods and the label switching problem in Bayesian mixture modeling

A. Jasra, C. C. Holmes, D. A. Stephens

Research output: Contribution to journalArticlepeer-review

462 Scopus citations


In the past ten years there has been a dramatic increase of interest in the Bayesian analysis of finite mixture models. This is primarily because of the emergence of Markov chain Monte Carlo (MCMC) methods. While MCMC provides a convenient way to draw inference from complicated statistical models, there are many, perhaps underappreciated, problems associated with the MCMC analysis of mixtures. The problems are mainly caused by the nonidentifiability of the components under symmetric priors, which leads to so-called label switching in the MCMC output. This means that ergodic averages of component specific quantities will be identical and thus useless for inference. We review the solutions to the label switching problem, such as artificial identifiability constraints, relabelling algorithms and label invariant loss functions. We also review various MCMC sampling schemes that have been suggested for mixture models and discuss posterior sensitivity to prior specification. © Institute of Mathematical Statistics, 2005.
Original languageEnglish (US)
JournalStatistical Science
Issue number1
StatePublished - Feb 1 2005
Externally publishedYes

Bibliographical note

Generated from Scopus record by KAUST IRTS on 2019-11-20


Dive into the research topics of 'Markov chain Monte Carlo methods and the label switching problem in Bayesian mixture modeling'. Together they form a unique fingerprint.

Cite this