Efficient rare-event simulation for the maximum of heavy-tailed random walks
DOI10.1214/07-AAP485zbMath1147.60315arXiv0808.2731OpenAlexW1985912219MaRDI QIDQ939072
Jose H. Blanchet, Peter W. Glynn
Publication date: 20 August 2008
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0808.2731
random walksheavy-tailssingle-server queuerare-event simulationstate-dependent importance samplingchange-of-measureLyapunov bounds
Analysis of algorithms (68W40) Extreme value theory; extremal stochastic processes (60G70) Sums of independent random variables; random walks (60G50) Discrete-time Markov processes on general state spaces (60J05) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Markov chains and stochastic stability
- Importance sampling in the Monte Carlo study of sequential tests
- Large deviations results for subexponential tails, with applications to insurance risk
- Rare events simulation for heavy-tailed distributions
- Introduction to rare event simulation.
- Fluid heuristics, Lyapunov bounds and efficient importance sampling for a heavy-tailed \(G/G/1\) queue
- On the inefficiency of state-independent importance sampling in the presence of heavy tails
- Stochastic simulation: Algorithms and analysis
- On Probabilities of Large Deviations for Random Walks. I. Regularly Varying Distribution Tails
- Simulating heavy tailed processes using delayed hazard rate twisting
- Importance sampling for sums of random variables with regularly varying tails
- Efficient rare event simulation for heavy-tailed compound sums
- Importance Sampling, Large Deviations, and Differential Games
- Applied Probability and Queues
- Improved algorithms for rare event simulation with heavy tails
- Monte Carlo strategies in scientific computing