Efficient Simulation of Tail Probabilities of Sums of Dependent Random Variables


We study asymptotically optimal simulation algorithms for approximating the tail probability of P(e1 + · · · + ed > u) as u → ∞. The first algorithm proposed is based on Conditional Monte Carlo and assumes that (X1, . . . , Xd) has an elliptical distribution with very mild assumptions on the radial component. This algorithm is applicable to a large class of… (More)

2 Figures and Tables


  • Presentations referencing similar topics