English
 
Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Graph coloring framework to mitigate cascading failure in complex networks

Singh, K., Chandrasekar, V. K., Zou, W., Kurths, J., Senthilkumar, D. V. (2025): Graph coloring framework to mitigate cascading failure in complex networks. - Communications Physics, 8, 170.
https://doi.org/10.1038/s42005-025-02089-y

Item is

Files

show Files
hide Files
:
Singh_2025_s42005-025-02089-y.pdf (Publisher version), 3MB
Name:
Singh_2025_s42005-025-02089-y.pdf
Description:
-
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
Copyright Date:
-
Copyright Info:
-

Locators

show
hide
Description:
Code

Creators

show
hide
 Creators:
Singh, Karan1, Author
Chandrasekar, V. K.1, Author
Zou, Wei1, Author
Kurths, Jürgen2, Author              
Senthilkumar, D. V.1, Author
Affiliations:
1External Organizations, ou_persistent22              
2Potsdam Institute for Climate Impact Research, ou_persistent13              

Content

show
hide
Free keywords: -
 Abstract: Cascading failures pose a significant threat to the stability and functionality of complex systems, making their mitigation a crucial area of research. While existing strategies aim to enhance network robustness, identifying an optimal set of critical nodes that mediates the cascade for protection remains a challenging task. Here, we present a robust and pragmatic framework that effectively mitigates the cascading failures by strategically identifying and securing critical nodes within the network. Our approach leverages a graph coloring technique to identify the critical nodes using the local network topology, and results in a minimal set of critical nodes to be protected yet maximally effective in mitigating the cascade thereby retaining a large fraction of the network intact. Our method outperforms existing mitigation strategies across diverse network configurations and failure scenarios. An extensive empirical validation using real-world networks highlights the practical utility of our framework, offering a promising tool for enhancing network robustness in complex systems.

Details

show
hide
Language(s): eng - English
 Dates: 2025-04-172025-04-17
 Publication Status: Finally published
 Pages: 11
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: DOI: 10.1038/s42005-025-02089-y
MDB-ID: No MDB - stored outside PIK (see locators/paper)
PIKDOMAIN: RD4 - Complexity Science
Organisational keyword: RD4 - Complexity Science
Research topic keyword: Complex Networks
Research topic keyword: Energy
Model / method: Machine Learning
OATYPE: Gold Open Access
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Communications Physics
Source Genre: Journal, SCI, Scopus, oa
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 8 Sequence Number: 170 Start / End Page: - Identifier: CoNE: https://publications.pik-potsdam.de/cone/journals/resource/2399-3650
Publisher: Nature