The Gibbs cloner for combinatorial optimization, counting and sampling
From MaRDI portal
Recommendations
- Entropy and Cloning Methods for Combinatorial Optimization, Sampling and Counting Using the Gibbs Sampler
- Optimizing random scan Gibbs samplers
- A Gibbs sampler on the \(n\)-simplex
- Gibbs sampler for statistical multiple alignment
- Adaptive simulated annealing: A near-optimal connection between sampling and counting
- scientific article; zbMATH DE number 6948153
- The generalized Gibbs sampler and the neigborhood sampler
- Simulating Markov Random Fields With a Conclique-Based Gibbs Sampler
- Generalised Gibbs sampler and multigrid Monte Carlo for Bayesian computation
Cites work
- An efficient algorithm for rare-event probability estimation, combinatorial optimization, and counting
- Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
- Fair simulation
- scientific article; zbMATH DE number 2106098 (Why is no real title available?)
- scientific article; zbMATH DE number 2117227 (Why is no real title available?)
- scientific article; zbMATH DE number 795109 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- Probability and Computing
Cited in
(16)- Randomized algorithms with splitting: Why the classic randomized algorithms do not work and how to make them work
- Combinatorial analysis of the adaptive last particle method
- Rare event simulation and splitting for discontinuous random variables
- Sequential Monte Carlo for counting vertex covers in general graphs
- On the use of smoothing to improve the performance of the splitting method
- Some recent results in rare event estimation
- Model counting of monotone conjunctive normal form formulas with spectra
- Stochastic enumeration method for counting NP-hard problems
- How to generate uniform samples on discrete sets using the splitting method
- Entropy and Cloning Methods for Combinatorial Optimization, Sampling and Counting Using the Gibbs Sampler
- The splitting method for decision making
- Stochastic enumeration method for counting trees
- Concentration inequalities for mean field particle models
- Simulation and estimation of extreme quantiles and extreme probabilities
- A combined splitting-cross entropy method for rare-event probability estimation of queueing networks
- Sequential Monte Carlo for rare event estimation
This page was built for publication: The Gibbs cloner for combinatorial optimization, counting and sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1041307)
