Markov chain Monte Carlo for computing rare-event probabilities for a heavy-tailed random walk
From MaRDI portal
Publication:5169731
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.
Recommendations
- Rare-event simulation of heavy-tailed random walks by sequential importance sampling and resampling
- A sequential Monte Carlo approach to computing tail probabilities in stochastic models
- State-independent importance sampling for random walks with regularly varying increments
- Efficient importance sampling for Monte Carlo evaluation of exceedance probabilities
- Markov chain importance sampling with applications to rare event probability estimation
Cites work
- scientific article; zbMATH DE number 840151 (Why is no real title available?)
- Applied Probability and Queues
- Asymptotic Behavior of the Gibbs Sampler
- Efficient rare event simulation for heavy-tailed compound sums
- General Irreducible Markov Chains and Non-Negative Operators
- Improved algorithms for rare event simulation with heavy tails
- Large deviations and importance sampling for a tandem network with slow-down
- Large deviations for random walks under subexponentiality: The big-jump domain
- Large deviations of heavy-tailed random sums with applications in insurance and finance
- Markov chains and stochastic stability
- Markov chains for exploring posterior distributions. (With discussion)
- Minorization Conditions and Convergence Rates for Markov Chain Monte Carlo
- On importance sampling with mixtures for random walks with heavy tails
- On the Markov chain central limit theorem
- Rates of convergence of the Hastings and Metropolis algorithms
- Simulating heavy tailed processes using delayed hazard rate twisting
- Simulating normalizing constants: From importance sampling to bridge sampling to path sampling
- State-dependent importance sampling for regularly varying random walks
Cited in
(12)- Hastings-Metropolis algorithm on Markov chains for small-probability estimation
- Rare-event probability estimation with conditional Monte Carlo
- Rare-event simulation of heavy-tailed random walks by sequential importance sampling and resampling
- A sequential Monte Carlo approach to computing tail probabilities in stochastic models
- Efficient simulation and conditional functional limit theorems for ruinous heavy-tailed random walks
- A review of conditional rare event simulation for tail probabilities of heavy tailed random variables
- Markov chain importance sampling with applications to rare event probability estimation
- A dichotomy for sampling barrier-crossing events of random walks with regularly varying tails
- Efficient Rare-Event Simulation for Multiple Jump Events in Regularly Varying Random Walks and Compound Poisson Processes
- Inference and rare event simulation for stopped Markov processes via reverse-time sequential Monte Carlo
- MCMC design-based non-parametric regression for rare event. application to nested risk computations
- New efficient estimators in rare event simulation with heavy tails
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)