On computational aspects of Bayesian spatial models: influence of the neighboring structure in the efficiency of MCMC algorithms (Q638046)
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: On computational aspects of Bayesian spatial models: influence of the neighboring structure in the efficiency of MCMC algorithms |
scientific article; zbMATH DE number 5946109
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On computational aspects of Bayesian spatial models: influence of the neighboring structure in the efficiency of MCMC algorithms |
scientific article; zbMATH DE number 5946109 |
Statements
On computational aspects of Bayesian spatial models: influence of the neighboring structure in the efficiency of MCMC algorithms (English)
0 references
8 September 2011
0 references
A discrete Markov random field distribution is considered as the prior for a spatial regression model. Markov chain Monte Carlo (MCMC) algorithms are proposed for a posteriori sampling. Different sampling schemes are discussed. The efficiency of the algorithms is compared using simulated data.
0 references
Markov random field
0 references
spatial regression
0 references
Markov chain Monte Carlo
0 references
Bayesian inference
0 references
algorithms
0 references
0 references
0 references
0.8063693046569824
0 references
0.7897027730941772
0 references
0.7737606167793274
0 references
0.762100338935852
0 references
