Speeding up computation of the reliability polynomial coefficients for a random graph

  • Authors:

  • A. S. Rodionov

  • Affiliations:

  • Institute of Computational Mathematics and Mathematical Geophysics, Siberian Branch, Russian Academy of Sciences, Novosibirsk, Russia

  • Venue:
  • Automation and Remote Control
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider the problem of computing the coefficients of the reliability polynomial (RP) for a random graph with reliable vertices and unreliable edges. To speed up the computation, we use the meaning of RP coefficients in one of its representations and prove vector relations over vectors of binomial coefficients.