Algorithms to calculate exact inclusion probabilities for a non-rejective approximate sampling design

DOI10.15446/RCE.V37N1.44362MaRDI QIDQ5113983zbMATH OpenOpenAlexFDO

Authors Yuxia Xue, Zaizai Yan

Publication date 21 June 2020

Published in Revista Colombiana de Estadística (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.15446/rce.v37n1.44362

zbMATH Keywords

AP sampling designinclusion probabilitiesPoisson sampling

Mathematics Subject Classification ID

Sampling theory, sample surveys (62D05)

Recommendations

• Algorithms to find exact inclusion probabilities for 2P\(\pi\)ps sampling designs
• Algorithms to find exact inclusion probabilities for conditional Poisson sampling and Pareto \(\pi ps\) sampling designs
• scientific article; zbMATH DE number 3905627
• An efficient non-rejective implementation of the \(\pi \mathrm{ps}\) sampling designs
• A guide to the Fortran programs to calculate inclusion probabilities for conditional Poisson sampling and Pareto \(\pi\)ps sampling designs

Cited in

(6)

• On inclusion probabilities for order ps sampling.
• A guide to the Fortran programs to calculate inclusion probabilities for conditional Poisson sampling and Pareto \(\pi\)ps sampling designs
• The recursive formula of the second-order inclusion probabilities for the conditional Poisson sampling
• Algorithms to find exact inclusion probabilities for 2P\(\pi\)ps sampling designs
• An efficient non-rejective implementation of the \(\pi \mathrm{ps}\) sampling designs
• The construction of \(\Pi\) PS sampling designs through a method of emptying boxes

This page was built for publication: Algorithms to calculate exact inclusion probabilities for a non-rejective approximate \(\pi\mathrm{ps}\) sampling design

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5113983)