sondage: Survey Sampling Algorithms
Author:
- 3 August 2026
- dataset
- Published by The R Foundation
Abstract
Fast implementations of survey sampling algorithms for single-stage probability sampling from finite populations, written in C. Provides equal probability methods (simple random sampling, systematic, Bernoulli), unequal probability methods (conditional Poisson / maximum entropy, Sampford, Brewer, systematic PPS, Pareto, sequential Poisson, Poisson, Chromy's minimum replacement, multinomial), balanced sampling via the cube method, and spatially balanced sampling via the local pivotal method and spatially correlated Poisson sampling. All sampling functions return design objects carrying sample indices, inclusion probabilities, and design metadata. Generics compute joint inclusion probabilities, pairwise expectations, and sampling covariances for variance estimation. Mostly based on algorithms from Tillé (2006, ).Keywords
This publication has 17 references indexed in Scilit:
- Balanced Sampling With Inequalities: Application to Category Bounding, Matrix Rounding, and Spread SamplingJournal of the American Statistical Association, 2025
- Spatially correlated Poisson samplingJournal of Statistical Planning and Inference, 2012
- Spatially Balanced Sampling through the Pivotal MethodBiometrics, 2011
- Sampling Algorithms2006
- Efficient balanced sampling: The cube methodBiometrika, 2004
- Unequal probability sampling without replacement through a splitting methodBiometrika, 1998
- On sampling with probability proportional to sizeJournal of Statistical Planning and Inference, 1997
- Weighted finite population sampling to maximize entropyBiometrika, 1994
- On sampling without replacement with unequal probabilities of selectionBiometrika, 1967
- A Generalization of Sampling Without Replacement from a Finite UniverseJournal of the American Statistical Association, 1952