Estimation of Network Reliability Using Graph Evolution Models

M. Lomonosov, T. Elperin, I. Gertsbakh

Research output: Contribution to journalArticlepeer-review

121 Scopus citations


Monte Carlo techniques for estimating various net- work reliability characteristics, including terminal connectivity, are developed by assuming that edges are subject to failures with arbitrary probabilities and nodes are absolutely reliable. The core of our approach is introducing network time-evolution processes and using certain graph-theoretic machinery resulting in a considerable increase in accuracy for Monte Carlo estimates, especially for highly reliable networks. Simulation strategies and numerical results are presented and discussed.

Original languageEnglish
Pages (from-to)572-581
Number of pages10
JournalIEEE Transactions on Reliability
Issue number5
StatePublished - 1 Jan 1991


  • Graph evolution
  • Kruskal algorithm
  • Lifetime
  • Monte Carlo
  • Spanning tree
  • Terminal reliability
  • method
  • simulation

ASJC Scopus subject areas

  • Safety, Risk, Reliability and Quality
  • Electrical and Electronic Engineering


Dive into the research topics of 'Estimation of Network Reliability Using Graph Evolution Models'. Together they form a unique fingerprint.

Cite this