Misplaced Pages

Part of a series on
Network science
Theory
Graph Complex network Contagion Small-world Scale-free Community structure Percolation Evolution Controllability Graph drawing Social capital Link analysis Optimization Reciprocity Closure Homophily Transitivity Preferential attachment Balance theory Network effect Social influence
Network types
Informational (computing) Telecommunication Transport Social Scientific collaboration Biological Artificial neural Interdependent Semantic Spatial Dependency Flow on-Chip
Graphs
Features Clique Component Cut Cycle Data structure Edge Loop Neighborhood Path Vertex Adjacency list / matrix Incidence list / matrix Types Bipartite Complete Directed Hyper Labeled Multi Random Weighted
Metrics Algorithms
Centrality Degree Motif Clustering Degree distribution Assortativity Distance Modularity Efficiency
Models
Topology Random graph Erdős–Rényi Barabási–Albert Bianconi–Barabási Fitness model Watts–Strogatz Exponential random (ERGM) Random geometric (RGG) Hyperbolic (HGN) Hierarchical Stochastic block Blockmodeling Maximum entropy Soft configuration LFR Benchmark Dynamics Boolean network agent based Epidemic/SIR
Lists Categories
Topics Software Network scientists Category:Network theory Category:Graph theory
v t e

In graph theory, the Katz centrality or alpha centrality of a node is a measure of centrality in a network. It was introduced by Leo Katz in 1953 and is used to measure the relative degree of influence of an actor (or node) within a social network. Unlike typical centrality measures which consider only the shortest path (the geodesic) between a pair of actors, Katz centrality measures influence by taking into account the total number of walks between a pair of actors.

It is similar to Google's PageRank and to the eigenvector centrality.

Measurement

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 ${\displaystyle \alpha }$. Each path or connection between a pair of nodes is assigned a weight determined by ${\displaystyle \alpha }$ and the distance between nodes as ${\displaystyle \alpha ^{d}}$.

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

Mathematical formulation

