A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
The reliability polynomial R(S,p) of a finite graph or hypergraph S=(V,E) gives the probability that the operational edges or hyperedges of S induce a connected spanning subgraph or subhypergraph, respectively, assuming that all (hyper)edges of S fail independently with an identical probability q=1-p. In this paper, we investigate the probability that the hyperedges of a hypergraph with randomly failing hyperedges induce a connected spanning subhypergraph. The computation of the reliability fordoi:10.1155/2018/3131087 fatcat:azmaf2lyubg4vdnnevwodhbug4