Computational Statistics

, Volume 21, Issue 1, pp 53–62

A fast algorithm for balanced sampling

  • Guillaume Chauvet
  • Yves Tillé
Article

DOI: 10.1007/s00180-006-0250-2

Cite this article as:
Chauvet, G. & Tillé, Y. Computational Statistics (2006) 21: 53. doi:10.1007/s00180-006-0250-2

Summary

The cube method (Deville & Tillé 2004) is a large family of algorithms that allows selecting balanced samples with equal or unequal inclusion probabilities. In this paper, we propose a very fast implementation of the cube method. The execution time does not depend on the square of the population size anymore, but only on the population size. Balanced samples can thus be selected in very large populations of several hundreds of thousands of units.

Keywords

algorithm of balanced samplingauxiliary variablesbalanced samplingsampling designunequal probabilities sampling

Copyright information

© Springer-Verlag 2006

Authors and Affiliations

  • Guillaume Chauvet
    • 1
  • Yves Tillé
    • 2
  1. 1.Laboratoire de Statistique d'EnquêteCREST-ENSAIBruzFrance
  2. 2.Statistics GroupUniversity of NeuchâtelNeuchtelSwitzerland