论文信息 - Combinatorics of reliability Monte Carlo

Combinatorics of reliability Monte Carlo

We study one class of unbiased Monte Carlo estimators for system reliability, avoiding the rare event difficulty. This class is closely related to the system combinatorics and contains unique “extreme” members, having the minimum and maximum relative error. Some known Monte Carlo heuristics for network reliability, including fully polynomial cases, are of this type. ©1999 John Wiley & Sons, Inc. Random Struct. Alg., 14: 329–343, 1999

M. Lomonosov | Y. Shpungin

[1] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1967 .

[2] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[3] Malcolm C. Easton,et al. Sequential Destruction Method for Monte Carlo Evaluation of System Reliability , 1980, IEEE Transactions on Reliability.

[4] George S. Fishman,et al. A monte carlo sampling plan for estimating reliability parameters and related functions , 1987, Networks.

[5] Tov Elperin,et al. Estimation of network reliability using graph evolution models , 1991 .

[6] T. Elperin,et al. An Evolution Model for Monte Carlo Estimation of Equilibrium Network Renewal Parameters , 1992 .

[7] R. Rubinstein,et al. Regenerative rare events simulation via likelihood ratios , 1994, Journal of Applied Probability.

[8] M. Lomonosov. On Monte Carlo Estimates in Network Reliability , 1994, Probability in the Engineering and Informational Sciences.

[9] D. Karger,et al. Random sampling in graph optimization problems , 1995 .

[10] David R. Karger,et al. Implementing a fully polynomial time approximation scheme for all terminal network reliability , 1997, SODA '97.