Bayesian predictive inference of a proportion under a two-fold small area model with heterogeneous correlations
Section 2. Bayesian two-fold small area models and computations
We consider a finite population of
areas and
clusters within
the
area, and we
assume there are
individuals in
cluster within
area. The
binary responses are
for
We assume that
a simple random sample of
clusters is
taken from the
small area and
a simple random sample of
individuals is
taken from the
sampled
clusters from the
area. Here, we
assume the survey weights are the same within all clusters in each area. Let
and
Our target is the finite
population proportion of the
area which is
given by
where
Let
denote the nonsampled totals of the sampled
clusters
and
the totals of the nonsampled clusters
Letting
we can express our target,
as
To make inference about
the
we fit
hierarchical Bayesian models to the data. Using the beta-binomial
representation, these models accommodate the two-fold design structure. We
describe two models, one with homogeneous correlation and the other with
heterogeneous correlations, our main contribution beyond Nandram (2015). In
Section 2.1 we review the hierarchical Bayesian model with homogeneous
correlation, Nandram (2015) and we show how to make it comparable to our
hierarchical Bayesian model with heterogeneous correlations which we describe
in Section 2.2. In Section 2.3 we describe the blocked Gibbs sampler to fit our
model with heterogeneous correlations.
2.1 A review of two-fold model with homogeneous correlation
Nandram (2015) described
the two-fold small area model with homogeneous correlation. Here we give a
brief review of its main assumptions which are
where
and
represent the intracluster and intercluster
correlation, respectively. It is assumed that
strictly. Note that within the same area the
intracluster correlation
the correlation between two units in the same
cluster, is
Similarly, within the same area the
intercluster correlation
the correlation between two units in two
different clusters, is
Here, it is
that makes a difference between the one-fold
and two-fold models, and when
goes to zero, the two-fold model becomes the
one-fold model, Nandram (2015).
To fit the model
specified by (2.2)
(2.4), Nandram
(2015) used random sampling and Gaussian quadrature to perform one-dimensional
numerical integrations. He also used Gibbs sampling for comparison and found
minor differences. However, our generalization to heterogeneous correlations
(increased number of parameters) leads to additional weakly identified
parameters and model fitting becomes more difficult. So we incorporate
unimodality constraints on the prior distributions of the area parameters,
thereby making it possible to analyze sparse data. To make fair comparisons
between the two models, one with homogeneous correlations and the other with
heterogeneous correlations, we also impose the unimodality constraints in the
model specified by (2.2)
(2.4). Our
results under this slightly modified homogeneous model are similar to those in
Nandram (2015).
The methods introduced in
this paper allow unimodality to be imposed on some distributions to assist in
the estimation of weakly identified parameters. The unimodality restrictions
are flexible enough to avoid over-restricting the models. For a full
nonparametric Bayesian procedure, see Damien, Laud and Smith (1997). Thus,
throughout all our computations, we apply the unimodality restriction to
hyperparameters of
We also use similar unimodality restrictions in Section 2.2 for the model
with heterogeneous correlations. Henceforth, we call the model specified by
(2.2)
(2.5) the HoC model.
To fit the model, Nandram
(2015) use the multiplication rule by obtaining
after drawing
random samples of
from their
joint posterior density, where
The conditional
posterior density of the
is given by
and letting
and collapsing over the
we get
Because
and
and, given
and
are independent, once samples of the
are obtained, it is easy to make Bayesian
predictive inference. See Nandram (2015) for details.
2.2 A two-fold model with heterogeneous correlations
We extend the HoC model
to accommodate the heterogeneous correlations. Our assumptions are
Note that the intracluster correlation coefficient
introduced in the HoC model is replaced by
to provide the hierarchical Bayesian model
with heterogeneous correlations.
Similar to the HoC model,
a priori we also impose two sets of unimodality constraints,
Appendix B contains simple proofs of the above inequalities as unimodality
criterion and how to incorporate these constraints into our computation.
Henceforth, we call the hierarchical Bayesian model specified by (2.6)
(2.11) the HeC model.
Again, similar to Nandram
(2015), under the HeC model, we show in Appendix A that
That is, within the
area, the intracluster correlation coefficient
is
and the intercluster correlation coefficient
is
Using Bayes’ theorem in
the HeC model, the joint posterior density
is easy to
write down. (This is the density without the normalization constant.) Henceforth,
we would call this joint posterior density the HeC posterior.
In order to make
inference about the finite population proportion,
we draw samples
from
using the
multiplication rule and blocked Gibbs sampler. This procedure is described in
Section 2.3.
2.3 Computations in the HeC posterior
First, note that we
collapse HeC posterior over the
and then use
the Gibbs sampler to fit the joint marginal posterior density. After obtaining
the samples, we can draw samples of the
from the
conditional posterior densities of the
by applying the
multiplication rule.
As in the HoC model, the
conditional posterior density of
is
Thus, it is easy to draw samples of the
once samples are obtained from the joint
posterior density of
After integrating out the
from the HeC posterior, the marginal joint
posterior density is given by
The
conditional posterior densities are
and letting
and
and
Similarly,
letting
and
and
The problem with this procedure is that
and
are correlated because intuitively they both
depend on only
through two numbers,
and
not the data,
This gives poor mixing in the Gibbs sampler. For
instance,
and
where
and
Nandram (2015). That is,
is correlated with
and
Similar problems occur in
Therefore, in order to solve these weak
identifiability problems, we use the blocked Gibbs sampler to draw random
samples of
The blocked Gibbs sampler is obtained by drawing from
the conditional posterior density
and
each in turn until convergence as we describe
below. The two joint conditional posterior densities are
and
To run the blocked Gibbs sampler, we apply the multiplication rule in
and
see, for example, Molina et al. (2014)
and Toto and Nandram (2010).
First, we consider
We integrate out
and obtain the joint conditional posterior
density of
given
and
Here, the middle Riemann sum method is used to integrate
out all
We partition the interval (0, 1) into
subintervals
where
Then we can compute the joint conditional
posterior distribution of
as follows.
and
is the cdf corresponding to
which is a density function of
Next, we also integrate out
by using Gaussian quadrature via Legendre
orthogonal polynomials,
where
are the weights and
are roots of the Legendre polynomial with the
interval
We have taken
in our computations (larger values of
make little difference).
Now,
we can use a univariate grid method (e.g., Molina, Nandram and Rao 2014 and Toto
and Nandram 2010) in order to draw samples of the posterior density of
conditional on
and
see Ritter and Tanner (1992) for a description
of the griddy Gibbs sampler. Then, conditional on
we get the posterior density of
as follows,
Samples are obtained from the conditional posterior density of
by using the univariate grid sampler again.
Subsequently, conditional on
is drawn from
using the univariate grid sampler.
For
the grid method, we divide the unit interval into sub-intervals of 0.01 width,
and the joint posterior density is approximated by a discrete distribution with
probabilities proportional to the heights of the continuous distribution at the
mid-points of these sub-intervals. Note that a uniform jittering is done within
each selected interval to allow different deviates with probability one (Nandram
2015). Even when we used finer sub-intervals (e.g., using 0.005 width), the
inference results turned out to be almost same. Thus, we use the sub-intervals
of 0.01 width; see Molina et al. (2014). When most of the distribution is
near one of the boundaries (e.g., 0 or 1), we make intervals with much smaller widths
to capture small or large values of the parameter.
Second,
we consider
We integrate out
and obtain the joint conditional posterior
density of
given
and
Again, we apply the middle Riemann sum method to
integrate out all
and compute the joint conditional posterior
distribution of
where
and
is the cdf corresponding to
which is a density function of
Using Gaussian quadrature via Legendre
orthogonal polynomials, we can integrate out
and obtain the conditional posterior density
of
where
are the weights and
are roots of the Legendre polynomial with the
interval
Then, we use the
univariate grid method in order to draw samples of the posterior density of
conditional on
and
Therefore, the
conditional posterior density of
can be
represented as
and we can get samples of
by using the univariate grid sampler again.
Finally, conditional on
can be drawn from
where we also use the univariate grid method.
This algorithm samples
by first
drawing an iterate from
an iterate from
and then an
iterate from
Then, it
samples
by first
drawing an iterate from
an iterate from
and then an
iterate from
The entire
procedure continues until convergence. It is like using a Gibbs sampler with
two conditional posterior densities which is, in fact, the blocked Gibbs
sampler. The construction of the blocked Gibbs sampler is very efficient and it
is one of our key contributions in this paper. In fact, we might call the
blocked Gibbs sampler the blocked griddy Gibbs sampler (Ritter and Tanner
1992).
We have monitored the
convergence of the blocked Gibbs sampler using trace plots, autocorrelation
plots and Geweke test of stationarity. The trace plot, iterates versus time,
gives information about how long a burn-in period is required to remove the
effect of initial values. The autocorrelation plots display dependence in the
chain, and thus, in the plots high correlations between long lags indicate a
poor mixing chain. The Geweke test compares the means from the early and latter
part of the Markov chain by using a
score
statistic, where the null hypothesis is that the chain is stationary; the
values are all
larger than 0.10. We have used the trace plots, autocorrelation plots, and
Geweke test for each parameter to study convergence of each run of the blocked
Gibbs sampler. For our data, we draw 2,000 samples and burn in 1,000 in order
to obtain a sample of 1,000 iterates for inference. This burn-in period, which
is based on the trace plots and Geweke test, is long enough to get random
samples. The correlations are all nonsignificant, and interestingly, we do not
have to thin the iterates. Also, Geweke test demonstrates stationarity of our
sampler. Thus, we have a highly efficient blocked Gibbs sampler. The procedure
takes a few minutes on R. We have applied the same procedure in our simulation
study.