Hostname: page-component-cd9895bd7-7cvxr Total loading time: 0 Render date: 2024-12-26T11:03:30.122Z Has data issue: false hasContentIssue false
  • English
  • Français

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

Part of: Markov processes Inference from stochastic processes

Published online by Cambridge University Press:  30 January 2018

Adam W. Grace ,
Dirk P. Kroese  and
Werner Sandmann
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.

Keywords

Importance samplingadaptiveautomatedimproved cross entropystate dependentzero-variance distributionMarkov jump processcontinuous-time Markov chainstochastic chemical kineticsqueueing system

MSC classification

Primary: 60J28: Applications of continuous-time Markov processes on discrete state spaces
Secondary: 62M05: Markov processes
Type
Research Article
Information
Journal of Applied Probability , Volume 51 , Issue 3 , September 2014 , pp. 741 - 755
Copyright
© Applied Probability Trust 

References

Asmussen, S. (1987). Applied Probability and Queues. John Wiley, Chichester.Google Scholar
Asmussen, S. and Glynn, P. W. (2007). Stochastic Simulation: Algorithms and Analysis. Springer, New York.Google Scholar
Blanchet, J. and Lam, H. (2012). State-dependent importance sampling for rare-event simulation: an overview and recent advances. Surveys Operat. Res. Manag. Sci. 17, 38–59.Google Scholar
Chan, J. C. C. and Kroese, D. P. (2012). Improved cross-entropy method for estimation. Statist. Comput. 22, 1031–1040.Google Scholar
Cohen, J. E. (1972). Markov population processes as models of primate social and population dynamics. Theoret. Pop. Biol. 3, 119–134.Google Scholar
Daigle, B. J. Jr., Roh, M. K., Gillespie, D. T. and Petzold, L. R. (2011). Automated estimation of rare event probabilities in biochemical systems. J. Chem. Phys. 134, 044110.Google Scholar
De Boer, P. T. and Nicola, V. F. (2002). Adaptive state-dependent importance sampling simulation of Markovian queueing networks. Europ. Trans. Telecommun. 13, 303–315.Google Scholar
Dupuis, P. and Wang, H. (2009). Importance sampling for Jackson networks. Queueing Systems 62, 113–157.Google Scholar
Dupuis, P., Sezer, A. D. and Wang, H. (2007). Dynamic importance sampling for queueing networks. Ann. Appl. Prob. 17, 1306–1346.Google Scholar
Gillespie, D. T. (1977). Exact stochastic simulation of coupled chemical reactions. J. Physical Chem. 81, 2340–2361.Google Scholar
Glynn, P. W. and Iglehart, D. L. (1989). Importance sampling for stochastic simulations. Manag. Sci. 35, 1367–1392.Google Scholar
Grace, A. W. and Wood, I. A. (2012). Approximating the tail of the Anderson–Darling distribution. Comput. Statist. Data Anal. 56, 4301–4311.Google Scholar
Heidelberger, P. (1995). Fast simulation of rare events in queuing and reliability models. ACM Trans. Modeling Comput. Simul. 5, 43–85.Google Scholar
Kroese, D. P., Taimre, T. and Botev, Z. I. (2011). Handbook of Monte Carlo Methods. John Wiley, Hoboken, NJ.Google Scholar
Kroese, D. P. and Nicola, V. F. (2002). Efficient simulation of a tandem Jackson network. ACM Trans. Modeling Comput. Simul. 12, 119–141.Google Scholar
Lovász, L. (1999). Hit-and-run mixes fast. Math. Programming 86, 443–461.Google Scholar
McQuarrie, D. A. (1967). Stochastic approach to chemical kinetics. J. Appl. Prob. 4, 413–478. (Correction: 5 (1968), 484–485.)Google Scholar
Nicola, V. F. and Zaburnenko, T. S. (2007). Efficient importance sampling heuristics for the simulation of population overflow in Jackson networks. ACM Trans. Modeling Comput. Simul. 17, 2, article 10.Google Scholar
Pearl, R. (1925). The Biology of Population Growth. Knopf, New York.Google Scholar
Pollett, P. K. and Vassallo, A. (1992). Diffusion approximations for some simple chemical reaction schemes. Adv. Appl. Prob. 24, 875–893.Google Scholar
Roh, M. K., Daigle, B. J. Jr., Gillespie, D. T. and Petzold, L. R. (2011). State-dependent doubly weighted stochastic simulation algorithm for automatic characterization of stochastic biochemical rare events. J. Chem. Phys. 135, 234108.Google Scholar
Rubinstein, R. Y. and Kroese, D. P. (2004). The Cross-Entropy Method. A Unified Approach to Combinatorial Optimization, Monte-Carlo Simulation, and Machine Learning. Springer, New York.Google Scholar
Smith, R. L. (1984). Efficient Monte Carlo procedures for generating points uniformly distributed over bounded regions. Operat. Res. 32, 1296–1308.Google Scholar
Smith, R. L. (1996). The hit-and-run sampler: a globally reaching Markov chain sampler for generating arbitrary multivariate distributions. In Proc. 28th Conf. Winter Simulation, IEEE, Washington, DC, pp. 260–264.Google Scholar
Van Kampen, N. G. (1992). Stochastic Processes in Physics and Chemistry. North Holland, Amsterdam.Google Scholar
Wolf, R. W. (1989). Stochastic Modeling and the Theory of Queues. Prentice Hall, Englewood Cliffs, NJ.Google Scholar