Comparison of sampling schemes with and without replacement

DOI10.1023/A:1022102924007MaRDI QIDQ1810297zbMATH OpenOpenAlexFDO

Authors G. I. Ivchenko

Publication date 15 June 2003

Published in Mathematical Notes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1022102924007

zbMATH Keywords

sampling without replacementlimit lawsurn modelssampling with replacement

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Combinatorial probability (60C05) Stopping times; optimal stopping problems; gambling theory (60G40) Optimal stopping in statistics (62L15)

Recommendations

• Decomposable statistics and stopping times in sampling without replacement
• Sequential urn schemes and birth processes
• scientific article; zbMATH DE number 4050627
• On waiting time in the Markov-Pólya scheme
• How many samples does it take to see all the balls in an urn?

Cited in

(7)

• Odds inversion problem with replacement
• scientific article; zbMATH DE number 4050627 (Why is no real title available?)
• With or without replacement? Sampling uncertainty in Shepp’s urn scheme
• Random and fixed replacement sampling plans
• Selecting balls from urns with partial replacement rules
• Sequential urn schemes and birth processes
• scientific article; zbMATH DE number 598038 (Why is no real title available?)

This page was built for publication: Comparison of sampling schemes with and without replacement

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