Alpha centrality

Definition

Given a graph with adjacency matrix A i , j the alpha centrality is defined as follows:

where e j is the external importance given to node j , and α is a parameter.

Motivation

To understand alpha centrality one must first understand Eigenvector Centrality. An intuitive process to compute eigenvector centrality is to give every node a starting random positive amount of influence. Each node then splits its influence evenly and divides it amongst its outward neighbors, receiving from its inward neighbors in kind. This process repeats until everyone is giving out as much as they're taking in and the system has reached steady state. The amount of influence they have at this steady state is their eigenvector centrality. Computationally this process is called the power method. We know that this process has converged when the vector of influence changes only by a constant as follows.

Where x i is the amount of influence that node i carries, A i , j is the adjacency matrix and λ happens to be the principal eigenvalue (although this is not terribly important here).

Alpha centrality enhances this process by allowing nodes to have external sources of influence. The amount of influence that node i receives at every round is encoded in e i . The process described above should now stop when

Where α is a constant that trades off the importance of external influence against the importance of connection. When α = 0 only the external influence matters. When α is very large then only the connectivity matters, i.e. we reduce to the eigenvector centrality case.

Rather than perform the iteration described above we can solve this system for x , obtaining the following equation:

Applications

Alpha centrality is implemented in igraph library for network analysis and visualization.