Research article

Generalized analysis of the coupon collector problem with reset button

  • Published: 06 July 2026
  • MSC : 60C05, 60G50

  • In this paper, we study a generalized version of the coupon collector problem that includes a reset button, which restarts the collection process when it is drawn. We derive an explicit formula for the expected waiting time to collect all distinct coupons in the general case where standard coupons are drawn with arbitrary probabilities. Using this result, we reprove the recent expected waiting time formula by Jocković and Todić in [8] for the case where standard coupons have equal probabilities, which is expressed in terms of the beta function.

    Citation: Yan Li, Cancan Dai, Daeyeoul Kim. Generalized analysis of the coupon collector problem with reset button[J]. AIMS Mathematics, 2026, 11(7): 19739-19748. doi: 10.3934/math.2026800

    Related Papers:

  • In this paper, we study a generalized version of the coupon collector problem that includes a reset button, which restarts the collection process when it is drawn. We derive an explicit formula for the expected waiting time to collect all distinct coupons in the general case where standard coupons are drawn with arbitrary probabilities. Using this result, we reprove the recent expected waiting time formula by Jocković and Todić in [8] for the case where standard coupons have equal probabilities, which is expressed in terms of the beta function.



    加载中


    [1] E. Anceaume, Y. Busnel, B. Sericola, New results on a generalized coupon collector problem using Markov chains, J. Appl. Probab., 52 (2015), 405–418. https://doi.org/10.1239/jap/1437658606 doi: 10.1239/jap/1437658606
    [2] D. Barak-Pelleg, D. Berend, The time for reconstructing the attack graph in DDoS attacks, J. Math. Anal. Appl., 531 (2024), 128708. https://doi.org/10.1016/j.jmaa.2023.127889 doi: 10.1016/j.jmaa.2023.127889
    [3] A. Boneh, M. Hofri, The coupon-collector problem revisited–-a survey of engineering problems and computational methods, Commun. Statist. Stochastic Models, 13 (1997), 39–66. https://doi.org/10.1080/15326349708807412 doi: 10.1080/15326349708807412
    [4] P. Diaconis, S. Holmes, A Bayesian peek into Feller Volume I, Sankhya A, 64 (2002), 820–841. https://doi.org/10.2307/25051431 doi: 10.2307/25051431
    [5] P. Haukkanen, Some binomial inversions in terms of ordinary generating functions, Publ. Math. Debrecen, 47 (1995), 181–191.
    [6] L. Holst, On birthday, collectors, occupancy and other classical urn problems, Int. Stat. Rev., 54 (1986), 15–27. https://doi.org/10.2307/1403255 doi: 10.2307/1403255
    [7] J. Jocković, B. Todić, Waiting time for a small subcollection in the coupon collector problem with universal coupon, J. Theor. Probab., 37 (2024), 1945–1957. https://doi.org/10.1007/s10959-023-01297-6 doi: 10.1007/s10959-023-01297-6
    [8] J. Jocković, B. Todić, Coupon collector problem with reset button, Mathematics, 12 (2024), 239. https://doi.org/10.3390/math12020239 doi: 10.3390/math12020239
    [9] A. León-García, A. Pérez, A. Bolívar-Cimé, New easy to compute formulas for the moments of random variables appearing in the coupon collector problem, Probab. Math. Statist., 43 (2023), 155–164. https://doi.org/10.37190/0208-4147.43.1.10 doi: 10.37190/0208-4147.43.1.10
    [10] T. Mäklin, Probabilistic Methods for High-Resolution Metagenomics, Ph.D. thesis, University of Helsinki, Helsinki, Finland, 2022.
    [11] R. Motwani, P. Raghavan, Randomized Algorithms, Cambridge University Press, 1995. https://doi.org/10.1017/CBO9780511814075
    [12] T. Nakata, I. Kubo, A coupon collector's problem with bonuses, in Proceedings of the 4th Colloquium on Mathematics and Computer Science, Nancy, France, 2006,215–224. https://doi.org/10.46298/dmtcs.3486
    [13] Y. Sasaki, Y. Li, H. Sakamoto, K. Sakiyama, Coupon collector's problem for fault analysis against AES, in Financial Cryptography and Data Security, 2013. https://doi.org/10.1007/978-3-642-39884-1_24
    [14] S. Shioda, Some upper and lower bounds on the coupon collector problem, J. Comput. Appl. Math., 200 (2007), 154–167. https://doi.org/10.1016/j.cam.2005.12.008 doi: 10.1016/j.cam.2005.12.008
    [15] Y. Simsek, A new class of polynomials associated with Bernstein and beta polynomials, Math. Methods Appl. Sci., 37 (2014), 676–685. https://doi.org/10.1002/mma.2824 doi: 10.1002/mma.2824
    [16] Y. Simsek, Beta-type polynomials and their generating functions, Appl. Math. Comput., 254 (2015), 172–182. https://doi.org/10.1016/j.amc.2014.12.115 doi: 10.1016/j.amc.2014.12.115
    [17] B. Todić, Coupon collector problem with penalty coupon, Mat. Vesnik, 76 (2024), 15–28.
    [18] M. Wild, S. Janson, S. Wagner, D. Laurie, Coupon collecting and transversals of hypergraphs, Discuss. Math. Theor. Comput. Sci., 15 (2013), 259–270. https://doi.org/10.7151/dmtcs.1287 doi: 10.7151/dmtcs.1287
    [19] A. Zeleke, Probabilistic proofs of some beta-function identities, J. Integer Seq., 22 (2019), Article 19.6.6.
    [20] N. Zoroa, E. Lesigne, M. A. J. Saez, P. Zoroa, J. Casas, The coupon collector urn model with unequal probabilities in ecology and evolution, J. R. Soc. Interface, 14 (2016). https://doi.org/10.1098/rsif.2017.0258 doi: 10.1098/rsif.2017.0258
  • Reader Comments
  • © 2026 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(311) PDF downloads(105) Cited by(0)

Article outline

Figures and Tables

Tables(1)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog