Efficient sampling methods for discrete distributions
From MaRDI portal
Recommendations
Cited in
(16)- On the efficiency of determinant sampling
- Dynamic sampling from a discrete probability distribution with a known distribution of rates
- Count-then-permute: a precision-free alternative to inversion sampling
- Efficient sampling methods for discrete distributions
- Bayesian shape clustering
- Heterogeneous subset sampling
- scientific article; zbMATH DE number 125289 (Why is no real title available?)
- scientific article; zbMATH DE number 1303578 (Why is no real title available?)
- \texttt{Sample(x)=(a*x<=t)} is a distinguisher with probability \(1/8\)
- Maintaining discrete probability distributions optimally
- Practical algorithms for generating a random ordering of the elements of a weighted set
- Density independent algorithms for sparsifying k-step random walks
- Randomized linear programming solves the Markov decision problem in nearly linear (sometimes sublinear) time
- Succinct sampling from discrete distributions
- Tree-packing revisited: faster fully dynamic min-cut and arboricity
- Discretization-based direct random sample generation
This page was built for publication: Efficient sampling methods for discrete distributions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2843242)