Splitting for rare event simulation: analysis of simple cases
WSC '96 Proceedings of the 28th conference on Winter simulation
The theory of direct probability redistribution and its application to rare event simulation
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Estimating small cell-loss ratios in ATM switches via importance sampling
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Simulating GI/GI/1 queues and insurance risk processes with subexponential distributions
Proceedings of the 32nd conference on Winter simulation
Implementation of Importance Splitting Techniques in Stochastic Petri Net Package
TOOLS '00 Proceedings of the 11th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
Proceedings of the 34th conference on Winter simulation: exploring new frontiers
Simulating markov-reward processes with rare events
ACM Transactions on Modeling and Computer Simulation (TOMACS)
On the efficiency of RESTART for multidimensional state systems
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Limit theorems for the multilevel splitting algorithm in the simulation of rare events
WSC '05 Proceedings of the 37th conference on Winter simulation
Efficient heuristics for the simulation of population overflow in series and parallel queues
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Splitting with weight windows to control the likelihood ratio in importance sampling
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Splitting for rare-event simulation
Proceedings of the 38th conference on Winter simulation
Perwez Shahabuddin, 1962--2005: A professional appreciation
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Rare events, splitting, and quasi-Monte Carlo
ACM Transactions on Modeling and Computer Simulation (TOMACS)
ACM Transactions on Modeling and Computer Simulation (TOMACS)
An adaptive approach to accelerated evaluation of highly available services
ACM Transactions on Modeling and Computer Simulation (TOMACS)
A preliminary study of optimal splitting for rare-event simulation
Proceedings of the 40th Conference on Winter Simulation
Asymptotic robustness of estimators in rare-event simulation
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Application of the RESTART/Splitting technique to network resilience studies in NS2
MS '08 Proceedings of the 19th IASTED International Conference on Modelling and Simulation
A variant of importance splitting for rare event estimation: Fixed number of successes
ACM Transactions on Modeling and Computer Simulation (TOMACS)
RESTART simulation of networks of queues with Erlang service times
Winter Simulation Conference
The rare event simulation method RESTART: efficiency analysis and guidelines for its application
Network performance engineering
Multilevel splitting for reachability analysis of stochastic hybrid systems
Proceedings of the 2010 Conference on Grand Challenges in Modeling & Simulation
Sequential Monte Carlo for rare event estimation
Statistics and Computing
Analysis of an interacting particle method for rare event estimation
Queueing Systems: Theory and Applications
Static Network Reliability Estimation via Generalized Splitting
INFORMS Journal on Computing
Splitting for rare event simulation in biochemical systems
Proceedings of the 6th International ICST Conference on Simulation Tools and Techniques
Importance splitting for statistical model checking rare properties
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Automated rare event simulation for stochastic petri nets
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
Bayesian parameter inference for partially observed stopped processes
Statistics and Computing
| Hi-index | 0.00 |
We analyze the performance of a splitting technique for the estimation of rare event probabilities by simulation. A straightforward estimator of the probability of an event evaluates the proportion of simulated paths on which the event occurs. If the event is rare, even a large number of paths may produce little information about its probability using this approach. The method we study reinforces promising paths at intermediate thresholds by splitting them into subpaths which then evolve independently. If implemented appropriately, this has the effect of dedicating a greater fraction of the computational effort to informative runs. We analyze the method for a class of models in which, roughly speaking, the number of states through which each threshold can be crossed is bounded. Under additional assumptions, we identify the optimal degree of splitting at each threshold as the rarity of the event increases: It should be set so that the expected number of subpaths reaching each threshold remains roughly constant. Thus implemented, the method is provably effective in a sense appropriate to rare event simulations. These results follow from a branching-process analysis of the method. We illustrate our theoretical results with some numerical examples for queueing models.