Answers are grounded in this paper and cite their sources.
Summary This paper demonstrates how Gaussian Markov random fields (conditional autoregressions) can be sampled quickly by using numerical techniques for sparse matrices. The algorithm is general and efficient, and expands easily to various forms for conditional simulation and evaluation of normalization constants. We demonstrate its use by constructing efficient block updates in Markov chain Monte Carlo algorithms for disease mapping.
No takes yet. Share an insight, caveat, or question.
Håvard Rue (2001) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: