Understanding Customer Value in the Mobile Internet Era

Table 1

Some indexes to describe the importance of nodes in the network.

Method	Calculation formula	Description
Degree centrality		The average influence between the current node and adjacent nodes
Closeness centrality	( represents the shortest path length from node i to node j)	The difficulty of the current node to other nodes, that is, the distance to other nodes in the network
Betweenness centrality	( denotes the number of nodes i in the shortest path between nodes s and T	The importance of current node in the whole network to be a “bridge”
Eigenvector centrality	(of which λ is the largest eigenvalue of the adjacency matrix, )	The influence of the current node is the linear sum of the influence of neighbour
PageRank	(where Out(Vi) is the set of outgoing nodes of the node, and d is the empirical parameter, usually 0.85)	The influence ranking of the current node is obtained by iterative calculation
Katz centrality	(where α and β are both constants)	The influence of the current node depends on the random walk path from this point