IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i19p3100-d1759705.html
   My bibliography  Save this article

Uncertainty-Driven Stability Analysis of Minimum Spanning Tree Under Multiple Risk Variations

Author

Listed:
  • Ahmad Hosseini

    (Centre for Information Technologies and Applied Mathematics, University of Nova Gorica, 5000 Nova Gorica, Slovenia
    School of Engineering and Management, University of Nova Gorica, 5000 Nova Gorica, Slovenia)

Abstract

The Minimum Spanning Tree (MST) problem addresses the challenge of identifying optimal network pathways for critical infrastructure systems, including transportation grids, communication backbones, power distribution networks, and reliability optimization frameworks. However, inherent uncertainties stemming from disruptive events demand robust analytical models for effective decision-making. This research introduces an uncertainty-theoretic framework to assess MST stability in uncertain network environments through novel constructs: lower set tolerance (LST) and dual lower set tolerance (DLST). Both LST and DLST provide quantifiable measures characterizing the resilience of element sets relative to edge-weighted MST configurations. LST captures the maximum simultaneous risk variation preserving current MST optimality, while DLST identifies the minimal variation required to invalidate it. We evaluate MST robustness by integrating uncertain reliability measures and risk factors, with emphasis on computational methods for set tolerance determination. To overcome computational hurdles in set tolerance derivation, we establish bounds and exact formulations within an uncertainty programming paradigm, offering enhanced efficiency compared with conventional re-optimization techniques.

Suggested Citation

  • Ahmad Hosseini, 2025. "Uncertainty-Driven Stability Analysis of Minimum Spanning Tree Under Multiple Risk Variations," Mathematics, MDPI, vol. 13(19), pages 1-20, September.
  • Handle: RePEc:gam:jmathe:v:13:y:2025:i:19:p:3100-:d:1759705
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/19/3100/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/13/19/3100/
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:gam:jmathe:v:13:y:2025:i:19:p:3100-:d:1759705. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.