IDEAS home Printed from https://ideas.repec.org/a/sae/risrel/v235y2021i6p1057-1071.html
   My bibliography  Save this article

Exploiting structural similarity in network reliability analysis using graph learning

Author

Listed:
  • Ping Zhang
  • Min Xie
  • Xiaoyan Zhu

Abstract

Considering the large-scale networks that can represent construction of components in a unit, a transportation system, a supply chain, a social network system, and so on, some nodes have similar topological structures and thus play similar roles in the network and system analysis, usually complicating the analysis and resulting in considerable duplicated computations. In this paper, we present a graph learning approach to define and identify structural similarity between the nodes in a network or the components in a network system. Based on the structural similarity, we investigate component clustering at various significance levels that represent different extents of similarity. We further specify a spectral-graph-wavelet based graph learning method to measure the structural similarity and present its application in easing computation load of evaluating system survival signature and system reliability. The numerical examples and the application show the insights of structural similarity and effectiveness of the graph learning approach. Finally, we discuss potential applications of the graph-learning based structural similarity and conclude that the proposed structural similarity, component clustering, and graph learning approach are effective in simplifying the complexity of the network systems and reducing the computational cost for complex network analysis.

Suggested Citation

  • Ping Zhang & Min Xie & Xiaoyan Zhu, 2021. "Exploiting structural similarity in network reliability analysis using graph learning," Journal of Risk and Reliability, , vol. 235(6), pages 1057-1071, December.
  • Handle: RePEc:sae:risrel:v:235:y:2021:i:6:p:1057-1071
    DOI: 10.1177/1748006X211009329
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1748006X211009329
    Download Restriction: no

    File URL: https://libkey.io/10.1177/1748006X211009329?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
    ---><---

    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:sae:risrel:v:235:y:2021:i:6:p:1057-1071. 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: SAGE Publications (email available below). General contact details of provider: .

    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.