Contributions to the Generalized Coupon Collector and LRU Problems
classification
💻 cs.DM
keywords
collectorcoupongeneralizedasymptoticcachecollectionconjecturescontributions
read the original abstract
Based upon inequalities on Subset Probabilities, proofs of several conjectures on the Generalized Coupon Collector Problem (i.e. CCP with unequal popularity) are presented. Then we derive a very simple asymptotic relation between the expectation of the waiting time for a partial collection in the CCP, and the Miss rate of a LRU cache.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.