Network reliability

Jason I. Brown, Charles J. Colbourn

Research output: Chapter in Book/Report/Conference proceedingChapter

1 Scopus citations

Abstract

Network reliability measures the likelihood of overall network functionality (generally various kinds of connectivity) given the probabilities of individual edges functioning. This chapter considers the ramifications of the connection between Tutte polynomials and network reliability. • General model of reliability of graphs and a compact representation in terms of reliability polynomials. • Network operations for ojnnectedness of target vertex sets; all-terminal reliability is an evaluation of the Tutte polynomial. • Bounding the value of the reliability polynomial by computing and bounding its coefficients, primarily using the ccmbinatorial structure of the op erating or failed subgraphs. • Inequalities for the coefficients in various forms of the all-terminal reliability polynomial. • Analytic properties of reliability polynomials (location of roots, shape, and points of inflection). • The structure of most reliable graphs and average all-terminal reliability. • Extensions to directed graphs.

Original languageEnglish (US)
Title of host publicationHandbook of the Tutte Polynomial and Related Topics
PublisherCRC Press
Pages307-327
Number of pages21
ISBN (Electronic)9780429161612
ISBN (Print)9781482240627
DOIs
StatePublished - Jul 6 2022

ASJC Scopus subject areas

  • General Computer Science
  • General Mathematics

Fingerprint

Dive into the research topics of 'Network reliability'. Together they form a unique fingerprint.

Cite this