IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v53y2024i3p1024-1034.html
   My bibliography  Save this article

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

Author

Listed:
  • Hiroaki Mohri
  • Jun-ichi Takeshita

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.

Suggested Citation

  • Hiroaki Mohri & Jun-ichi Takeshita, 2024. "Graph reliability evaluation via random K-out-of-N systems," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 53(3), pages 1024-1034, February.
    • Handle: RePEc:taf:lstaxx:v:53:y:2024:i:3:p:1024-1034
    DOI: 10.1080/03610926.2022.2099897
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2022.2099897
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03610926.2022.2099897?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:lstaxx:v:53:y:2024:i:3:p:1024-1034. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.