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

被引：0

作者：

Mohri, Hiroaki ^{[1
]}

Takeshita, Jun-ichi ^{[2
]}

机构：

[1] Waseda Univ, Fac Commerce, Shinjuku Ku, Tokyo, Japan

[2] Natl Inst Adv Ind Sci & Technol, Res Inst Sci Safety & Sustainabil, Tsukuba, Ibaraki, Japan

来源：

COMMUNICATIONS IN STATISTICS-THEORY AND METHODS | 2024年 / 53卷 / 03期

关键词：

Reliability; networks; random K-out-of-N systems; recursive relations; applied stochastic processes;

D O I：

10.1080/03610926.2022.2099897

中图分类号：

O21 [概率论与数理统计]; C8 [统计学];

学科分类号：

020208 ; 070103 ; 0714 ;

摘要：

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.

引用

页码：1024 / 1034

页数：11