On importance sampling with mixtures for random walks with heavy tails

  • Authors:
  • Henrik Hult;Jens Svensson

  • Affiliations:
  • KTH Stockholm, Stockholm, Sweden;KTH Stockholm, Stockholm, Sweden

  • Venue:
  • ACM Transactions on Modeling and Computer Simulation (TOMACS)
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

State-dependent importance sampling algorithms based on mixtures are considered. The algorithms are designed to compute tail probabilities of a heavy-tailed random walk. The increments of the random walk are assumed to have a regularly varying distribution. Sufficient conditions for obtaining bounded relative error are presented for rather general mixture algorithms. Two new examples, called the generalized Pareto mixture and the scaling mixture, are introduced. Both examples have good asymptotic properties and, in contrast to some of the existing algorithms, they are very easy to implement. Their performance is illustrated by numerical experiments. Finally, it is proved that mixture algorithms of this kind can be designed to have vanishing relative error.