A comparison of pivotal sampling and unequal probability sampling with replacement
From MaRDI portal
Publication:2374576
Abstract: We prove that any implementation of pivotal sampling is more efficient than multinomial sampling. This property entails the weak consistency of the Horvitz-Thompson estimator and the existence of a conservative variance estimator. A small simulation study supports our findings.
Recommendations
- A comparison of conditional Poisson sampling versus unequal probability sampling with replace\-ment
- On unequal probability sampling: Sufficient conditions for the superiority of sampling without replacement
- scientific article; zbMATH DE number 3292505
- Inference under pivotal sampling: Properties, variance estimation, and application to tesselation for spatial sampling
- Efficient Estimators With Simple Variance in Unequal Probability Sampling
Cites work
- scientific article; zbMATH DE number 5586064 (Why is no real title available?)
- A Generalization of Sampling Without Replacement From a Finite Universe
- A comparison of Sampford's sampling procedure versus unequal probability sampling with replacement
- A comparison of conditional Poisson sampling versus unequal probability sampling with replace\-ment
- Minimax solutions in sampling from finite populations
- Negative dependence and Srinivasan's sampling process
- Negative dependence in sampling
- On a characterization of ordered pivotal sampling
- On the Theory of Sampling from Finite Populations
- On unequal probability sampling: Sufficient conditions for the superiority of sampling without replacement
- Positive Influence and Negative Dependence
- Spatially balanced sampling through the pivotal method
- The BK inequality for pivotal sampling a.k.a. the Srinivasan sampling process
- Unequal probability sampling without replacement through a splitting method
Cited in
(7)- A comparison of conditional Poisson sampling versus unequal probability sampling with replace\-ment
- The BK inequality for pivotal sampling a.k.a. the Srinivasan sampling process
- Introduction to sampling techniques
- On a characterization of ordered pivotal sampling
- Approximating matrix eigenvalues by subspace iteration with repeated random sparsification
- A simulated annealing-based algorithm for selecting balanced samples
- scientific article; zbMATH DE number 3292505 (Why is no real title available?)
This page was built for publication: A comparison of pivotal sampling and unequal probability sampling with replacement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2374576)