Figure 5
From: Identifying vital nodes in complex networks by adjacency information entropy
Network efficiency experiments for undirected networks. In (a), as the proportion of removed nodes increases, the network efficiency gradually declines after removing the nodes ranked by different metrics. Node removal ranked by URank makes the network efficiency decrease the fastest, and the network efficiency corresponding to URank is the smallest when the same proportion of nodes are removed. In (b), after removing approximately 20% of the nodes ranked by the algorithm in this paper, the network efficiency is reduced to the lowest, while the other metrics need to remove approximately 70% of the nodes. Panel (c) shows that the performance of our metric is more uniform. Panel (d) clearly shows the performance of URank compared with the other metrics.
