Models were fitted in R
24 using Markov Chain Monte Carlo (MCMC) methods. MCMC works by drawing simulations of model parameters from a Markov chain whose stationary distribution matches the required posterior distribution.
25 The Metropolis-Hastings (MH) algorithm is used to sample values from the Markov chain. A candidate value (
θ) is generated from the proposal distribution. The acceptance probability of
θ is calculated, and
θ is either accepted or rejected. If
θ is accepted it replaces the existing value and, thus, the chain moves, if rejected the existing value remains.
25 Gibbs sampling is also used and is a special case of the MH algorithm where all candidate values are accepted. Random walk MH, where candidate values are sampled dependent on the current value of the chain, was used for sampling
α and
β.
We implemented the following component-wise transition MCMC algorithm:
Lack of formal identifiability of
α and
δ i s, and
β and
η i s, is handled by replacing
α with
α + ∑
δi /
n and recentering so that ∑
δi = 0 (i.e.,
δi ←
δi – ∑
δi /
n).
26 Parameters ∑
η i and
β are handled in the same way. Models were run for 100,000 iterations, with burn in period of 12,000, and a thinning factor of 40. Parameter
α was initialized at 23, the mean sensitivity of all eyes over all time points. Trend
β was initialized at zero. SDs
σ δ and
σ η were initialized at 5 and 1, respectively, based on our experience with the variability of the VF measurements. Parameter
η is initialized at 0,
δ i at
yi at time point 0. Convergence was assessed using the Geweke diagnostic.
27 The deviance information criteria (DIC) was calculated and used to test the goodness of fit of our models.
25 Like other information criteria it penalizes models, which provide a poor fit and/or are overly complex with superfluous parameters. For each eye, significant progression was defined as a one sided Bayesian
P value of less than or equal to 0.05 for the overall eye trend,
β. We term our method SPROG, for Spatial PROGression, and, henceforth, refer to our model by this name.