Comparison of sampling schemes with and without replacement
This paper presents results on stopping times and stopping configurations of the following urn schemes. \(N_a\) balls of \(N\) different colors are initially given in an urn, where the number of balls of each color is exactly \(a\); balls are drawn one after another with or without replacement (all balls in the urn are equally likely to be drawn); the process stops at the first time when there are \(k\) colors drawn and each color with at least \(m\) balls. The number of colors \(\mu_r\) appearing exactly \(r\) times in the sample is also studied. Results are given for three non-overlapping ranges: \(k=O(1)\), \(k=xN+o(\sqrt{N})\) (\(x\in(0,1)\)), and \(N-k=O(1)\). In particular, in the middle range, \(\mu_r\) and the stopping time are asymptotically normally distributed with linear mean and linear variance under both sampling schemes (with or without replacement). The method of proof (based on an embedding in a Markov process) is sketched.
- How many samples does it take to see all the balls in an urn?
- Random and fixed replacement sampling plans
- Sequential urn schemes and birth processes
- scientific article; zbMATH DE number 4050627 (Why is no real title available?)
- scientific article; zbMATH DE number 598038 (Why is no real title available?)
- Decomposable statistics and stopping times in sampling without replacement
- Odds inversion problem with replacement
- With or without replacement? Sampling uncertainty in Shepp’s urn scheme
- Selecting balls from urns with partial replacement rules
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)
