Computational Statistics

, Volume 21, Issue 1, pp 53-62

A fast algorithm for balanced sampling

  • Guillaume ChauvetAffiliated withLaboratoire de Statistique d'Enquête, CREST-ENSAI
  • , Yves TilléAffiliated withStatistics Group, University of Neuchâtel

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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.


algorithm of balanced sampling auxiliary variables balanced sampling sampling design unequal probabilities sampling