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

DOI10.15446/RCE.V37N1.44362zbMATH Open1435.62055OpenAlexW1967231841MaRDI QIDQ5113983FDOQ5113983

Authors: Yuxia Xue, Zaizai Yan 

Publication date: 21 June 2020

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

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

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

zbMATH Keywords

Poisson samplinginclusion probabilitiesAP sampling design

Mathematics Subject Classification ID

Sampling theory, sample surveys (62D05)

Cited In (3)

• On inclusion probabilities for order \(\pi ps\) sampling.
• The construction of \(\Pi\) PS sampling designs through a method of emptying boxes
• A guide to the Fortran programs to calculate inclusion probabilities for conditional Poisson sampling and Pareto \(\pi\)ps sampling designs

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)