On importance sampling with mixtures for random walks with heavy tails

Details On importance sampling with mixtures for random walks with heavy tails On importance sampling with mixtures for random walks with heavy tails

2009-09-17

arxiv.org/abs/0909.3333v1

Mathematics

Probability

Scientific paper

Importance sampling algorithms for heavy-tailed random walks are considered. Using a specification with algorithms based on mixtures of the original distribution with some other distribution, sufficient conditions for obtaining bounded relative error are presented. It is proved that mixture algorithms of this kind can achieve asymptotically optimal relative error. Some examples of mixture algorithms are presented, including mixture algorithms using a scaling of the original distribution, and the bounds of the relative errors are calculated. The algorithms are evaluated numerically in a simple setting.

Affiliated with

Also associated with

No associations

Rating

On importance sampling with mixtures for random walks with heavy tails does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On importance sampling with mixtures for random walks with heavy tails, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On importance sampling with mixtures for random walks with heavy tails will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-276127