Computing network reliability coefficients

MaRDI QIDQ3110122zbMATH OpenFDO

Authors

Publication date 26 January 2012

zbMATH Keywords

Monte Carlo Markov chainsnetwork reliabilitysequential importance sampling

Mathematics Subject Classification ID

Random walks on graphs (05C81) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Numerical analysis or methods applied to Markov chains (65C40) Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Combining monte carlo estimates and bounds for network reliability
• scientific article; zbMATH DE number 4083346
• Fast sequential importance sampling to estimate the graph reliability polynomial
• Monte Carlo and Markov Chain techniques for network reliability and sampling
• scientific article; zbMATH DE number 742895

Cited in

(1)

• Fast sequential importance sampling to estimate the graph reliability polynomial

This page was built for publication: Computing network reliability coefficients

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