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

The waiting-time distribution for network partitions in cascading failures in power networks

Author

Listed:
  • Huo, Long
  • Chen, Xin

Abstract

Network redundancy is one of the spatial properties critical to robustness against cascading failures in power networks. Waiting-time distributions for network partitions in cascading failures explain how spatial network structures affect the cascading behaviors temporally. Two waiting time events associated with the first and largest network partitions in cascading failures are studied. With synthetic power networks, waiting-time distributions of network partitions can be systematically analyzed for various network redundancies. Waiting-time distributions take longer from the local redundancy to the global redundancy. Meanwhile, the largest network partition during a cascading failure may not be unique. In power networks with larger global redundancies, the multiple largest network partitions happen more likely, and the sizes of the largest partitions decrease while their number increases statistically. Simulations in realistic power networks demonstrate the same spatio-temporal behaviors as revealed in synthetic power networks.

Suggested Citation

  • Huo, Long & Chen, Xin, 2022. "The waiting-time distribution for network partitions in cascading failures in power networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 598(C).
  • Handle: RePEc:eee:phsmap:v:598:y:2022:i:c:s037843712200293x
    DOI: 10.1016/j.physa.2022.127381
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037843712200293X
    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.2022.127381?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.

    Citations

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


    Cited by:

    1. Lv, Yuqian & Zhou, Bo & Wang, Jinhuan & Xuan, Qi, 2024. "Targeted k-node collapse problem: Towards understanding the robustness of local k-core structure," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 641(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:598:y:2022:i:c:s037843712200293x. 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: 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.