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

Reliability analysis of complex networks based on irredundant subset cut group

Author

Listed:
  • Vartika Sharma
  • Rajesh Mishra

Abstract

This paper presents a unified framework to analyze the performance of a complex network containing diversified link capacities with specified flow requirement in terms of Capacity Related Reliability (CRR). An efficient minimal cutset based methodology is proposed to enumerate irredundant subset cut groups (SCGs) to evaluate flow networks reliability. The proposed approach is a two-step process. The first step requires a prior knowledge of all minimal cutsets of the network along with an enumeration of all irredundant subsets of cutset group (SCG) from a cut matrix to block or allow a prescribed amount of flow. In the second step, the enumerated SCGs can be fed as input to any multi-variable inversion sum-of-disjoint-product (MVI-SDP) based reliability evaluation algorithm to obtain the CRR of the network. The versatility of the proposed approach is that a single framework can be used to evaluate all the reliability measures such as 2-terminal, k-terminal and all-terminal. Various benchmark networks available in literature have been used to analyze the performance of the proposed methodology in terms of complexity and time constraint.

Suggested Citation

  • Vartika Sharma & Rajesh Mishra, 2023. "Reliability analysis of complex networks based on irredundant subset cut group," Journal of Risk and Reliability, , vol. 237(4), pages 714-724, August.
    • Handle: RePEc:sae:risrel:v:237:y:2023:i:4:p:714-724
    DOI: 10.1177/1748006X221107764
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1748006X221107764
    Download Restriction: no
    File URL: https://libkey.io/10.1177/1748006X221107764?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
    ---><---

    References listed on IDEAS

    as
    1. Yi-Kuei Lin & Shin-Guang Chen, 2022. "An efficient searching method for minimal path vectors in multi-state networks," Annals of Operations Research, Springer, vol. 312(1), pages 333-344, May.
    2. Majid Forghani-elahabad & Nelson Kagan, 2019. "Reliability evaluation of a stochastic-flow network in terms of minimal paths with budget constraint," IISE Transactions, Taylor & Francis Journals, vol. 51(5), pages 547-558, May.
    3. Ding-Hsiang Huang & Cheng-Fu Huang & Yi-Kuei Lin, 2019. "Reliability Evaluation for a Stochastic Flow Network Based on Upper and Lower Boundary Vectors," Mathematics, MDPI, vol. 7(11), pages 1-12, November.
    4. Barabási, A.L & Jeong, H & Néda, Z & Ravasz, E & Schubert, A & Vicsek, T, 2002. "Evolution of the social network of scientific collaborations," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 311(3), pages 590-614.
    5. Gu, Yu & Fu, Xiao & Liu, Zhiyuan & Xu, Xiangdong & Chen, Anthony, 2020. "Performance of transportation network under perturbations: Reliability, vulnerability, and resilience," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 133(C).
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yeh, Cheng-Ta & Lin, Yi-Kuei & Yeng, Louis Cheng-Lu & Huang, Pei-Tzu, 2021. "Reliability evaluation of a multistate railway transportation network from the perspective of a travel agent," Reliability Engineering and System Safety, Elsevier, vol. 214(C).
    2. Xu, Xiangdong & Qu, Kai & Chen, Anthony & Yang, Chao, 2021. "A new day-to-day dynamic network vulnerability analysis approach with Weibit-based route adjustment process," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 153(C).
    3. Lemarchand, Guillermo A., 2012. "The long-term dynamics of co-authorship scientific networks: Iberoamerican countries (1973–2010)," Research Policy, Elsevier, vol. 41(2), pages 291-305.
    4. Ann Bostrom & Ragnar E. Löfstedt, 2003. "Communicating Risk: Wireless and Hardwired," Risk Analysis, John Wiley & Sons, vol. 23(2), pages 241-248, April.
    5. Lilian Cervo Cabrera & Carlos Eduardo Caldarelli & Marcia Regina Gabardo Camara, 2020. "Mapping collaboration in international coffee certification research," Scientometrics, Springer;Akadémiai Kiadó, vol. 124(3), pages 2597-2618, September.
    6. de Oliveira, Thaiane Moreira & de Albuquerque, Sofia & Toth, Janderson Pereira & Bello, Debora Zava, 2018. "International cooperation networks of the BRICS bloc," SocArXiv b6x43, Center for Open Science.
    7. Kurmankhojayev, Daniyar & Li, Guoyuan & Chen, Anthony, 2024. "Link criticality index: Refinement, framework extension, and a case study," Reliability Engineering and System Safety, Elsevier, vol. 243(C).
    8. Peng Liu & Haoxiang Xia, 2015. "Structure and evolution of co-authorship network in an interdisciplinary research field," Scientometrics, Springer;Akadémiai Kiadó, vol. 103(1), pages 101-134, April.
    9. Xinyuan Chen & Ruyang Yin & Qinhe An & Yuan Zhang, 2021. "Modeling a Distance-Based Preferential Fare Scheme for Park-and-Ride Services in a Multimodal Transport Network," Sustainability, MDPI, vol. 13(5), pages 1-14, March.
    10. Elias Carroni & Paolo Pin & Simone Righi, 2020. "Bring a Friend! Privately or Publicly?," Management Science, INFORMS, vol. 66(5), pages 2269-2290, May.
    11. Ali Nouri Qarahasanlou & Ali Zamani & Abbas Barabadi & Mahdi Mokhberdoran, 2021. "Resilience Assessment: A Performance-Based Importance Measure," Energies, MDPI, vol. 14(22), pages 1-16, November.
    12. Jin, Jiashun & Ke, Zheng Tracy & Luo, Shengming, 2024. "Mixed membership estimation for social networks," Journal of Econometrics, Elsevier, vol. 239(2).
    13. Kim, Jinseok & Diesner, Jana, 2015. "The effect of data pre-processing on understanding the evolution of collaboration networks," Journal of Informetrics, Elsevier, vol. 9(1), pages 226-236.
    14. Andreas Spitz & Emőke-Ágnes Horvát, 2014. "Measuring Long-Term Impact Based on Network Centrality: Unraveling Cinematic Citations," PLOS ONE, Public Library of Science, vol. 9(10), pages 1-12, October.
    15. Huan Chen & Lixin Tian & Minggang Wang & Zaili Zhen, 2017. "Analysis of the Dynamic Evolutionary Behavior of American Heating Oil Spot and Futures Price Fluctuation Networks," Sustainability, MDPI, vol. 9(4), pages 1-29, April.
    16. Georg Groh & Christoph Fuchs, 2011. "Multi-modal social networks for modeling scientific fields," Scientometrics, Springer;Akadémiai Kiadó, vol. 89(2), pages 569-590, November.
    17. Monfared, M.A.S. & Rezazadeh, Masoumeh & Alipour, Zohreh, 2022. "Road networks reliability estimations and optimizations: A Bi-directional bottom-up, top-down approach," Reliability Engineering and System Safety, Elsevier, vol. 222(C).
    18. Sameer Kumar & Kuru Ratnavelu, 2016. "Perceptions of Scholars in the Field of Economics on Co-Authorship Associations: Evidence from an International Survey," PLOS ONE, Public Library of Science, vol. 11(6), pages 1-18, June.
    19. Zhengzheng Pan, 2012. "Opinions and Networks: How Do They Effect Each Other," Computational Economics, Springer;Society for Computational Economics, vol. 39(2), pages 157-171, February.
    20. Chakraborty, Tanmoy & Tammana, Vihar & Ganguly, Niloy & Mukherjee, Animesh, 2015. "Understanding and modeling diverse scientific careers of researchers," Journal of Informetrics, Elsevier, vol. 9(1), pages 69-78.

    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:237:y:2023:i:4:p:714-724. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.