Dynamic generation of discrete random variates
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 437561
- Fast algorithms for generating discrete random variates with changing distributions
- Maintaining discrete probability distributions optimally
- Efficient sampling methods for discrete distributions
- Dynamic sampling from a discrete probability distribution with a known distribution of rates
Cited in
(18)- Discrete random variate generation using uniformization
- Generation of discrete random variables in scalable frameworks
- Dynamic sampling from a discrete probability distribution with a known distribution of rates
- Efficient sampling methods for discrete distributions
- Generating a random collection of discrete joint probability distributions subject to partial information
- scientific article; zbMATH DE number 437561 (Why is no real title available?)
- Algorithms for Generating Discrete Random Variables with a Given Generating Function or a Given Moment Sequence
- A method to reduce the rejection rate in Monte Carlo Markov chains
- scientific article; zbMATH DE number 1003234 (Why is no real title available?)
- Maintaining discrete probability distributions optimally
- scientific article; zbMATH DE number 218923 (Why is no real title available?)
- A nearly linear-time PTAS for explicit fractional packing and covering linear programs
- Fast algorithms for generating discrete random variates with changing distributions
- Practical algorithms for generating a random ordering of the elements of a weighted set
- Parallel Weighted Random Sampling
- scientific article; zbMATH DE number 7651215 (Why is no real title available?)
- Maintaining discrete probability distributions in practice
- Discretization-based direct random sample generation
This page was built for publication: Dynamic generation of discrete random variates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1405782)
