On a Characterization of ordered Pivotal Sampling
AbstractWhen auxiliary information is available at the design stage, samples may be selected bymeans of balanced sampling. Deville and Tillé proposed in 2004 a general algorithm toperform balanced sampling, named the cube method. In this paper, we are interested in aparticular case of the cube method named pivotal sampling, and first described by Devilleand Tillé in 1998. We show that this sampling algorithm, when applied to units ranked ina fixed order, is equivalent to Deville’s systematic sampling, in the sense that both algorithmslead to the same sampling design. This characterization enables the computationof the second-order inclusion probabilities for pivotal sampling. We show that the pivotalsampling enables to take account of an appropriate ordering of the units to achieve avariance reduction, while limiting the loss of efficiency if the ordering is not appropriate.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Centre de Recherche en Economie et Statistique in its series Working Papers with number 2010-50.
Date of creation: 2010
Date of revision:
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Florian Sallaberry).
If references are entirely missing, you can add them using this form.