On Monte Carlo Estimates in Network Reliability
- 1 April 1994
- journal article
- research article
- Published by Cambridge University Press (CUP) in Probability in the Engineering and Informational Sciences
- Vol. 8 (2) , 245-264
- https://doi.org/10.1017/s0269964800003387
Abstract
The paper considers representations of network reliability measures as the mean value of a random variable defined on the trajectories of a certain Markov process and investigates utility of such formulae for Monte Carlo (MC) estimating. Such an MC estimator is called (ε,δ)-polynomial if its relative error is less than ε with probability >1 – δ, for any sample size equal to or greater than a polynomial of ε-1, δ-1, and the size of the network. One of the main results: The suggested MC estimator for the disconnectedness probability of a multiterminal network is (ε,δ)-polynomial, under a certain natural condition on the edge failure probabilities. The method applies also to estimating the percolation critical point and certain equilibrium characteristics of renewal networks.Keywords
This publication has 7 references indexed in Scilit:
- An Evolution Model for Monte Carlo Estimation of Equilibrium Network Renewal ParametersProbability in the Engineering and Informational Sciences, 1992
- Estimation of network reliability using graph evolution modelsIEEE Transactions on Reliability, 1991
- PercolationPublished by Springer Nature ,1989
- A monte carlo sampling plan for estimating reliability parameters and related functionsNetworks, 1987
- The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n‐BondsNetworks, 1975
- Combinatorial Algebra and Random GraphsTheory of Probability and Its Applications, 1969
- Edge-Disjoint Spanning Trees of Finite GraphsJournal of the London Mathematical Society, 1961