Importance identification method of complex network nodes based on betweenness and degree entropy

zbMATH Open1474.90084MaRDI QIDQ5127772FDOQ5127772

Authors: Pengli Lu, Xudong Guo, Men Dong, Le Cao 

Publication date: 27 October 2020

Recommendations

• Determination methods of node importance in complex networks
• A new method for identifying influential nodes and important edges in complex networks
• Identifying vital nodes in complex networks based on information entropy, minimum dominating set and distance
• Efficient identification of node importance based on agglomeration in cycle-related networks
• Vital nodes identification by the hybrid \(K\)-shell method based on vertex strength

zbMATH Keywords

centralitycomplex networkinvulnerabilityattack strategybetweenness and degree entropy

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Social networks; opinion dynamics (91D30) Measures of information, entropy (94A17)

Cited In (9)

• Determination methods of node importance in complex networks
• Exploring the heterogeneity for node importance byvon Neumann entropy
• Analysis of complex network performance and heuristic node removal strategies
• Efficient identification of node importance based on agglomeration in cycle-related networks
• Node importance evaluation in dynamic convergence complex networks
• Analysis on gray nodes and grayness degree in complex networks
• Identifying vital nodes in complex networks based on information entropy, minimum dominating set and distance
• Degeneration characters of heterogeneous-interdependent network and key node identification
• Influential node identification of network based on agglomeration operation

This page was built for publication: Importance identification method of complex network nodes based on betweenness and degree entropy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5127772)