The Annals of Applied Statistics
- Ann. Appl. Stat.
- Volume 4, Number 3 (2010), 1183-1213.
Modeling hourly ozone concentration fields
This paper compares two methods built on a hierarchical Bayesian foundation and designed for modeling hourly ozone concentrations over the eastern United States. One, a dynamic linear state space model (DLM) that has been proposed earlier, lies in a very contemporary setting where two historical paths to temporal process models, the Kalman filter and the dynamic system with random perturbations, converge. The other, which we call the Bayesian spatial predictor (BSP), is a Bayesian alternative to the purely spatial method of kriging. The DLM as a dynamic system model has parameters that are states of the process which generate the ozone and change with time. More specifically, the model includes a time-varying site invariant mean field as well as time-varying coefficients for 24 and 12 hour diurnal cyclic components. The resulting model’s great flexibility comes at the cost of complexity, forcing the use of an MCMC approach and very time-consuming computations. Thus, the size of the DLM’s spatial domain of applicability has to be restricted and the number of monitoring sites that can be treated limited. The paper’s assessment of the DLM reveals other difficulties that point to the need to consider a less flexible competitor, a Bayesian spatial predictor (BSP). The two methods are compared in a variety of ways and overall conclusions given. In particular, the conclusions point to the BSP as the more practical alternative for spatial prediction.
Ann. Appl. Stat., Volume 4, Number 3 (2010), 1183-1213.
First available in Project Euclid: 18 October 2010
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Dou, Yiping; D. Le, Nhu; V. Zidek, James. Modeling hourly ozone concentration fields. Ann. Appl. Stat. 4 (2010), no. 3, 1183--1213. doi:10.1214/09-AOAS318. https://projecteuclid.org/euclid.aoas/1287409369
- Supplementary material A: MCMC convergence. We show the MCMC convergence graphically in detail in Section 5 of this paper. Starting from different initial values, two Markov chains mixed well after a few hundred iterations.
- Supplementary material B: Manuscripts for GDLM.1.0. We summarize the usage of the software package GDLM.1.0 written by R and C languages.