Implement Katz Centrality to measure the degree of influence of an actor in a social network

Registered by Dimitris Kalamaras on 2014-08-19

SocNetV should implement Katz Centrality to enable the user to measure the degree of influence of an actor in a social network by taking into account the total number of walks between a pair of actors.

Katz centrality computes the relative influence of a node within a network by measuring the number of the immediate neighbors (first degree nodes) and also all other nodes in the network that connect to the node under consideration through these immediate neighbors. Connections made with distant neighbors are, however, penalized by an attenuation factor \alpha. Each path or connection between a pair of nodes is assigned a weight determined by \alpha and the distance between nodes as \alpha^d.

For example, in the figure on the right, assuming that John’s centrality is being measured and that \alpha = 0.5. The weight assigned to each link that connects John with his immediate neighbors Jane and Bob will be (0.5)^1 = 0.5. Jose connects to John indirectly through Bob, the weight assigned to this connection (composed of two links) will be (0.5)^2 = 0.25. Similarly, weight assigned to the connection between Agneta and John will be (0.5)^3 = 0.125.

Mathematical formulation

Let A be the adjacency matrix of a network under consideration. Elements (a_{ij}) of A are variables that take a value 1 if a node i is connected to node j and 0 otherwise. The powers of A indicate the presence (or absence) of links between two nodes through intermediaries. For instance, in matrix A^3, if element (a_{2,12}) = 1, it indicates that node 2 and node 12 are connected through some first and second degree neighbors of node 2. If C_{\mathrm{Katz}}(i) denotes Katz centrality of a node i, then mathematically:

    C_{\mathrm{Katz}}(i) = \sum_{k=1}^{\infin}\sum_{j=1}^n \alpha^k (A^k)_{ji}

Note that the above definition uses the fact that the element at location (i,j) of the adjacency matrix A raised to the power k (i.e. A^k) reflects the total number of k degree connections between nodes i and j. The value of the attenuation factor α has to be chosen such that it is smaller than the reciprocal of the absolute value of the largest eigenvalue of the adjacency matrix A.[4] In this case the following expression can be used to calculate Katz centrality:

    \overrightarrow{C}_{\mathrm{Katz}} = ((I - \alpha A^T)^{-1}-I)\overrightarrow{I}

Here I is the identity matrix, \overrightarrow{I} is an identity vector of size n (n is the number of nodes) consisting of ones. A^T denotes the transposed matrix of A and (I - \alpha A^T)^{-1} denotes matrix inversion of the term (I - \alpha A^T).

Urls:
http://en.wikipedia.org/wiki/Katz_centrality

Blueprint information

Status:
Started
Approver:
Dimitris Kalamaras
Priority:
Essential
Drafter:
Dimitris Kalamaras
Direction:
Approved
Assignee:
Dimitris Kalamaras
Definition:
Approved
Series goal:
Accepted for 2.x
Implementation:
Needs Infrastructure
Milestone target:
None
Started by
Dimitris Kalamaras on 2015-06-05

Related branches

Sprints

Whiteboard

(?)

Work Items

This blueprint contains Public information 
Everyone can see this information.

Subscribers

No subscribers.