论文信息 - Contributions to the Generalized Coupon Collector and LRU Problems

Contributions to the Generalized Coupon Collector and LRU Problems

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.

Christian Berthet

[1] K. L. Q. Read,et al. A Lognormal Approximation for the Collector's Problem , 1998 .

[2] Philippe Flajolet,et al. Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search , 1992, Discret. Appl. Math..

[3] Christian Berthet. Identity of King and Flajolet & al. Formulae for LRU Miss Rate Exact Computation , 2016, ArXiv.

[4] P. Erd6s. ON A CLASSICAL PROBLEM OF PROBABILITY THEORY b , 2001 .

[5] M. Ferrante,et al. The Coupon Collector’s Problem , 2014 .

[6] M. Hofri,et al. The coupon-collector problem revisited — a survey of engineering problems and computational methods , 1997 .

[7] Bruno Sericola,et al. New Results on a Generalized Coupon Collector Problem Using Markov Chains , 2015, J. Appl. Probab..

[8] M. Ferrante,et al. On the expected number of different records in a random sample , 2012, 1209.4592.

[9] 96.49 On the diagonals of a Stirling number triangle , 2012, The Mathematical Gazette.

[10] Christian Berthet. On Von Schelling Formula for the Generalized Coupon Collector Problem , 2017, ArXiv.

[11] Vassilis G. Papanicolaou,et al. Asymptotics of the rising moments for the coupon collector's problem , 2013 .

[12] Ronald Fagin,et al. Asymptotic Miss Ratios over Independent References , 1977, J. Comput. Syst. Sci..