A Monte Carlo Sampling Plan for Estimating Network Reliability

DOI10.1287/OPRE.34.4.581MaRDI QIDQ3026106zbMATH OpenOpenAlexFDO

Authors George S. Fishman

Publication date 1986

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.34.4.581

zbMATH Keywords

variance reductionundirected networkMonte Carlo sampling plansworst-case bounds on sample sizes

Mathematics Subject Classification ID

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

Recommendations

• A Comparison of Four Monte Carlo Methods for Estimating the Probability of s-t Connectedness
• A monte carlo sampling plan for estimating reliability parameters and related functions
• Estimating the s − t Reliability Function Using Importance and Stratified Sampling
• scientific article; zbMATH DE number 3882183
• Evaluating Reliability of Stochastic Flow Networks

Cited in

(27)

• Search for all \(d\)-mincuts of a limited-flow network
• scientific article; zbMATH DE number 742895 (Why is no real title available?)
• Monte Carlo simulation with antithetic variable for reliability evaluation of \(k\)-out-of-\(n\) network models based on arcs and nodes
• The cross-entropy method for network reliability estimation
• Maximum flow and critical cutset as descriptors of multi-state systems with randomly capacitated components
• Static network reliability estimation under the Marshall-Olkin copula
• The Distribution of Maximum Flow with Applications to Multistate Reliability Systems
• THE TREE CUT AND MERGE ALGORITHM FOR ESTIMATION OF NETWORK RELIABILITY
• scientific article; zbMATH DE number 3882183 (Why is no real title available?)
• Wang-Landau sampling for estimation of the reliability of physical networks
• Fast computation of bounds for two-terminal network reliability
• M-C estimation algorithm for multistate network reliability based on fusion of hierarchical sampling and dynamic sampling
• scientific article; zbMATH DE number 2051227 (Why is no real title available?)
• Estimation of all-terminal network reliability using an artificial neural network
• Monte-Carlo algorithms for the planar multiterminal network reliability problem
• Finding the probability of infection in an SIR network is NP-hard
• A monte carlo sampling plan for estimating reliability parameters and related functions
• Efficient estimation of distance-dependent metrics in edge-failing networks
• A Highly Efficient Monte Carlo Method for Assessment of System Reliability Based on a Markov Model
• Fast sequential importance sampling to estimate the graph reliability polynomial
• A novel algorithm on network reliability estimation
• High-confidence estimation of small s-t reliabilities in directed acyclic networks
• Balanced and approximate zero-variance recursive estimators for the network reliability problem
• A Comparison of Four Monte Carlo Methods for Estimating the Probability of s-t Connectedness
• Degree-based approximations for network reliability polynomials
• Reliability of spare routing via intersectional minimal paths within budget and time constraints by simulation
• A new simulation method based on the RVR principle for the rare event network reliability problem

This page was built for publication: A Monte Carlo Sampling Plan for Estimating Network Reliability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3026106)