IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v28y2014i1d10.1007_s10878-014-9742-0.html
   My bibliography  Save this article

Bound and exact methods for assessing link vulnerability in complex networks

Author

Listed:
  • T. N. Dinh

    (Virginia Commonwealth University)

  • M. T. Thai

    (University of Florida
    Ton Duc Thang University)

  • H. T. Nguyen

    (Ton Duc Thang University)

Abstract

Assessing network systems for failures is critical to mitigate the risk and develop proactive responses. In this paper, we investigate devastating consequences of link failures in networks. We propose an exact algorithm and a spectral lower-bound on the minimum number of removed links to incur a significant level of disruption. Our exact solution can identify optimal solutions in both uniform and weighted networks through solving a well-constructed mixed integer program. Also, our spectral lower-bound derives from the Laplacian eigenvalues an estimation on the vulnerability of large networks that are intractable for exact methods. Through experiments on both synthetic and real-world networks, we demonstrate the efficiency of the proposed methods.

Suggested Citation

  • T. N. Dinh & M. T. Thai & H. T. Nguyen, 2014. "Bound and exact methods for assessing link vulnerability in complex networks," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 3-24, July.
    • Handle: RePEc:spr:jcomop:v:28:y:2014:i:1:d:10.1007_s10878-014-9742-0
    DOI: 10.1007/s10878-014-9742-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-014-9742-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-014-9742-0?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.

    References listed on IDEAS

    as
    1. Barabási, Albert-László & Albert, Réka & Jeong, Hawoong, 2000. "Scale-free characteristics of random networks: the topology of the world-wide web," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 281(1), pages 69-77.
    2. Alan T. Murray & Timothy C. Matisziw & Tony H. Grubesic, 2008. "A Methodological Overview of Network Vulnerability Analysis," Growth and Change, Wiley Blackwell, vol. 39(4), pages 573-592, December.
    3. Cristina Bazgan & Sonia Toubaline & Daniel Vanderpooten, 2013. "Critical edges/nodes for the minimum spanning tree problem: complexity and approximation," Journal of Combinatorial Optimization, Springer, vol. 26(1), pages 178-189, July.
    4. Réka Albert & Hawoong Jeong & Albert-László Barabási, 2000. "Error and attack tolerance of complex networks," Nature, Nature, vol. 406(6794), pages 378-382, July.
    5. Maarten Oosten & Jeroen H. G. C. Rutten & Frits C. R. Spieksma, 2007. "Disconnecting graphs by removing vertices: a polyhedral approach," Statistica Neerlandica, Netherlands Society for Statistics and Operations Research, vol. 61(1), pages 35-60, February.
    6. Tony H. Grubesic & Timothy C. Matisziw & Alan T. Murray & Diane Snediker, 2008. "Comparative Approaches for Assessing Network Vulnerability," International Regional Science Review, , vol. 31(1), pages 88-112, January.
    7. Cristina Bazgan & Sonia Toubaline & Daniel Vanderpooten, 2013. "Complexity of determining the most vital elements for the p-median and p-center location problems," Journal of Combinatorial Optimization, Springer, vol. 25(2), pages 191-207, February.
    8. Marco Di Summa & Andrea Grosso & Marco Locatelli, 2012. "Branch and cut algorithms for detecting critical nodes in undirected graphs," Computational Optimization and Applications, Springer, vol. 53(3), pages 649-680, December.
    9. Bing Su & Qingchuan Xu & Peng Xiao, 2008. "Finding the anti-block vital edge of a shortest path between two nodes," Journal of Combinatorial Optimization, Springer, vol. 16(2), pages 173-181, August.
    10. Stephen P. Borgatti, 2006. "Identifying sets of key players in a social network," Computational and Mathematical Organization Theory, Springer, vol. 12(1), pages 21-34, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Huiling Zhang & Yilin Shen & My T. Thai, 2016. "Robustness of power-law networks: its assessment and optimization," Journal of Combinatorial Optimization, Springer, vol. 32(3), pages 696-720, October.
    2. Foad Mahdavi Pajouh, 2020. "Minimum cost edge blocker clique problem," Annals of Operations Research, Springer, vol. 294(1), pages 345-376, November.

    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. Ningji Wei & Jose L. Walteros & Foad Mahdavi Pajouh, 2021. "Integer Programming Formulations for Minimum Spanning Tree Interdiction," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1461-1480, October.
    2. Alexander Veremyev & Oleg A. Prokopyev & Eduardo L. Pasiliao, 2014. "An integer programming framework for critical elements detection in graphs," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 233-273, July.
    3. Morton O’Kelly, 2015. "Network Hub Structure and Resilience," Networks and Spatial Economics, Springer, vol. 15(2), pages 235-251, June.
    4. Chen, Wei & Jiang, Manrui & Jiang, Cheng & Zhang, Jun, 2020. "Critical node detection problem for complex network in undirected weighted networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 538(C).
    5. Aybike Ulusan & Ozlem Ergun, 2018. "Restoration of services in disrupted infrastructure systems: A network science approach," PLOS ONE, Public Library of Science, vol. 13(2), pages 1-28, February.
    6. Hosseinali Salemi & Austin Buchanan, 2022. "Solving the Distance-Based Critical Node Problem," INFORMS Journal on Computing, INFORMS, vol. 34(3), pages 1309-1326, May.
    7. Foad Mahdavi Pajouh, 2020. "Minimum cost edge blocker clique problem," Annals of Operations Research, Springer, vol. 294(1), pages 345-376, November.
    8. Marco Di Summa & Syed Md Omar Faruk, 2023. "Critical node/edge detection problems on trees," 4OR, Springer, vol. 21(3), pages 439-455, September.
    9. Viljoen, Nadia M. & Joubert, Johan W., 2016. "The vulnerability of the global container shipping network to targeted link disruption," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 462(C), pages 396-409.
    10. López, Fernando A. & Páez, Antonio & Carrasco, Juan A. & Ruminot, Natalia A., 2017. "Vulnerability of nodes under controlled network topology and flow autocorrelation conditions," Journal of Transport Geography, Elsevier, vol. 59(C), pages 77-87.
    11. Jordán, Ferenc, 2022. "The network perspective: Vertical connections linking organizational levels," Ecological Modelling, Elsevier, vol. 473(C).
    12. Wei, Ningji & Walteros, Jose L., 2022. "Integer programming methods for solving binary interdiction games," European Journal of Operational Research, Elsevier, vol. 302(2), pages 456-469.
    13. Kashin Sugishita & Yasuo Asakura, 2021. "Vulnerability studies in the fields of transportation and complex networks: a citation network analysis," Public Transport, Springer, vol. 13(1), pages 1-34, March.
    14. Starita, Stefano & Scaparra, Maria Paola, 2016. "Optimizing dynamic investment decisions for railway systems protection," European Journal of Operational Research, Elsevier, vol. 248(2), pages 543-557.
    15. Cerqueti, Roy & Ferraro, Giovanna & Iovanella, Antonio, 2019. "Measuring network resilience through connection patterns," Reliability Engineering and System Safety, Elsevier, vol. 188(C), pages 320-329.
    16. Li Zeng & Changjun Fan & Chao Chen, 2023. "Leveraging Minimum Nodes for Optimum Key Player Identification in Complex Networks: A Deep Reinforcement Learning Strategy with Structured Reward Shaping," Mathematics, MDPI, vol. 11(17), pages 1-13, August.
    17. Zhong, Haonan & Mahdavi Pajouh, Foad & A． Prokopyev, Oleg, 2023. "On designing networks resilient to clique blockers," European Journal of Operational Research, Elsevier, vol. 307(1), pages 20-32.
    18. Zhang, Dayong & Men, Hao & Zhang, Zhaoxin, 2024. "Assessing the stability of collaboration networks: A structural cohesion analysis perspective," Journal of Informetrics, Elsevier, vol. 18(1).
    19. Balabhaskar Balasundaram & Sergiy Butenko & Illya V. Hicks, 2011. "Clique Relaxations in Social Network Analysis: The Maximum k -Plex Problem," Operations Research, INFORMS, vol. 59(1), pages 133-142, February.
    20. Iovanella, Antonio, 2024. "Exploiting network science in business process management: A conceptual framework," Chaos, Solitons & Fractals, Elsevier, vol. 178(C).

    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:spr:jcomop:v:28:y:2014:i:1:d:10.1007_s10878-014-9742-0. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.