Katz centrality

Last updated January 06, 2024

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.^[1] 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.^[2]

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 $\alpha$ .^[4] 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, assume 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$ . Since 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, the weight assigned to the connection between Agneta and John through Aziz and Jane will be $(0.5)^{3}=0.125$ and the weight assigned to the connection between Agneta and John through Diego, Jose and Bob will be $(0.5)^{4}=0.0625$ .

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 walk of length 3. If $C_{\mathrm {Katz} }(i)$ denotes Katz centrality of a node i, then, given a value $\alpha \in (0,1)$ , mathematically:

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 $(i,j)$ of $A^{k}$ reflects the total number of $k$ degree connections between nodes $i$ and $j$ . The value of the attenuation factor $\alpha$ has to be chosen such that it is smaller than the reciprocal of the absolute value of the largest eigenvalue of A.^[5] 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 a 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})$ .^[5]

An extension of this framework allows for the walks to be computed in a dynamical setting.^[6]^[7] 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:

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

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

\left(A^{[k]}\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 $t_{0}<t_{1}<\cdots <t_{M}$ are ordered but not necessarily equally spaced. $Q\in \mathbb {R} ^{N\times N}$ for which $(Q)_{ij}$ is a weighted count of the number of dynamic walks of length $w$ from node $i$ to node $j$ . The form for the dynamic communicability between participating nodes is:

{\mathcal {Q}}=\left(I-\alpha A^{[0]}\right)^{-1}\cdots \left(I-\alpha A^{[M]}\right)^{-1}.

This can be normalized via:

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

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

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 $A_{i,j}$ , Katz centrality is defined as follows:

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

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

Half a century later, Bonacich and Lloyd^[10] defined alpha centrality as:

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

which is essentially identical to Katz centrality. More precisely, the score of a node $j$ differs exactly by $e_{j}$ , so if ${\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.^[11]

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

Katz centrality can also be used in estimating the relative status or influence of actors in a social network. The work presented in ^[12] 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.^[13] The temporal extension of the Katz centrality is applied to fMRI data obtained from a musical learning experiment in ^[14] 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.^[15]

Alpha centrality is implemented in igraph library for network analysis and visualization.^[16]

Related Research Articles

In mathematical physics and mathematics, the Pauli matrices are a set of three $2 \times 2$ complex matrices that are Hermitian, involutory and unitary. Usually indicated by the Greek letter sigma, they are occasionally denoted by tau when used in connection with isospin symmetries.

In the mathematical field of differential geometry, a metric tensor is an additional structure on a manifold $M$ that allows defining distances and angles, just as the inner product on a Euclidean space allows defining distances and angles there. More precisely, a metric tensor at a point $p$ of $M$ is a bilinear form defined on the tangent space at $p$ , and a metric tensor on $M$ consists of a metric tensor at each point $p$ of $M$ that varies smoothly with $p$ .

In probability theory and statistics, the beta distribution is a family of continuous probability distributions defined on the interval [0, 1] or in terms of two positive parameters, denoted by alpha (α) and beta (β), that appear as exponents of the variable and its complement to 1, respectively, and control the shape of the distribution.

<span class="mw-page-title-main">Anti-de Sitter space</span> Maximally symmetric Lorentzian manifold with a negative cosmological constant

In mathematics and physics, n-dimensional anti-de Sitter space (AdS_n) is a maximally symmetric Lorentzian manifold with constant negative scalar curvature. Anti-de Sitter space and de Sitter space are named after Willem de Sitter (1872–1934), professor of astronomy at Leiden University and director of the Leiden Observatory. Willem de Sitter and Albert Einstein worked together closely in Leiden in the 1920s on the spacetime structure of the universe. Paul Dirac was the first person to rigorously explore anti-de Sitter space, doing so in 1963.

In quantum field theory, the Lehmann–Symanzik–Zimmermann (LSZ) reduction formula is a method to calculate S-matrix elements from the time-ordered correlation functions of a quantum field theory. It is a step of the path that starts from the Lagrangian of some quantum field theory and leads to prediction of measurable quantities. It is named after the three German physicists Harry Lehmann, Kurt Symanzik and Wolfhart Zimmermann.

In graph theory and network analysis, indicators of centrality assign numbers or rankings to nodes within a graph corresponding to their network position. Applications include identifying the most influential person(s) in a social network, key infrastructure nodes in the Internet or urban networks, super-spreaders of disease, and brain networks. Centrality concepts were first developed in social network analysis, and many of the terms used to measure centrality reflect their sociological origin.

In statistics and information theory, a maximum entropy probability distribution has entropy that is at least as great as that of all other members of a specified class of probability distributions. According to the principle of maximum entropy, if nothing is known about a distribution except that it belongs to a certain class, then the distribution with the largest entropy should be chosen as the least-informative default. The motivation is twofold: first, maximizing entropy minimizes the amount of prior information built into the distribution; second, many physical systems tend to move towards maximal entropy configurations over time.

In electromagnetism, the electromagnetic tensor or electromagnetic field tensor is a mathematical object that describes the electromagnetic field in spacetime. The field tensor was first used after the four-dimensional tensor formulation of special relativity was introduced by Hermann Minkowski. The tensor allows related physical laws to be written very concisely, and allows for the quantization of the electromagnetic field by Lagrangian formulation described below.

<span class="mw-page-title-main">Quantum tomography</span> Reconstruction of quantum states based on measurements

Quantum tomography or quantum state tomography is the process by which a quantum state is reconstructed using measurements on an ensemble of identical quantum states. The source of these states may be any device or system which prepares quantum states either consistently into quantum pure states or otherwise into general mixed states. To be able to uniquely identify the state, the measurements must be tomographically complete. That is, the measured operators must form an operator basis on the Hilbert space of the system, providing all the information about the state. Such a set of observations is sometimes called a quorum. The term tomography was first used in the quantum physics literature in a 1993 paper introducing experimental optical homodyne tomography.

In the fields of actuarial science and financial economics there are a number of ways that risk can be defined; to clarify the concept theoreticians have described a number of properties that a risk measure might or might not have. A coherent risk measure is a function that satisfies properties of monotonicity, sub-additivity, homogeneity, and translational invariance.

In the mathematical field of dynamical systems, a random dynamical system is a dynamical system in which the equations of motion have an element of randomness to them. Random dynamical systems are characterized by a state space S, a set of maps $from S into itself that can be thought of as the set of all possible equations of motion, and a probability distribution Q on the set that represents the random choice of map. Motion in a random dynamical system can be informally thought of as a state evolving according to a succession of maps randomly chosen according to the distribution Q .$

In statistics, the inverse Wishart distribution, also called the inverted Wishart distribution, is a probability distribution defined on real-valued positive-definite matrices. In Bayesian statistics it is used as the conjugate prior for the covariance matrix of a multivariate normal distribution.

Network science is an academic field which studies complex networks such as telecommunication networks, computer networks, biological networks, cognitive and semantic networks, and social networks, considering distinct elements or actors represented by nodes and the connections between the elements or actors as links. The field draws on theories and methods including graph theory from mathematics, statistical mechanics from physics, data mining and information visualization from computer science, inferential modeling from statistics, and social structure from sociology. The United States National Research Council defines network science as "the study of network representations of physical, biological, and social phenomena leading to predictive models of these phenomena."

Algebraic signal processing (ASP) is an emerging area of theoretical signal processing (SP). In the algebraic theory of signal processing, a set of filters is treated as an (abstract) algebra, a set of signals is treated as a module or vector space, and convolution is treated as an algebra representation. The advantage of algebraic signal processing is its generality and portability.

An electric dipole transition is the dominant effect of an interaction of an electron in an atom with the electromagnetic field.

In mathematics a translation surface is a surface obtained from identifying the sides of a polygon in the Euclidean plane by translations. An equivalent definition is a Riemann surface together with a holomorphic 1-form.

In machine learning, the kernel embedding of distributions comprises a class of nonparametric methods in which a probability distribution is represented as an element of a reproducing kernel Hilbert space (RKHS). A generalization of the individual data-point feature mapping done in classical kernel methods, the embedding of distributions into infinite-dimensional feature spaces can preserve all of the statistical features of arbitrary distributions, while allowing one to compare and manipulate distributions using Hilbert space operations such as inner products, distances, projections, linear transformations, and spectral analysis. This learning framework is very general and can be applied to distributions over any space $on which a sensible kernel function may be defined. For example, various kernels have been proposed for learning from data which are: vectors in, discrete classes/categories, strings, graphs/networks, images, time series, manifolds, dynamical systems, and other structured objects. The theory behind kernel embeddings of distributions has been primarily developed by Alex Smola, Le Song, Arthur Gretton, and Bernhard Schölkopf. A review of recent works on kernel embedding of distributions can be found in.$

Chronological calculus is a formalism for the analysis of flows of non-autonomous dynamical systems. It was introduced by A. Agrachev and R. Gamkrelidze in the late 1970s. The scope of the formalism is to provide suitable tools to deal with non-commutative vector fields and represent their flows as infinite Volterra series. These series, at first introduced as purely formal expansions, are then shown to converge under some suitable assumptions.

A set of networks that satisfies given structural characteristics can be treated as a network ensemble. Brought up by Ginestra Bianconi in 2007, the entropy of a network ensemble measures the level of the order or uncertainty of a network ensemble.

Tau functions are an important ingredient in the modern mathematical theory of integrable systems, and have numerous applications in a variety of other domains. They were originally introduced by Ryogo Hirota in his direct method approach to soliton equations, based on expressing them in an equivalent bilinear form.

References

↑ Katz, L. (1953). A New Status Index Derived from Sociometric Analysis. Psychometrika, 39–43.
↑ Hanneman, R. A., & Riddle, M. (2005). Introduction to Social Network Methods. Retrieved from http://faculty.ucr.edu/~hanneman/nettext/
↑ Vigna, S. (2016). "Spectral ranking". Network Science. 4 (4): 433–445. doi: 10.1017/nws.2016.21 . hdl: 2434/527942 .
↑ Aggarwal, C. C. (2011). Social Network Data Analysis. New York, NY: Springer.
1 2 Junker, B. H., & Schreiber, F. (2008). Analysis of Biological Networks. Hoboken, NJ: John Wiley & Sons.
↑ Grindrod, Peter; Parsons, Mark C; Higham, Desmond J; Estrada, Ernesto (2011). "Communicability across evolving networks" (PDF). Physical Review E. APS. 83 (4): 046120. Bibcode:2011PhRvE..83d6120G. doi:10.1103/PhysRevE.83.046120. PMID 21599253.
↑ 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 .
↑ Leo Katz (1953). "A new status index derived from sociometric analysis". Psychometrika. 18 (1): 39–43. doi:10.1007/BF02289026. S2CID 121768822.
↑ Charles H. Hubbell (1965). "An input-output approach to clique identification". Sociometry. 28 (4): 377–399. doi:10.2307/2785990. JSTOR 2785990.
↑ 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.
1 2 Newman, M. E. (2010). Networks: An Introduction. New York, NY: Oxford University Press.
↑ 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. Springer. 3 (4): 1311–1323. doi:10.1007/s13278-013-0143-7. S2CID 7125694.
↑ 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.
↑ 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.
↑ 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.
↑ "Welcome to igraph's new home".

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[katz1953-1] Katz, L. (1953). A New Status Index Derived from Sociometric Analysis. Psychometrika, 39–43.

[hanneman2005-2] Hanneman, R. A., & Riddle, M. (2005). Introduction to Social Network Methods. Retrieved from http://faculty.ucr.edu/~hanneman/nettext/

[vigna2016-3] Vigna, S. (2016). "Spectral ranking". Network Science. 4 (4): 433–445. doi: 10.1017/nws.2016.21 . hdl: 2434/527942 .

[aggarwal2011-4] Aggarwal, C. C. (2011). Social Network Data Analysis. New York, NY: Springer.

[junker2008-5] 1 2 Junker, B. H., & Schreiber, F. (2008). Analysis of Biological Networks. Hoboken, NJ: John Wiley & Sons.

[grindrod2011communicability-6] Grindrod, Peter; Parsons, Mark C; Higham, Desmond J; Estrada, Ernesto (2011). "Communicability across evolving networks" (PDF). Physical Review E. APS. 83 (4): 046120. Bibcode:2011PhRvE..83d6120G. doi:10.1103/PhysRevE.83.046120. PMID 21599253.

[grindrod2010Dynamical-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 .

[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.

[newman2010-11] 1 2 Newman, M. E. (2010). Networks: An Introduction. New York, NY: Oxford University Press.

[laflin2013discovering-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. Springer. 3 (4): 1311–1323. doi:10.1007/s13278-013-0143-7. S2CID 7125694.

[jmckay2017-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.

[mantzaris2013fMRI-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".

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]

[10]

[11]

[12]

[13]

[14]

[15]

[16]