Degree Centrality (DC) | The degree of centrality of a node refers to the number of neighbor nodes directly connected to it. | [12] |
Network Centrality (NC) | The network centrality of a node is the sum of the aggregation coefficients of all neighboring edges of the node. | [13] |
Betweenness Centrality (BC) | The betweenness centrality of a node is the proportion of the shortest path through the node in all the shortest paths of the network. | [34] |
Closeness Centrality (CC) | The closeness centrality of the node is inversely proportional to the sum of the shortest path from the node to all other nodes in the protein network. | [35] |
Eigenvector Centrality (EC) | The eigenvector centrality of a node refers to the corresponding component of the main eigenvector of the network’s adjacency matrix. | [35] |
Semi-Local Centrality (SLC) | The semi-local centrality involves the fourth-order neighbor information of the node. | [36] |
Local Average Connectivity (LAC) | The local average connectivity of a node indicates the public node relationship of the node and its neighbours. | [36] |
Lindex | The value of a node’s lindex is the largest integer of the neighbours that have at least k degrees. | [37] |
Eccentricity (ECC) | The eccentricity value of a node is defined as the maximum of its shortest distance from other nodes in the network. | [38] |
Neighborhood Connectivity (NeiC) | The neighborhood connectivity of a node is defined as the average connectivity of all neighboring nodes of the node. | [39] |
Mapping Entropy Centrality (MEC) | This method is analogous to the concept of "information entropy" and is mainly defined by the degree centrality. | [40] |
Localized Bridging Centrality (LBC) | The localized bridging centrality of a node is defined as the product of its own median centrality and the bridging coefficient. | [41] |
Local Clustering Coefficient based on Degree Centrality (LCCDC) | The local clustering coefficient based on degree centrality is defined as the product of a node’s degree centrality and the local clustering coefficient. | [42] |
Subgraph Centrality (SC) | The subgraph centrality of a node refers to the total number of closed loops that the node participates in. | [43] |
Weighted Index Centrality (WIC) | It is a method based on the weighted index of virtual nodes to evaluate the influence of node propagation in complex networks. | [44] |
Maximum Neighborhood Component (MNC) | The MNC is defined as the maximum neighborhood component of a subgraph that consists of a node’s neighborhoods. | [45] |
Density Maximum Neighborhood Component (DMNC) | To better judge the criticality of nodes in biological networks, DMNC concept was proposed based on the MNC. | [45] |
PageRank | The PageRank algorithm sorts nodes based on the link structure of the network. | [46] |
LeaderRank | The LeaderRank algorithm was proposed by adding a "ground node" and the bidirectional edges with other nodes in the network. | [47] |
K-shell decomposition (K-shell) | The k-shell decomposition method determines the influence of the nodes according to the position of the nodes in the network. | [48] |
Mixture Degree Decomposition (MDD) | In the degree of mixture decomposition method, all nodes in the network are divided into different shells depending on their own residual degree and exhaustion degree node. | [49] |
Information Centrality (IC) | The information centrality of a node essentially measures the average length of the harmonics of all paths with nodes as endpoints. | [50] |