Level | Characteristics indicators | Formula | Note | Indicator meaning |
---|---|---|---|---|
Overall level | Degree Central Potential | \(C= \frac{\sum _{i=1}^{n}\left( C_{ADmax}-C_{ADi}\right) }{n^{2}-3n+2}\) | \(C_{ADi}\):the absolute centrality of point i \(C_{ADmax}\):the maximum absolute centrality of the points in the graph n:Number of points in the graph | This reflects the overall balance of the network and portrays the overall centrality of the network. The higher the value, the more unbalanced the network is, and the more likely there is a “core-edge” network structure. |
– | Average Degree | \(\bar{k}=\frac{1}{V}\sum _{v\epsilon V }k_{v}\) | V the number of nodes in the network \(k_{v}\) the degree value of the vth node in the network | This reflects the overall connection intensity of the network. |
– | Graph Density | \(D= \frac{2E}{V\left( V-1\right) }\) | E the number of edges in the network V the number of nodes in the network | This reflects the connection intensity of each node in the network. The higher the value, the stronger the connection between nodes. |
Individual level | Degree | \(k_{v}\) | the number of edges connected to the node v | This reflects the number of other nodes connected to the node, the important node is the node with many connections. |
– | Intensity | \(s_{v}= \sum _{u\epsilon V}W_{vu}\) | \(W_{vu}\) the weight value from node v to node u | This reflects the level of participation of a node in the network, and is a true representation of the connection intensity of a node with other nodes. |