katzcent: Find the Katz centrality (Katz Status Index)
Description
The Katz centrality for node i is:
$$x_{i}=\alpha \sum_{j}A_{ij}x_{j}+\beta$$
where \(A\) is the adjacency matrix of the graph G with eigenvalues \(\lambda\). The parameter \(\beta\) controls the initial centrality and \(\alpha < \frac{1}{\lambda_{max}}\).
Usage
katzcent(graph, vids = V(graph), alpha = 0.1)
Arguments
graph
The input graph as igraph object
vids
Vertex sequence, the vertices for which the centrality values are returned. Default is all vertices.
alpha
The alpha parameter, which must be between 0.0-0.2. The default is 0.1.
Value
A numeric vector contaning the centrality scores for the selected vertices.
Details
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.
More detail at Katz Centrality
References
Newman, Mark. Networks: an introduction. Oxford University Press, 2010.
Junker, Bjorn H., Dirk Koschutzki, and Falk Schreiber. "Exploration of biological network centralities with CentiBiN." BMC bioinformatics 7.1 (2006): 219.