On computational aspects of Bayesian spatial models: influence of the neighboring structure in the efficiency of MCMC algorithms (Q638046): Difference between revisions
From MaRDI portal
Latest revision as of 11:16, 4 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On computational aspects of Bayesian spatial models: influence of the neighboring structure in the efficiency of MCMC algorithms |
scientific article |
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
