Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T02:14:02.967Z Has data issue: false hasContentIssue false

Markov Chain Monte Carlo for Computing Rare-Event Probabilities for a Heavy-Tailed Random Walk

Published online by Cambridge University Press:  19 February 2016

Thorbjörn Gudmundsson*
Affiliation:
KTH Royal Institute of Technology
Henrik Hult*
Affiliation:
KTH Royal Institute of Technology
*
∗ Postal address: Department of Mathematics, KTH Royal Institute of Technology, SE-100 44, Stockholm, Sweden.
∗ Postal address: Department of Mathematics, KTH Royal Institute of Technology, SE-100 44, Stockholm, Sweden.
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.

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 the aforementioned 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.

Information

Type
Research Article
Copyright
© Applied Probability Trust