2020
DOI: 10.1016/j.physa.2019.122862
|View full text |Cite
|
Sign up to set email alerts
|

Critical node detection problem for complex network in undirected weighted networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 15 publications
(4 citation statements)
references
References 45 publications
0
4
0
Order By: Relevance
“…Existing modeling methods for cascading failures of CPPSs in the literature can be divided into two categories, including, complex network-based and approximate dynamic behavior-based models. The former is characterized by high efficiency and few input parameters, such as betweenness-based model (Chen et al, 2014), dynamical redistribution model (Crucitti et al, 2004), and Medium and Low voltage model (Pagani and Aiello, 2013). However, this category of models contains a large number of unrealistic assumptions and approximations about power flows.…”
Section: Modeling Methods For Cascading Failures Of Cppssmentioning
confidence: 99%
See 1 more Smart Citation
“…Existing modeling methods for cascading failures of CPPSs in the literature can be divided into two categories, including, complex network-based and approximate dynamic behavior-based models. The former is characterized by high efficiency and few input parameters, such as betweenness-based model (Chen et al, 2014), dynamical redistribution model (Crucitti et al, 2004), and Medium and Low voltage model (Pagani and Aiello, 2013). However, this category of models contains a large number of unrealistic assumptions and approximations about power flows.…”
Section: Modeling Methods For Cascading Failures Of Cppssmentioning
confidence: 99%
“…In their method, the comprehensive importance of nodes is calculated by the weighted sum of these three measures, and the weights of them are determined through the proposed algorithm that integrates entropy weighting method and the Vlsekriterijumska Optimizacija I Kompromisno Resenje method. Chen et al (2020) modeled the CNI problem as a nonconvex mixed-integer quadratic programming problem. Their method aims to obtain a set of critical nodes that can simultaneously maximize the weights between the nodes and minimize pairwise connectivity.…”
Section: Cpps Resilience Optimization Through Identifying and Protecting Critical Nodesmentioning
confidence: 99%
“…ese studies show that the critical exponent is not universal in some scale-free complex networks. erefore, finding the critical point of complex networks has become an issue of great academic interest, and many algorithms for this purpose have emerged [24,25].…”
Section: Introductionmentioning
confidence: 99%
“…e research of the information propagation such as spreading of rumors, influence diffusion, packet forwarding, and epidemic proportions has a long tradition in network science including social network analysis, Internet topology analysis, and complex biological network analysis. Identifying the influential source nodes that make the information propagates as quickly as possible is one of the most important problems in network science, and many researchers did hard works on finding such influential nodes [6][7][8][9][10][11].…”
Section: Introductionmentioning
confidence: 99%