The Expiring Coupon Collector: Sliding-Window Surjection Flux and Rare-Entry Laws
Abstract
We study the coupon collector with deterministic expiration: one coupon is drawn at each time, and each coupon remains active for exactly M draws. Completion occurs when all n coupon types are simultaneously active. Equivalently, the current length-M sliding window of draws must contain all n types. The central object is not the one-time probability that a random window is onto, but the stationary flux of new entries into the onto-window set. We compute this flux exactly: \[ μn,M =(Wt-1 is not onto,\ Wt is onto) =(n-1)(n-1)!S(M-1,n-1)nM, \] where S(·,·) denotes a Stirling number of the second kind. Under a quantitative subcritical separation condition, satisfied in particular by every fixed integer scale M=α n n, 0<α<1, we prove local declumping and obtain \[ μn,MTn,M⇒ (1). \] For the fixed subcritical scale M=α n n, 0<α<1, this gives the logarithmic scale \[ Tn,M=n1-α+o P(n1-α), Tn,M=n1-α+o(n1-α), \] and, when α>1/2, the sharper normalization \[ n-αe-n1-αTn,M⇒ (1), Tn,M nα en1-α. \] Thus the leading scale proposed in the Math StackExchange discussion is made rigorous; the exact finite-n flux gives the canonical normalization throughout the subcritical range. The result is a sliding-window companion to rare-void entry-flux methods for nonmonotone coupon collectors.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.