Graph reliability evaluation via random $K$-out-of-$N$ systems

TL;DR

This paper models network failure in simple connected undirected graphs using random K-out-of-N systems, deriving recurrence relations to evaluate graph reliability based on edge failures.

Contribution

It introduces a novel approach linking graph reliability to random K-out-of-N systems, providing recurrence relations for analyzing edge failure impacts.

Findings

Derived recurrence relations for graph reliability

Linked graph failure analysis to K-out-of-N system theory

Analyzed specific graph cases and examples

Abstract

The present study was concerned with network failure problems for simple connected undirected graphs. A connected graph becomes unconnected through edge failure, under the assumptions that only edges can fail and each edge has an identical failure distribution. The main purpose of the present study was to show recurrent relations with respect to the number of edges in graph generation procedures. To this end, simple connected undirected graphs were correlated to random $K$-out-of-$N$ systems, and key features of such systems were applied. In addition, some simple graph cases and examples were analyzed.