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

Hiroaki Mohri; Jun ichi Takeshita

doi:10.1080/03610926.2022.2099897

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

Hiroaki Mohri, Jun ichi Takeshita^*

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Journal	Communications in Statistics - Theory and Methods
DOIs	https://doi.org/10.1080/03610926.2022.2099897
Publication status	Accepted/In press - 2022
Externally published	Yes

Keywords

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

ASJC Scopus subject areas

Statistics and Probability

Access to Document

10.1080/03610926.2022.2099897

Cite this

@article{b54e509e025c4d32bafa9c5c2408d3a1,

title = "Graph reliability evaluation via random K-out-of-N systems",

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.",

keywords = "Reliability, applied stochastic processes, networks, random K-out-of-N systems, recursive relations",

author = "Hiroaki Mohri and Takeshita, {Jun ichi}",

note = "Publisher Copyright: {\textcopyright} 2022 Taylor & Francis Group, LLC.",

year = "2022",

doi = "10.1080/03610926.2022.2099897",

language = "English",

journal = "Communications in Statistics - Theory and Methods",

issn = "0361-0926",

publisher = "Taylor and Francis Ltd.",

}

TY - JOUR

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

AU - Mohri, Hiroaki

AU - Takeshita, Jun ichi

PY - 2022

Y1 - 2022

N2 - 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.

AB - 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.

KW - Reliability

KW - applied stochastic processes

KW - networks

KW - random K-out-of-N systems

KW - recursive relations

UR - http://www.scopus.com/inward/record.url?scp=85134239516&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85134239516&partnerID=8YFLogxK

U2 - 10.1080/03610926.2022.2099897

DO - 10.1080/03610926.2022.2099897

M3 - Article

AN - SCOPUS:85134239516

SN - 0361-0926

JO - Communications in Statistics - Theory and Methods

JF - Communications in Statistics - Theory and Methods

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this