Combinatorics of reliability Monte Carlo

Michael Lomonosov, Yoseph Shpungin

Research output: Contribution to journalArticlepeer-review

12 Scopus citations


We study one class of unbiased Monte Carlo estimators for system reliability, avoiding the rare event difficulty. This class is closely related to the system combinatorics and contains unique "extreme" members, having the minimum and maximum relative error. Some known Monte Carlo heuristics for network reliability, including fully polynomial cases, are of this type.

Original languageEnglish
Pages (from-to)329-343
Number of pages15
JournalRandom Structures and Algorithms
Issue number4
StatePublished - 1 Jan 1999


  • Closure
  • Monte Carlo
  • Rare event
  • Reliability
  • Trajectory

ASJC Scopus subject areas

  • Software
  • General Mathematics
  • Computer Graphics and Computer-Aided Design
  • Applied Mathematics


Dive into the research topics of 'Combinatorics of reliability Monte Carlo'. Together they form a unique fingerprint.

Cite this