Let A be the adjacency matrix of a network under consideration. Elements ${\displaystyle (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 ${\displaystyle A^{3}}$, if element ${\displaystyle (a_{2,12})=1}$, it indicates that node 2 and node 12 are connected through some walk of length 3. If ${\displaystyle C_{\mathrm {Katz} }(i)}$ denotes Katz centrality of a node i, then, given a value ${\displaystyle \alpha \in (0,1)}$, mathematically:

${\displaystyle C_{\mathrm {Katz} }(i)=\sum _{k=1}^{\infty }\sum _{j=1}^{n}\alpha ^{k}(A^{k})_{ji}}$

Note that the above definition uses the fact that the element at location ${\displaystyle (i,j)}$ of ${\displaystyle A^{k}}$ reflects the total number of ${\displaystyle k}$ degree connections between nodes ${\displaystyle i}$ and ${\displaystyle j}$. The value of the attenuation factor ${\displaystyle \alpha }$ has to be chosen such that it is smaller than the reciprocal of the absolute value of the largest eigenvalue of A. In this case the following expression can be used to calculate Katz centrality:

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

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

An extension of this framework allows for the walks to be computed in a dynamical setting. By taking a time dependent series of network adjacency snapshots of the transient edges, the dependency for walks to contribute towards a cumulative effect is presented. The arrow of time is preserved so that the contribution of activity is asymmetric in the direction of information propagation.

Network producing data of the form:

${\displaystyle \left\{A^{}\in \mathbb {R} ^{N\times N}\right\}\qquad {\text{for}}\quad k=0,1,2,\ldots ,M,}$

representing the adjacency matrix at each time ${\displaystyle t_{k}}$. Hence:

${\displaystyle \left(A^{}\right)_{ij}={\begin{cases}1&{\text{there is an edge from node }}i{\text{ to node }}j{\text{ at time }}t_{k}\\0&{\text{otherwise}}\end{cases}}}$

The time points ${\displaystyle t_{0}<t_{1}<\cdots <t_{M}}$ are ordered but not necessarily equally spaced. ${\displaystyle Q\in \mathbb {R} ^{N\times N}}$ for which ${\displaystyle (Q)_{ij}}$ is a weighted count of the number of dynamic walks of length ${\displaystyle w}$ from node ${\displaystyle i}$ to node ${\displaystyle j}$. The form for the dynamic communicability between participating nodes is:

${\displaystyle {\mathcal {Q}}=\left(I-\alpha A^{}\right)^{-1}\cdots \left(I-\alpha A^{}\right)^{-1}.}$

This can be normalized via:

${\displaystyle {\hat {\mathcal {Q}}}^{}={\frac {{\hat {\mathcal {Q}}}^{}\left(I-\alpha A^{}\right)^{-1}}{\left\|{\hat {\mathcal {Q}}}^{}\left(I-\alpha A^{}\right)^{-1}\right\|}}.}$

Therefore, centrality measures that quantify how effectively node ${\displaystyle n}$ can 'broadcast' and 'receive' dynamic messages across the network:

${\displaystyle C_{n}^{\mathrm {broadcast} }:=\sum _{k=1}^{N}{\mathcal {Q}}_{nk}\quad \mathrm {and} \quad C_{n}^{\mathrm {receive} }:=\sum _{k=1}^{N}{\mathcal {Q}}_{kn}}$.

Alpha centrality

Given a graph with adjacency matrix ${\displaystyle A_{i,j}}$, Katz centrality is defined as follows:

${\displaystyle {\vec {x}}=(I-\alpha A^{T})^{-1}{\vec {e}}-{\vec {e}}\,}$

where ${\displaystyle e_{j}}$ is the external importance given to node ${\displaystyle j}$, and ${\displaystyle \alpha }$ is a nonnegative attenuation factor which must be smaller than the inverse of the spectral radius of ${\displaystyle A}$. The original definition by Katz used a constant vector ${\displaystyle {\vec {e}}}$. Hubbell introduced the usage of a general ${\displaystyle {\vec {e}}}$.

Half a century later, Bonacich and Lloyd defined alpha centrality as:

${\displaystyle {\vec {x}}=(I-\alpha A^{T})^{-1}{\vec {e}}\,}$

which is essentially identical to Katz centrality. More precisely, the score of a node ${\displaystyle j}$ differs exactly by ${\displaystyle e_{j}}$, so if ${\displaystyle {\vec {e}}}$ is constant the order induced on the nodes is identical.

Applications

Katz centrality can be used to compute centrality in directed networks such as citation networks and the World Wide Web.

Katz centrality is more suitable in the analysis of directed acyclic graphs where traditionally used measures like eigenvector centrality are rendered useless.

Katz centrality can also be used in estimating the relative status or influence of actors in a social network. The work presented in shows the case study of applying a dynamic version of the Katz centrality to data from Twitter and focuses on particular brands which have stable discussion leaders. The application allows for a comparison of the methodology with that of human experts in the field and how the results are in agreement with a panel of social media experts.

In neuroscience, it is found that Katz centrality correlates with the relative firing rate of neurons in a neural network. The temporal extension of the Katz centrality is applied to fMRI data obtained from a musical learning experiment in where data is collected from the subjects before and after the learning process. The results show that the changes to the network structure over the musical exposure created in each session a quantification of the cross communicability that produced clusters in line with the success of learning.

A generalized form of Katz centrality can be used as an intuitive ranking system for sports teams, such as in college football.

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

References

1. Katz, L. (1953). A New Status Index Derived from Sociometric Analysis. Psychometrika, 39–43.
2. Hanneman, R. A., & Riddle, M. (2005). Introduction to Social Network Methods. Retrieved from http://faculty.ucr.edu/~hanneman/nettext/
3. Vigna, S. (2016). "Spectral ranking". Network Science. 4 (4): 433–445. doi:10.1017/nws.2016.21. hdl:2434/527942.
4. Aggarwal, C. C. (2011). Social Network Data Analysis. New York, NY: Springer.
5. ^ Junker, B. H., & Schreiber, F. (2008). Analysis of Biological Networks. Hoboken, NJ: John Wiley & Sons.
6. Grindrod, Peter; Parsons, Mark C; Higham, Desmond J; Estrada, Ernesto (2011). "Communicability across evolving networks" (PDF). Physical Review E. 83 (4). APS: 046120. Bibcode:2011PhRvE..83d6120G. doi:10.1103/PhysRevE.83.046120. PMID 21599253.
7. Peter Grindrod; Desmond J. Higham. (2010). "Evolving graphs: Dynamical models, inverse problems and propagation". Proc. R. Soc. A. 466 (2115): 753–770. Bibcode:2010RSPSA.466..753G. doi:10.1098/rspa.2009.0456. hdl:20.500.11820/9ccf649d-eee7-44ec-9d3b-c34411bd3a6f.
8. Leo Katz (1953). "A new status index derived from sociometric analysis". Psychometrika. 18 (1): 39–43. doi:10.1007/BF02289026. S2CID 121768822.
9. Charles H. Hubbell (1965). "An input-output approach to clique identification". Sociometry. 28 (4): 377–399. doi:10.2307/2785990. JSTOR 2785990.
10. P. Bonacich, P. Lloyd (2001). "Eigenvector-like measures of centrality for asymmetric relations". Social Networks. 23 (3): 191–201. CiteSeerX 10.1.1.226.2113. doi:10.1016/S0378-8733(01)00038-7.
11. ^ Newman, M. E. (2010). Networks: An Introduction. New York, NY: Oxford University Press.
12. Laflin, Peter; Mantzaris, Alexander V; Ainley, Fiona; Otley, Amanda; Grindrod, Peter; Higham, Desmond J (2013). "Discovering and validating influence in a dynamic online social network". Social Network Analysis and Mining. 3 (4). Springer: 1311–1323. doi:10.1007/s13278-013-0143-7. S2CID 7125694.
13. Fletcher, Jack McKay; Wennekers, Thomas (2017). "From Structure to Activity: Using Centrality Measures to Predict Neuronal Activity". International Journal of Neural Systems. 28 (2): 1750013. doi:10.1142/S0129065717500137. hdl:10026.1/9713. PMID 28076982.
14. Mantzaris, Alexander V.; Danielle S. Bassett; Nicholas F. Wymbs; Ernesto Estrada; Mason A. Porter; Peter J. Mucha; Scott T. Grafton; Desmond J. Higham (2013). "Dynamic network centrality summarizes learning in the human brain". Journal of Complex Networks. 1 (1): 83–92. arXiv:1207.5047. doi:10.1093/comnet/cnt001.
15. Park, Juyong; Newman, M. E. J. (31 October 2005). "A network-based ranking system for American college football". Journal of Statistical Mechanics: Theory and Experiment. 2005 (10): P10014. arXiv:physics/0505169. doi:10.1088/1742-5468/2005/10/P10014. ISSN 1742-5468. S2CID 15120571.
16. "Welcome to igraph's new home".

• Graph invariants
• Social network analysis
• Algebraic graph theory