On Lyapunov Inequalities and Subsolutions for Efficient Importance Sampling

DOI10.1145/2331140.2331141zbMATH Open1490.62211OpenAlexW2098251485MaRDI QIDQ4635191FDOQ4635191

Jose Blanchet, Peter W. Glynn, Kevin Leder

Publication date: 16 April 2018

Published in: ACM Transactions on Modeling and Computer Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2331140.2331141

zbMATH Keywords

importance samplingvariance reductionrare eventsIsaacs equationLyapunov inequalitiestandem queue network

Mathematics Subject Classification ID

Markov processes: estimation; hidden Markov models (62M05) Queues and service in operations research (90B22) Sums of independent random variables; random walks (60G50)

Cited In (11)

• Adaptive importance sampling in least-squares Monte Carlo algorithms for backward stochastic differential equations
• Excessive backlog probabilities of two parallel queues
• Importance Sampling for Metastable and Multiscale Dynamical Systems
• Infinite swapping using IID samples
• Rare Event Simulation Using Reversible Shaking Transformations
• Nonasymptotic performance analysis of importance sampling schemes for small noise diffusions
• Importance sampling for a simple Markovian intensity model using subsolutions
• Moderate deviations for recursive stochastic algorithms
• Moderate deviation principles for importance sampling estimators of risk measures
• Moderate deviations-based importance sampling for stochastic recursive equations
• The sample size required in importance sampling

This page was built for publication: On Lyapunov Inequalities and Subsolutions for Efficient Importance Sampling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635191)