Network inclusion probabilities and Horvitz-Thompson estimation for adaptive simple Latin square sampling

Abstract

Consider a survey of a plant or animal species in which abundance or presence/absence will be recorded. Further assume that the presence of the plant or animal is rare and tends to cluster. A sampling design will be implemented to determine which units to sample within the study region. Adaptive cluster sampling designs Thompson (1990) are sampling designs that are implemented by first selecting a sample of units according to some conventional probability sampling design. Then, whenever a specified criterion is satisfied upon measuring the variable of interest, additional units are adaptively sampled in neighborhoods of those units satisfying the criterion. The success of these adaptive designs depends on the probabilities of finding the rare clustered events, called networks. This research uses combinatorial generating functions to calculate network inclusion probabilities associated with a simple Latin square sample. It will be shown that, in general, adaptive simple Latin square sampling when compared to adaptive simple random sampling will (i) yield higher network inclusion probabilities and (ii) provide Horvitz-Thompson estimators with smaller variability.