Sampling with replacement until you’ve seen everything
( go to the article → https://www.johndcook.com/blog/2022/05/14/exhaustive-sampling/ )
Suppose you have a standard deck of 52 cards. You pull out a card, put it back in the deck, shuffle, and pull out another card. How long would you expect to do this until you’ve seen every card? Here’s a variation on the same problem. Suppose you’re a park ranger keeping data on tagged […]
The post Sampling with replacement until you’ve seen everything first appeared on John D. Cook.
May 14, 2022, 4:23 p.m.
You may be interested in:
Newest in: Combinatorics
-
Newest in: Computing
Elliptic curve addition formulas
Elliptic curve Diffie-Hellman key exchange
Chinese Remainder Theorem synthesis algorithm
-Newest in: Math
Regular solids and Monte Carlo integration
When there is only one group of a given size
-Newest in: Python
Cross-platform way to enter Unicode characters
PyTorch is Exceedingly Good for AI and Data Science Practice
-