How to generate uniform samples on discrete sets using the splitting method
From MaRDI portal
Publication:3585151
Recommendations
- Randomized algorithms with splitting: Why the classic randomized algorithms do not work and how to make them work
- On the use of smoothing to improve the performance of the splitting method
- Discrete hit-and-run for sampling points from arbitrary distributions over subsets of integer hyperrectangles
- The splitting method for decision making
- Exact sampling with highly uniform point sets
Cites work
- scientific article; zbMATH DE number 5070674 (Why is no real title available?)
- scientific article; zbMATH DE number 2117227 (Why is no real title available?)
- A Two-Step Branching Splitting Model Under Cost Constraint for Rare Event Analysis
- An efficient algorithm for rare-event probability estimation, combinatorial optimization, and counting
- Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
- Randomized algorithms with splitting: Why the classic randomized algorithms do not work and how to make them work
- Rare events, splitting, and quasi-Monte Carlo
- Simulation and the Monte Carlo Method
- The Gibbs cloner for combinatorial optimization, counting and sampling
- The cross-entropy method for combinatorial and continuous optimization
Cited in
(4)
This page was built for publication: How to generate uniform samples on discrete sets using the splitting method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3585151)