Markov chain Monte Carlo for computing rare-event probabilities for a heavy-tailed random walk

From MaRDI portal
Publication:5169731

DOI10.1239/JAP/1402578630zbMATH Open1291.65014arXiv1211.2207OpenAlexW2962818685MaRDI QIDQ5169731FDOQ5169731


Authors: Thorbjörn Gudmundsson, Henrik Hult Edit this on Wikidata


Publication date: 11 July 2014

Published in: Journal of Applied Probability (Search for Journal in Brave)

Abstract: In this paper a method based on a Markov chain Monte Carlo (MCMC) algorithm is proposed to compute the probability of a rare event. The conditional distribution of the underlying process given that the rare event occurs has the probability of the rare event as its normalizing constant. Using the MCMC methodology a Markov chain is simulated, with that conditional distribution as its invariant distribution, and information about the normalizing constant is extracted from its trajectory. The algorithm is described in full generality and applied to the problem of computing the probability that a heavy-tailed random walk exceeds a high threshold. An unbiased estimator of the reciprocal probability is constructed whose normalized variance vanishes asymptotically. The algorithm is extended to random sums and its performance is illustrated numerically and compared to existing importance sampling algorithms.


Full work available at URL: https://arxiv.org/abs/1211.2207




Recommendations




Cites Work


Cited In (12)





This page was built for publication: Markov chain Monte Carlo for computing rare-event probabilities for a heavy-tailed random walk

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