Going off grid: computationally efficient inference for log-Gaussian Cox processes

From MaRDI portal
Publication:2797331

DOI10.1093/BIOMET/ASV064zbMATH Open1452.62704arXiv1111.0641OpenAlexW1818484123WikidataQ57266346 ScholiaQ57266346MaRDI QIDQ2797331FDOQ2797331

Håvard Rue, J. B. Illian, Sigrunn H. Sørbye, D. Simpson, Finn Lindgren

Publication date: 5 April 2016

Published in: Biometrika (Search for Journal in Brave)

Abstract: This paper introduces a new method for performing computational inference on log-Gaussian Cox processes. The likelihood is approximated directly by making novel use of a continuously specified Gaussian random field. We show that for sufficiently smooth Gaussian random field prior distributions, the approximation can converge with arbitrarily high order, while an approximation based on a counting process on a partition of the domain only achieves first-order convergence. The given results improve on the general theory of convergence of the stochastic partial differential equation models, introduced by Lindgren et al. (2011). The new method is demonstrated on a standard point pattern data set and two interesting extensions to the classical log-Gaussian Cox process framework are discussed. The first extension considers variable sampling effort throughout the observation window and implements the method of Chakraborty et al. (2011). The second extension constructs a log-Gaussian Cox process on the world's oceans. The analysis is performed using integrated nested Laplace approximation for fast approximate inference.


Full work available at URL: https://arxiv.org/abs/1111.0641




Recommendations





Cited In (35)





This page was built for publication: Going off grid: computationally efficient inference for log-Gaussian Cox processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2797331)