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

Hiroaki Mohri, Jun ichi Takeshita*

*この研究の対応する著者

研究成果: Article査読

抄録

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.

本文言語English
ジャーナルCommunications in Statistics - Theory and Methods
DOI
出版ステータスAccepted/In press - 2022

ASJC Scopus subject areas

  • 統計学および確率

フィンガープリント

「Graph reliability evaluation via random K-out-of-N systems」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル