Contributions to the Generalized Coupon Collector and LRU Problems
Discrete Mathematics
2017-06-19 v1
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.
Cite
@article{arxiv.1706.05250,
title = {Contributions to the Generalized Coupon Collector and LRU Problems},
author = {Christian Berthet},
journal= {arXiv preprint arXiv:1706.05250},
year = {2017}
}