Counting with Combined Splitting and Capture–Recapture Methods

DOI10.1080/15326349.2012.699761zbMath1254.65010arXiv1103.6096OpenAlexW2128908168MaRDI QIDQ3167896

Radislav Vaisman, Ad Ridder, Paul Dupuis, Reuven Y. Rubinstein, Bahar Kaynar

Publication date: 29 October 2012

Published in: Stochastic Models (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1103.6096

zbMATH Keywords

algorithmnumerical examplesrandom graphssplittingcountingGibbs samplercapture-recapture3-SATsatisfiability problem (SAT)binary contingency tables

Mathematics Subject Classification ID

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

Cites Work

• An efficient algorithm for rare-event probability estimation, combinatorial optimization, and counting
• The complexity of computing the permanent
• A combined splitting-cross entropy method for rare-event probability estimation of queueing networks
• Efficient Monte Carlo simulation via the generalized splitting method
• Inference from iterative simulation using multiple sequences
• Randomized algorithms with splitting: Why the classic randomized algorithms do not work and how to make them work
• Multilevel Splitting for Estimating Rare Event Probabilities
• 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
• Theory and Applications of Satisfiability Testing
• Sequential Monte Carlo Methods for Statistical Analysis of Tables

This page was built for publication: Counting with Combined Splitting and Capture–Recapture Methods