Rare event simulation for steady-state probabilities via recurrency cycles

2Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We develop a new algorithm for the estimation of rare event probabilities associated with the steady-state of a Markov stochastic process with continuous state space R d and discrete time steps (i.e., a discrete-time R d-valued Markov chain). The algorithm, which we coin Recurrent Multilevel Splitting (RMS), relies on the Markov chain's underlying recurrent structure, in combination with the Multilevel Splitting method. Extensive simulation experiments are performed, including experiments with a nonlinear stochastic model that has some characteristics of complex climate models. The numerical experiments show that RMS can boost the computational efficiency by several orders of magnitude compared to the Monte Carlo method.

Cite

CITATION STYLE

APA

Bisewski, K., Crommelin, D., & Mandjes, M. (2019). Rare event simulation for steady-state probabilities via recurrency cycles. Chaos, 29(3). https://doi.org/10.1063/1.5080296

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free