A catch-all discrete distribution: Short description and main properties
Consider a population of size N where each element has an independent probability p of being a success. By sampling this population without replacement, how many elements need to be drawn to find all successes? This paper describes this discrete distribution, derives its main properties, and validat...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2025-12-01
|
| Series: | Examples and Counterexamples |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S2666657X25000230 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Consider a population of size N where each element has an independent probability p of being a success. By sampling this population without replacement, how many elements need to be drawn to find all successes? This paper describes this discrete distribution, derives its main properties, and validates the results through simulation. |
|---|---|
| ISSN: | 2666-657X |