On computational aspects of Bayesian spatial models: influence of the neighboring structure in the efficiency of MCMC algorithms
DOI10.1007/s00180-009-0153-0zbMath1240.65017OpenAlexW2052200802MaRDI QIDQ638046
Dani Gamerman, Vinícius Diniz Mayrink
Publication date: 8 September 2011
Published in: Computational Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00180-009-0153-0
Computational methods in Markov chains (60J22) Random fields (60G60) Computational methods for problems pertaining to statistics (62-08) Linear regression; mixed models (62J05) Bayesian inference (62F15) Monte Carlo methods (65C05) Numerical analysis or methods applied to Markov chains (65C40)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Fast Sampling of Gaussian Markov Random Fields
- Bayesian forecasting and dynamic models.
- Space-varying regression models: specifications and simulation
- Bayesian image restoration, with two applications in spatial statistics (with discussion)
- Bayesian computation and stochastic systems. With comments and reply.
- Bayesian reference analysis for Gaussian Markov random fields
- Disease Mapping of Stage-Specific Cancer Incidence Data
- Partially Collapsed Gibbs Samplers
- Markov chain Monte Carlo for dynamic generalised linear models
- Conditional Prior Proposals in Dynamic Models
- DATA AUGMENTATION AND DYNAMIC LINEAR MODELS
- Covariance structure of the Gibbs sampler with applications to the comparisons of estimators and augmentation schemes
- Partial non-Gaussian state space
- On Gibbs sampling for state space models
- Fitting Gaussian Markov Random Fields to Gaussian Fields
- On Block Updating in Markov Random Field Models for Disease Mapping
- Approximating Hidden Gaussian Markov Random Fields
- Modelling Spatially Correlated Data via Mixtures: A Bayesian Approach
- Proper multivariate conditional autoregressive models for spatial data analysis
This page was built for publication: On computational aspects of Bayesian spatial models: influence of the neighboring structure in the efficiency of MCMC algorithms
