Abstract
Let (Xn:n ges 0) be a sequence of iid rv's with mean zero and finite variance. We describe an efficient state-dependent importance sampling algorithm for estimating the tail of Sn = X1 + ... + Xn in a large deviations framework as n - infin. Our algorithm can be shown to be strongly efficient basically throughout the whole large deviations region as n - infin (in particular, for probabilities of the form P (Sn > kn) as k > 0). The techniques combine results of the theory of large deviations for sums of regularly varying distributions and the basic ideas can be applied to other rare-event simulation problems involving both light and heavy-tailed features
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.