A Comparison of Four Monte Carlo Methods for Estimating the Probability of s-t Connectedness

DOI10.1109/TR.1986.4335388zbMath0592.62091MaRDI QIDQ3721656

George S. Fishman

Publication date: 1986

Published in: IEEE Transactions on Reliability (Search for Journal in Brave)

zbMATH Keywords

memory requirementsundirected networkMonte Carlo sampling plansbounds methoddagger samplingfailure-sets methods-t connectednesssequential destruction/construction

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Reliability, availability, maintenance, inspection in operations research (90B25) Circuits, networks (94C99) Reliability and life testing (62N05)

Related Items (8)

Practical sequential bounds for approximating two-terminal reliability ⋮ Reliability of spare routing via intersectional minimal paths within budget and time constraints by simulation ⋮ Reliability function of a class of time-dependent systems with standby redundancy ⋮ Search for all \(d\)-mincuts of a limited-flow network ⋮ Wang-Landau sampling for estimation of the reliability of physical networks ⋮ A new simulation method based on the RVR principle for the rare event network reliability problem ⋮ Spare parts allocation by improved genetic algorithm and Monte Carlo simulation ⋮ Balanced and Approximate Zero-Variance Recursive Estimators for the Network Reliability Problem

This page was built for publication: A Comparison of Four Monte Carlo Methods for Estimating the Probability of s-t Connectedness