Answers are grounded in this paper and cite their sources.
An r-element subset of an n-element universe evolves by replacing a uniformly chosen element with a uniformly chosen element outside the current set. Each configuration collects all of its s-element subsets. For every fixed pair 2≤ s<r, we prove that the expected time to collect all s-subsets is asymptotic to\[{ ns}{{r-1}{s-1}}log ns.\]This proves the fixed-parameter off-diagonal case of the conjecture of Athreya, Mukherjee and Mukherjee. We also obtain a Poisson limit for the number of subsets still missing near completion and a standard Gumbel limit for the centered and scaled collection time. The conclusions hold from every initial configuration. The proof controls joint avoidance of any fixed family of target subsets, uniformly over their overlaps. Restricting the walk to the labels in that family gives a finite transition matrix, and a stationary-flow identity determines its leading killing rate. Standard spectral and factorial-moment arguments then give the collection-time limits. This record contains the PDF preprint and matching editable LaTeX sources with build instructions. The results are analytic, with fixed r and s as n tends to infinity. AI assistance is disclosed in the manuscript. This is a preprint and has not undergone journal peer review.
No takes yet. Share an insight, caveat, or question.
Sam Vaseghi (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: