Computational aspects of order \(\pi ps\) sampling schemes
From MaRDI portal
Publication:1020006
DOI10.1016/J.CSDA.2006.12.026zbMath1161.62311OpenAlexW1535048001MaRDI QIDQ1020006
Publication date: 29 May 2009
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.csda.2006.12.026
order statisticsnumerical integrationunequal probabilitiessample surveyfixed sample sizeco-ordination over timepermanent random numbers
Related Items (6)
Small area estimation of proportions with constraint for National Resources Inventory survey ⋮ Deville and Särndal's calibration: revisiting a 25-years-old successful optimization problem ⋮ Unnamed Item ⋮ Optimal unbiased estimation of some population central moments ⋮ Unnamed Item ⋮ Unequal probability sampling from a finite population: a multicriteria approach
Cites Work
- Unnamed Item
- Unnamed Item
- On sampling with probability proportional to size
- On inclusion probabilities and relative estimator bias for Pareto \(\pi\)ps sampling
- Model assisted survey sampling
- Asymptotic theory for order sampling
- Comparisons between conditional Poisson sampling and Pareto \(\pi\)ps sampling designs
- On inclusion probabilities for order \(\pi ps\) sampling.
- Sampling design and sample selection through distribution theory
- Algorithms to find exact inclusion probabilities for conditional Poisson sampling and Pareto \(\pi ps\) sampling designs
- Computing inclusion probabilities for order sampling
- Computing distributions of order statistics
- Pareto Sampling versus Sampford and Conditional Poisson Sampling
- Asymptotic Theory of Rejective Sampling with Varying Probabilities from a Finite Population
This page was built for publication: Computational aspects of order \(\pi ps\) sampling schemes