Succinct sampling from discrete distributions
From MaRDI portal
Recommendations
- Efficient sampling methods for discrete distributions
- Efficient sampling methods for discrete distributions
- Discretization-based direct random sample generation
- scientific article; zbMATH DE number 125289
- A discrete theory of irregular sampling
- Sampling from finite random partitions
- Sampling discretization and related problems
- The economical method for generating random samples from discrete distributions
- Sampling from binomial and Poisson distributions: a method with bounded computation times
- Dynamic sampling from a discrete probability distribution with a known distribution of rates
Cited in
(13)- A discrete theory of irregular sampling
- Dynamic sampling from a discrete probability distribution with a known distribution of rates
- Succinct indices for path minimum, with applications
- Efficient sampling methods for discrete distributions
- Efficient sampling methods for discrete distributions
- scientific article; zbMATH DE number 125289 (Why is no real title available?)
- Parallel Weighted Random Sampling
- Nearly Optimal Static Las Vegas Succinct Dictionary
- Independent range sampling, revisited
- Systematic alias sampling: an efficient and low-variance way to sample from a discrete distribution
- Time/space tradeoffs for generic attacks on delay functions
- Discretization-based direct random sample generation
- Distance-reducing Markov bases for sampling from a discrete sample space
This page was built for publication: Succinct sampling from discrete distributions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5495848)
