Consistent Sampling with Replacement

08/29/2018
by   Ronald L. Rivest, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/01/2019

Parallel Weighted Random Sampling

Data structures for efficient sampling from a set of weighted items are ...
research
02/20/2018

Stability of items: an experimental test

The words of a language are randomly replaced in time by new ones, but l...
research
06/18/2020

Neutralizing Self-Selection Bias in Sampling for Sortition

Sortition is a political system in which decisions are made by panels of...
research
03/14/2019

Stochastic Beams and Where to Find Them: The Gumbel-Top-k Trick for Sampling Sequences Without Replacement

The well-known Gumbel-Max trick for sampling from a categorical distribu...
research
02/28/2015

Analysis of Crowdsourced Sampling Strategies for HodgeRank with Sparse Random Graphs

Crowdsourcing platforms are now extensively used for conducting subjecti...
research
04/11/2021

Simple, Optimal Algorithms for Random Sampling Without Replacement

Consider the fundamental problem of drawing a simple random sample of si...
research
10/17/2016

Efficient Random Sampling - Parallel, Vectorized, Cache-Efficient, and Online

We consider the problem of sampling n numbers from the range {1,...,N} w...

Please sign up or login with your details

Forgot password? Click here to reset