Integrating local and global information to identify influential nodes in complex networks

Background analysis

Suppose a network is denoted as \(G = \left( {V,E} \right)\) where V is the set of nodes and E represents the edges. If there is an edge between node i and node j, then \(a_{ij} = 1\) they are directly connected, while if there is no edge, then \(a_{ij} = 0\) they are not directly connected. The total number of nodes in the network is denoted as n. The indices that use in this study are introduced in this section.

Degree centrality (DC)

The number of nodes close to or directly linked to a node is denoted by DC, which is the most basic form of centrality. DC reflects on…