Card guessing and the birthday problem for sampling without replacement-Reference-Cited by-同舟云学术

Card guessing and the birthday problem for sampling without replacement

Published:2023-12-01 Issue:6B Volume:33 Page:
ISSN:1050-5164
Container-title:The Annals of Applied Probability
language:
Short-container-title:Ann. Appl. Probab.

Author:

He Jimmy¹,Ottolini Andrea²

Affiliation:

1. Department of Mathematics, Massachusetts Institute of Technology

2. Department of Mathematics, University of Washington

Publisher

Institute of Mathematical Statistics

Subject

Statistics, Probability and Uncertainty,Statistics and Probability

Reference30 articles.

1. Arratia, R., Goldstein, L. and Gordon, L. (1989). Two moments suffice for Poisson approximations: The Chen–Stein method. Ann. Probab. 17 9–25.

2. Bhattacharya, B. B., Diaconis, P. and Mukherjee, S. (2017). Universal limit theorems in graph coloring problems with connections to extremal combinatorics. Ann. Appl. Probab. 27 337–394.

3. Diaconis, P. and Mosteller, F. (1989). Methods for studying coincidences. J. Amer. Statist. Assoc. 84 853–861.

4. Barbour, A. D., Holst, L. and Janson, S. (1992). Poisson Approximation. Oxford Studies in Probability 2. The Clarendon Press, Oxford University Press, New York.

5. ARRATIA, R., GOLDSTEIN, L. and KOCHMAN, F. (2019). Size bias for one and all. Probab. Surv. 16 1–61.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On card guessing with two types of cards;Journal of Statistical Planning and Inference;2024-09

2. On card guessing games: Limit law for no feedback one-time riffle shuffle;Advances in Applied Mathematics;2024-05