Hostname: page-component-7b7567c8c-47w2l Total loading time: 0 Render date: 2026-11-15T23:32:29.247Z Has data issue: false hasContentIssue false

Automated State-Dependent Importance Sampling for Markov Jump Processes via Sampling from the Zero-Variance Distribution

Published online by Cambridge University Press:  30 January 2018

Adam W. Grace*
Affiliation:
The University of Queensland
Dirk P. Kroese*
Affiliation:
University of Derby
Werner Sandmann*
Affiliation:
University of Derby
*
∗ Postal address: School of Mathematics and Physics, The University of Queensland, Brisbane 4072, QLD, Australia.
∗ Postal address: School of Mathematics and Physics, The University of Queensland, Brisbane 4072, QLD, Australia.
∗∗∗ Postal address: School of Computing and Mathematics, University of Derby, Derby DE22 1GB, UK.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Many complex systems can be modeled via Markov jump processes. Applications include chemical reactions, population dynamics, and telecommunication networks. Rare-event estimation for such models can be difficult and is often computationally expensive, because typically many (or very long) paths of the Markov jump process need to be simulated in order to observe the rare event. We present a state-dependent importance sampling approach to this problem that is adaptive and uses Markov chain Monte Carlo to sample from the zero-variance importance sampling distribution. The method is applicable to a wide range of Markov jump processes and achieves high accuracy, while requiring only a small sample to obtain the importance parameters. We demonstrate its efficiency through benchmark examples in queueing theory and stochastic chemical kinetics.

Information

Type
Research Article
Copyright
© Applied Probability Trust