Algorithms for Generating Small Random Samples
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866916557469253632 |
|---|---|
| author | Cicirello, Vincent A. |
| author_facet | Cicirello, Vincent A. |
| contents | We present algorithms for generating small random samples without replacement. We consider two cases. We present an algorithm for sampling a pair of distinct integers, and an algorithm for sampling a triple of distinct integers. The worst-case runtime of both algorithms is constant, while the worst-case runtimes of common algorithms for the general case of sampling $k$ elements from a set of $n$ increase with $n$. Java implementations of both algorithms are included in the open source library $ρμ$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_12371 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Algorithms for Generating Small Random Samples Cicirello, Vincent A. Data Structures and Algorithms Discrete Mathematics Probability 68Q25, 68Q87, 68W20, 68W40, 60-04 F.2.1; I.1.2; D.2.13; G.3; G.4 We present algorithms for generating small random samples without replacement. We consider two cases. We present an algorithm for sampling a pair of distinct integers, and an algorithm for sampling a triple of distinct integers. The worst-case runtime of both algorithms is constant, while the worst-case runtimes of common algorithms for the general case of sampling $k$ elements from a set of $n$ increase with $n$. Java implementations of both algorithms are included in the open source library $ρμ$. |
| title | Algorithms for Generating Small Random Samples |
| topic | Data Structures and Algorithms Discrete Mathematics Probability 68Q25, 68Q87, 68W20, 68W40, 60-04 F.2.1; I.1.2; D.2.13; G.3; G.4 |
| url | https://arxiv.org/abs/2405.12371 |