Pith. sign in

REVIEW 1 cited by

A note on the coupon - collector's problem with multiple arrivals and the random sampling

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1209.2667 v2 pith:YO6GLOS2 submitted 2012-09-12 math.PR

A note on the coupon - collector's problem with multiple arrivals and the random sampling

classification math.PR
keywords couponsexpectedindependentlynoteableapplicationarrivalsarrives
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

In this note we evaluate the expected waiting time to complete a collection of coupons, in the case of coupons which arrives in groups of constant size, independently and with unequal probabilities. As an application we will be able to determine the expected number of samples of dimension g that we have to draw independently in order to observe all the types of individuals in a given population.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Filter-assisted quantum subspace diagonalization via wavefunction sparsity engineering

    quant-ph 2026-05 unverdicted novelty 6.0

    Filter-assisted SQD uses a quantum filter to engineer sparser ground-state wavefunctions, yielding orders-of-magnitude lower energy errors and reduced sampling overhead versus standard SQD on the transverse-longitudin...