Network reliability: Heading out on the highway

Jason I. Brown, Charles J. Colbourn, Danielle Cox, Christina Graves, Lucas Mol

Research output: Contribution to journalArticlepeer-review

23 Scopus citations


A variety of probabilistic notions of network reliability of graphs and digraphs have been proposed and studied since the early 1950s. Although grounded in the engineering and logistics of network design and analysis, the research also spans pure and applied mathematics, with connections to areas as diverse as combinatorics and graph theory, combinatorial enumeration, optimization, probability theory, real and complex analysis, algebraic topology, commutative algebra, the design and analysis of algorithms, and computational complexity. In this paper we describe the landscape of various notions of network reliability, the roads well traveled, and some that appear likely to lead to meaningful and important journeys.

Original languageEnglish (US)
Pages (from-to)146-160
Number of pages15
Issue number1
StatePublished - Jan 2021


  • coherent system
  • digraph
  • fixed point
  • graph
  • inflection point
  • matroid
  • network
  • optimal graph
  • reliability
  • reliability polynomial
  • root

ASJC Scopus subject areas

  • Information Systems
  • Computer Networks and Communications


Dive into the research topics of 'Network reliability: Heading out on the highway'. Together they form a unique fingerprint.

Cite this