Analysis of an importance sampling estimator for tandem queues
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Importance sampling for sums of random variables with regularly varying tails
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Fluid heuristics, Lyapunov bounds and efficient importance sampling for a heavy-tailed G/G/1 queue
Queueing Systems: Theory and Applications
Subsolutions of an Isaacs Equation and Efficient Schemes for Importance Sampling
Mathematics of Operations Research
Importance sampling for Jackson networks
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
Importance sampling in the setting of heavy tailed random variables has generally focused on models with additive noise terms. In this work we extend this concept by considering importance sampling for the estimation of rare events in Markov chains of the form Xn+1 = An+1Xn+Bn+1; X0 = 0; where the Bn's and An's are independent sequences of independent and identically distributed (i.i.d.) random variables and the Bn's are regularly varying and the An's are suitably light tailed relative to Bn. We focus on efficient estimation of the rare event probability P(Xn b) as b ↗ ∞. In particular we present a strongly efficient importance sampling algorithm for estimating these probabilities, and present a numerical example showcasing the strong efficiency.