Take a sneak peek at the new NIST.gov and let us know what you think!
(Please note: some content may not be complete on the beta site.).
NIST Authors in Bold
|Author(s):||David G. Harris; Francis Sullivan; Isabel M. Beichl;|
|Title:||Linear Algebra and Sequential Importance Ssampling for Network Reliability|
|Published:||December 11, 2011|
|Abstract:||The reliability polynomial of a graph gives the probability that a graph is connected as a function of the probability that each edge is connected. The coefficients of the reliability polynomial count the number of connected subgraphs of various sizes. Algorithms based on sequential importance sampling (SIS) have been proposed to estimate a graph‰s reliability polynomial. We develop a new bottom-up SIS algorithm for estimating the reliability polynomial by choosing a spanning tree and adding edges. This algorithm improves on existing bottom-up algorithms in that it has lower complexity O(E2V) as opposed to O(EV3), and it uses importance sampling to reduce variance.|
|Proceedings:||Winter Simulation Conference|
|Pages:||pp. 3344 - 3352|
|Dates:||December 11-14, 2011|
|Keywords:||Monte Carlo methods, reliability, reliabilty polynomial, importance sampling|
|PDF version:||Click here to retrieve PDF version of paper (124KB)|