Now showing items 1-1 of 1

  • Network Reliability, Simplicial Complexes, and Polynomial Roots 

    DeGagne, Corey (2020-04-02)
    Assume that the vertices of a graph G are always operational, but the edges of G fail independently with probability q ∈ [0, 1]. The all-terminal reliability of G is the probability that the resulting subgraph is connected. ...