IEEE Transactions on Circuits and Systems · 1979 · 130 citations · 11 references
EngineeringNetwork RobustnessNetwork AnalysisGraph RealizationsReliability EngineeringRandom GraphProbabilistic Graph TheoryNew TechniqueStatisticsSocial Network AnalysisProbabilistic SystemProbability TheoryComputer ScienceTerminal ReliabilityBayesian NetworksNew Analysis TechniqueNetwork ScienceGraph TheoryProbabilistic VerificationProbabilistic AnalysisBusiness
A new technique for determining the terminal reliability of probabilistic networks is derived and discussed. The technique uses set-theoretic concepts to partition the space of all graph realizations in a way which permits extremely fast evaluation of the source-to-terminal probability. If not allowed to run to completion, the algorithm yields rapidly converging upper and lower bounds on that probability. Comparison with algorithms in the recent literature shows a decrease of one or two orders of magnitude in required CPU time.
11