Parallel and interacting Markov chain Monte Carlo algorithm (Q730861)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Parallel and interacting Markov chain Monte Carlo algorithm |
scientific article; zbMATH DE number 5610212
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel and interacting Markov chain Monte Carlo algorithm |
scientific article; zbMATH DE number 5610212 |
Statements
Parallel and interacting Markov chain Monte Carlo algorithm (English)
0 references
1 October 2009
0 references
The authors ``propose a strategy for making \(N\) parallel Monte Carlo Markov chains (MCMC) interact in order to get an approximation of an independent \(N\)-sample of a given target law.'' More specifically, parallel/interacting Metropolis within Gibbs (MwG) algorithm is considered. It is proved ``that the set of interacting chains is itself a MCMC method for the product of \(N\) target measures''. The parallel/interacting MwG and parallel/independent MwG algorithms are compared by examples.
0 references
Markov chain Monte Carlo method
0 references
interacting chains
0 references
hidden Markov model
0 references
Metropolis within Gibbs algorithm
0 references
0.8300693035125732
0 references
0.8164910078048706
0 references
0.8136745095252991
0 references
0.8018386960029602
0 references
