pith. sign in

arxiv: 1306.5417 · v2 · pith:DIHSZYHBnew · submitted 2013-06-23 · 📊 stat.AP · stat.CO

Monte Carlo for estimating exponential convolution

classification 📊 stat.AP stat.CO
keywords estimatingcarloestimationmonteproblemwhenaddressalgorithm
0
0 comments X
read the original abstract

In this note we study the numerical stability problem that may take place when calculating the cumulative distribution function of the {\it Hypoexponential} random variable. This computation is extensively used during the execution of Monte Carlo network reliability estimation algorithms. In spite of the fact that analytical formulas are available, they can be unstable in practice. This instability occurs frequently when estimating very small failure probabilities $(10^{-30}-10^{-40})$ that can happen for example while estimating the unreliability of telecommunication systems. In order to address this problem, we propose a simple unbiased estimation algorithm that is capable of handling a large number of variables. We show that the proposed estimator has a bounded relative error and that it compares favorably with other existing methods.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.