Path-ZVA: general, efficient, and automated importance sampling for highly reliable Markovian systems
DOI10.1145/3161569zbMATH Open1542.60002MaRDI QIDQ6583733FDOQ6583733
Authors: Daniël Reijsbergen, Pieter-Tjerk de Boer, Werner R. W. Scheinhardt, S. Juneja 
Publication date: 6 August 2024
Published in: ACM Transactions on Modeling and Computer Simulation (Search for Journal in Brave)
Recommendations
- Fast simulation of Markov chains with small transition probabilities
- Importance Sampling for the Simulation of Highly Reliable Markovian Systems
- Approximating zero-variance importance sampling in a reliability setting
- Fast simulation of rare events in queueing and reliability models
- The cross-entropy method with patching for rare-event simulation of large Markov chains
Computational methods for problems pertaining to probability theory (60-08) Statistical ranking and selection procedures (62F07) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
This page was built for publication: Path-ZVA: general, efficient, and automated importance sampling for highly reliable Markovian systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6583733)
