HOW TO GENERATE UNIFORM SAMPLES ON DISCRETE SETS USING THE SPLITTING METHOD

DOI10.1017/S0269964810000057zbMath1196.60134OpenAlexW2050189340MaRDI QIDQ3585151

Andrey Dolgin, Radislav Vaisman, Reuven Y. Rubinstein, Peter W. Glynn

Publication date: 19 August 2010

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0269964810000057

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22)

Cites Work

• Unnamed Item
• Unnamed Item
• An efficient algorithm for rare-event probability estimation, combinatorial optimization, and counting
• The Gibbs cloner for combinatorial optimization, counting and sampling
• The cross-entropy method for combinatorial and continuous optimization
• Randomized algorithms with splitting: Why the classic randomized algorithms do not work and how to make them work
• Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
• Rare events, splitting, and quasi-Monte Carlo
• A Two-Step Branching Splitting Model Under Cost Constraint for Rare Event Analysis
• Simulation and the Monte Carlo Method