IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v373y2007icp861-873.html
   My bibliography  Save this article

How much spare capacity is necessary for the security of resource networks?

Author

Listed:
  • Zhao, Qian-Chuan
  • Jia, Qing-Shan
  • Cao, Yang

Abstract

The balance between the supply and demand of some kind of resource is critical for the functionality and security of many complex networks. Local contingencies that break this balance can cause a global collapse. These contingencies are usually dealt with by spare capacity, which is costly especially when the network capacity (the total amount of the resource generated/consumed in the network) grows. This paper studies the relationship between the spare capacity and the collapse probability under separation contingencies when the network capacity grows. Our results are obtained based on the analysis of the existence probability of balanced partitions, which is a measure of network security when network splitting is unavoidable. We find that a network with growing capacity will inevitably collapse after a separation contingency if the spare capacity in each island increases slower than a linear function of the network capacity and there is no suitable global coordinator.

Suggested Citation

  • Zhao, Qian-Chuan & Jia, Qing-Shan & Cao, Yang, 2007. "How much spare capacity is necessary for the security of resource networks?," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 373(C), pages 861-873.
    • Handle: RePEc:eee:phsmap:v:373:y:2007:i:c:p:861-873
    DOI: 10.1016/j.physa.2006.05.030
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437106006431
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2006.05.030?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. 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.
    2. Steven H. Strogatz, 2001. "Exploring complex networks," Nature, Nature, vol. 410(6825), pages 268-276, March.
    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. Yang, Hyeonchae & Jung, Woo-Sung, 2016. "Structural efficiency to manipulate public research institution networks," Technological Forecasting and Social Change, Elsevier, vol. 110(C), pages 21-32.
    2. Yao, Jialing & Sun, Bingbin & Xi, lifeng, 2019. "Fractality of evolving self-similar networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 515(C), pages 211-216.
    3. Biao Xiong & Bixin Li & Rong Fan & Qingzhong Zhou & Wu Li, 2017. "Modeling and Simulation for Effectiveness Evaluation of Dynamic Discrete Military Supply Chain Networks," Complexity, Hindawi, vol. 2017, pages 1-9, October.
    4. Laurienti, Paul J. & Joyce, Karen E. & Telesford, Qawi K. & Burdette, Jonathan H. & Hayasaka, Satoru, 2011. "Universal fractal scaling of self-organized networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(20), pages 3608-3613.
    5. Prasanna Gai & Sujit Kapadia, 2011. "A Network Model of Super-Systemic Crises," Central Banking, Analysis, and Economic Policies Book Series, in: Rodrigo Alfaro (ed.),Financial Stability, Monetary Policy, and Central Banking, edition 1, volume 15, chapter 13, pages 411-432, Central Bank of Chile.
    6. Jing Liu & Huapu Lu & He Ma & Wenzhi Liu, 2017. "Network Vulnerability Analysis of Rail Transit Plans in Beijng-Tianjin-Hebei Region Considering Connectivity Reliability," Sustainability, MDPI, vol. 9(8), pages 1-17, August.
    7. Zhang, Qiang & Pu, Shunhao & Luo, Lihua & Liu, Zhichao & Xu, Jie, 2022. "Revisiting important ports in container shipping networks: A structural hole-based approach," Transport Policy, Elsevier, vol. 126(C), pages 239-248.
    8. Selen Onel & Abe Zeid & Sagar Kamarthi, 2011. "The structure and analysis of nanotechnology co-author and citation networks," Scientometrics, Springer;Akadémiai Kiadó, vol. 89(1), pages 119-138, October.
    9. Qingmin Hao & Jim Huangnan Shen & Chien-Chiang Lee, 2023. "Risk contagion of bank-firm loan network: evidence from China," Eurasian Business Review, Springer;Eurasia Business and Economics Society, vol. 13(2), pages 341-361, June.
    10. Singha, Joydeep & Ramaswamy, Ramakrishna, 2022. "Phase-locking in k-partite networks of delay-coupled oscillators," Chaos, Solitons & Fractals, Elsevier, vol. 157(C).
    11. Martijn Warnier & Vincent Alkema & Tina Comes & Bartel Walle, 2020. "Humanitarian access, interrupted: dynamic near real-time network analytics and mapping for reaching communities in disaster-affected countries," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(3), pages 815-834, September.
    12. Lindelauf, R. & Borm, P.E.M. & Hamers, H.J.M., 2009. "Understanding Terrorist Network Topologies and Their Resilience Against Disruption," Discussion Paper 2009-85, Tilburg University, Center for Economic Research.
    13. Jalili, Mahdi, 2011. "Synchronizability of dynamical scale-free networks subject to random errors," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(23), pages 4588-4595.
    14. Hossain, Liaquat & Murshed, Shahriar Tanvir & Uddin, Shahadat, 2013. "Communication network dynamics during organizational crisis," Journal of Informetrics, Elsevier, vol. 7(1), pages 16-35.
    15. Jalili, Mahdi, 2011. "Error and attack tolerance of small-worldness in complex networks," Journal of Informetrics, Elsevier, vol. 5(3), pages 422-430.
    16. Ichinose, Genki & Tsuchiya, Tomohiro & Watanabe, Shunsuke, 2021. "Robustness of football passing networks against continuous node and link removals," Chaos, Solitons & Fractals, Elsevier, vol. 147(C).
    17. Nie, Tingyuan & Fan, Bo & Wang, Zhenhao, 2022. "Complexity and robustness of weighted circuit network of placement," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 598(C).
    18. Kashyap, G. & Ambika, G., 2019. "Link deletion in directed complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 514(C), pages 631-643.
    19. Guillaume, Jean-Loup & Latapy, Matthieu, 2006. "Bipartite graphs as models of complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 371(2), pages 795-813.
    20. Zhang, Yanjie & Ayyub, Bilal M. & Saadat, Yalda & Zhang, Dongming & Huang, Hongwei, 2020. "A double-weighted vulnerability assessment model for metrorail transit networks and its application in Shanghai metro," International Journal of Critical Infrastructure Protection, Elsevier, vol. 29(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:eee:phsmap:v:373:y:2007:i:c:p:861-873. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    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.