The Gibbs cloner for combinatorial optimization, counting and sampling

DOI10.1007/s11009-008-9101-7zbMath1177.65012OpenAlexW1966504569MaRDI QIDQ1041307

Reuven Y. Rubinstein

Publication date: 2 December 2009

Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11009-008-9101-7

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Combinatorial probability (60C05) Randomized algorithms (68W20)

Related Items (15)

Sequential Monte Carlo for counting vertex covers in general graphs ⋮ Some Recent Results in Rare Event Estimation ⋮ Combinatorial analysis of the adaptive last particle method ⋮ Model Counting of Monotone Conjunctive Normal Form Formulas with Spectra ⋮ Stochastic enumeration method for counting NP-hard problems ⋮ Simulation and estimation of extreme quantiles and extreme probabilities ⋮ A combined splitting-cross entropy method for rare-event probability estimation of queueing networks ⋮ The Splitting Method for Decision Making ⋮ Stochastic enumeration method for counting trees ⋮ Sequential Monte Carlo for rare event estimation ⋮ HOW TO GENERATE UNIFORM SAMPLES ON DISCRETE SETS USING THE SPLITTING METHOD ⋮ Concentration inequalities for mean field particle models ⋮ Randomized algorithms with splitting: Why the classic randomized algorithms do not work and how to make them work ⋮ Rare event simulation and splitting for discontinuous random variables ⋮ On the Use of Smoothing to Improve the Performance of the Splitting Method

Cites Work

• An efficient algorithm for rare-event probability estimation, combinatorial optimization, and counting
• Fair simulation
• Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
• Probability and Computing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Gibbs cloner for combinatorial optimization, counting and sampling