An Efficient Method for Weighted Sampling without Replacement

DOI10.1137/0209009zbMath0447.68040OpenAlexW2024910069MaRDI QIDQ3893303

No author found.

Publication date: 1980

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0209009

zbMATH Keywords

random number generationsweighted sampling without replacement

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Sampling theory, sample surveys (62D05)

Related Items (16)

Robust active learning with binary responses ⋮ Dynamic sampling from a discrete probability distribution with a known distribution of rates ⋮ Unnamed Item ⋮ Parallel Weighted Random Sampling ⋮ Synchronous parallel kinetic Monte Carlo for continuum diffusion-reaction systems ⋮ Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines ⋮ A quantitative study of pure parallel processes ⋮ Randomized Linear Programming Solves the Markov Decision Problem in Nearly Linear (Sometimes Sublinear) Time ⋮ Practical algorithms for generating a random ordering of the elements of a weighted set ⋮ A method to reduce the rejection rate in Monte Carlo Markov chains ⋮ Weighted sampling without replacement from data streams ⋮ Bounding the variance in Monte Carlo experiments ⋮ The Move-to-Front Rule: A Case Study for two Perfect Sampling Algorithms ⋮ Moment preserving constrained resampling with applications to particle-in-cell methods ⋮ A general result for selecting balanced unequal probability samples from a stream ⋮ Weighted random sampling with a reservoir

This page was built for publication: An Efficient Method for Weighted Sampling without Replacement