Academic Journals Database
Disseminating quality controlled scientific knowledge

Analysis of a splitting estimator for rare event probabilities in Jackson networks

ADD TO MY LIST
 
Author(s): Jose Blanchet | Kevin Leder | Yixi Shi

Journal: Stochastic Systems
ISSN 1946-5238

Volume: 1;
Issue: 2;
Start page: 306;
Date: 2011;
Original page

ABSTRACT
We consider a standard splitting algorithm for the rare-event simulation of overflow probabilities in any subset of stations in a Jackson network at level n, starting at a fixed initial position. It was shown in [8] that a subsolution to the Isaacs equation guarantees that a subexponential number of function evaluations (in n) suffices to estimate such overflow probabilities within a given relative accuracy. Our analysis here shows that in fact O(n2βV+1) function evaluations suffice to achieve a given relative precision, where βV is the number of bottleneck stations in the subset of stations under consideration in the network. This is the first rigorous analysis that favorably compares splitting against directly computing the overflow probability of interest, which can be evaluated by solving a linear system of equations with O(nd) variables.
Affiliate Program      Why do you need a reservation system?