An Efficient Method for Weighted Sampling without Replacement

DOI10.1137/0209009MaRDI QIDQ3893303zbMATH OpenOpenAlexFDO

Authors

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

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

Cited in

(17)

• Weighted random sampling with a reservoir
• Bounding the variance in Monte Carlo experiments
• Robust active learning with binary responses
• Dynamic sampling from a discrete probability distribution with a known distribution of rates
• A general result for selecting balanced unequal probability samples from a stream
• Synchronous parallel kinetic Monte Carlo for continuum diffusion-reaction systems
• A method to reduce the rejection rate in Monte Carlo Markov chains
• Practical algorithms for generating a random ordering of the elements of a weighted set
• The Move-to-Front Rule: A Case Study for two Perfect Sampling Algorithms
• Weighted sampling without replacement from data streams
• Ancestral Gumbel-top-k sampling for sampling without replacement
• Parallel Weighted Random Sampling
• Randomized linear programming solves the Markov decision problem in nearly linear (sometimes sublinear) time
• Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines
• Sampling without compromising accuracy in adaptive data analysis
• Moment preserving constrained resampling with applications to particle-in-cell methods
• A quantitative study of pure parallel processes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3893303)