IDEAS home Printed from https://ideas.repec.org/a/wsi/ijmpcx/v35y2024i04ns0129183124500463.html
   My bibliography  Save this article

Robustness of dual-layer networks considering node load redistribution

Author

Listed:
  • Jinlong Ma

    (School of Information Science and Engineering, Hebei University of Science and Technology, Shijiazhuang 050018, P. R. China2Hebei Technology Innovation Center of Intelligent IoT, Shijiazhuang 050018, P. R. China)

  • Jiahui Xin

    (School of Information Science and Engineering, Hebei University of Science and Technology, Shijiazhuang 050018, P. R. China2Hebei Technology Innovation Center of Intelligent IoT, Shijiazhuang 050018, P. R. China)

Abstract

To investigate the spread of cascading failure on dual-layer networks, we propose a dual-layer network model based on eigenvector centrality and define network interactions through different connection strategies. Following the local priority reallocation rule of load and the nonlinear relationship between load and capacity, we conduct theoretical analysis of the proposed model and simulate it on the BA scale-free network. The result simulation shows that under different connection strategies, when the controllable coefficient α=0.6 of the initial load, the dual-layer network demonstrates better robustness regardless of attacking a node with a large initial load or a small initial load. And when α<0.6, the robustness of the network for attacking a node with low initial load is enhanced as the node coupling rate of the dual-layer network increases. For α≥0.6, the variation of network robustness does not vary essentially with the node coupling rate.

Suggested Citation

  • Jinlong Ma & Jiahui Xin, 2024. "Robustness of dual-layer networks considering node load redistribution," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 35(04), pages 1-18, April.
  • Handle: RePEc:wsi:ijmpcx:v:35:y:2024:i:04:n:s0129183124500463
    DOI: 10.1142/S0129183124500463
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0129183124500463
    Download Restriction: Access to full text is restricted to subscribers

    File URL: https://libkey.io/10.1142/S0129183124500463?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.

    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:wsi:ijmpcx:v:35:y:2024:i:04:n:s0129183124500463. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijmpc/ijmpc.shtml .

    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.