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

MaRDI QIDQ5127772zbMATH OpenFDO

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

Publication date 27 October 2020

zbMATH Keywords

attack strategybetweenness and degree entropycentralitycomplex networkinvulnerability

Mathematics Subject Classification ID

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

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

Cited in

(9)

• Exploring the heterogeneity for node importance byvon Neumann entropy
• Analysis of complex network performance and heuristic node removal strategies
• Node importance evaluation in dynamic convergence complex networks
• Degeneration characters of heterogeneous-interdependent network and key node identification
• 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
• Determination methods of node importance in complex networks
• Efficient identification of node importance based on agglomeration in cycle-related networks
• 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)