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
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00180-009-0153-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2052200802 / rank
 
Normal rank

Revision as of 02:22, 20 March 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
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references