Consistent Sampling with Replacement
Data Structures and Algorithms
2018-08-31 v1
Abstract
We describe a very simple method for `consistent sampling' that allows for sampling with replacement. The method extends previous approaches to consistent sampling, which assign a pseudorandom real number to each element, and sample those with the smallest associated numbers. When sampling with replacement, our extension gives the item sampled a new, larger, associated pseudorandom number, and returns it to the pool of items being sampled.
Cite
@article{arxiv.1808.10016,
title = {Consistent Sampling with Replacement},
author = {Ronald L. Rivest},
journal= {arXiv preprint arXiv:1808.10016},
year = {2018}
}
Comments
7 pages