eigenv_centrality | R Documentation |
Measures of eigenvector-like centrality and centralisation
node_eigenvector(.data, normalized = TRUE, scale = FALSE)
node_power(.data, normalized = TRUE, scale = FALSE, exponent = 1)
node_alpha(.data, alpha = 0.85)
node_pagerank(.data)
network_eigenvector(.data, normalized = TRUE)
tie_eigenvector(.data, normalized = TRUE)
.data |
An object of a
|
normalized |
Logical scalar, whether the centrality scores are normalized. Different denominators are used depending on whether the object is one-mode or two-mode, the type of centrality, and other arguments. |
scale |
Logical scalar, whether to rescale the vector so the maximum score is 1. |
exponent |
Decay rate for the Bonacich power centrality score. |
alpha |
A constant that trades off the importance of external influence against the importance of connection.
When |
We use {igraph}
routines behind the scenes here for consistency and because they are often faster.
For example, igraph::eigencentrality()
is approximately 25% faster than sna::evcent()
.
A numeric vector giving the eigenvector centrality measure of each node.
A numeric vector giving each node's power centrality measure.
node_eigenvector()
: Calculate the eigenvector centrality of nodes in a network
node_power()
: Calculate the Bonacich, beta, or power centrality of nodes in a network
node_alpha()
: Calculate the alpha or Katz centrality of nodes in a network
node_pagerank()
: Calculate the pagerank centrality of nodes in a network
network_eigenvector()
: Calculate the eigenvector centralization for a network
tie_eigenvector()
: Calculate the eigenvector centrality of edges in a network
Eigenvector centrality operates as a measure of a node's influence in a network. The idea is that being connected to well-connected others results in a higher score. Each node's eigenvector centrality can be defined as:
x_i = \frac{1}{\lambda} \sum_{j \in N} a_{i,j} x_j
where a_{i,j} = 1
if i
is linked to j
and 0 otherwise,
and \lambda
is a constant representing the principal eigenvalue.
Rather than performing this iteration,
most routines solve the eigenvector equation Ax = \lambda x
.
Power or beta (or Bonacich) centrality
Alpha or Katz (or Katz-Bonacich) centrality operates better than eigenvector centrality for directed networks. Eigenvector centrality will return 0s for all nodes not in the main strongly-connected component. Each node's alpha centrality can be defined as:
x_i = \frac{1}{\lambda} \sum_{j \in N} a_{i,j} x_j + e_i
where a_{i,j} = 1
if i
is linked to j
and 0 otherwise,
\lambda
is a constant representing the principal eigenvalue,
and e_i
is some external influence used to ensure that even nodes beyond the main
strongly connected component begin with some basic influence.
Note that many equations replace \frac{1}{\lambda}
with \alpha
,
hence the name.
For example, if \alpha = 0.5
, then each direct connection (or alter) would be worth (0.5)^1 = 0.5
,
each secondary connection (or tertius) would be worth (0.5)^2 = 0.25
,
each tertiary connection would be worth (0.5)^3 = 0.125
, and so on.
Rather than performing this iteration though,
most routines solve the equation x = (I - \frac{1}{\lambda} A^T)^{-1} e
.
Bonacich, Phillip. 1991. “Simultaneous Group and Individual Centralities.” Social Networks 13(2):155–68. \Sexpr[results=rd]{tools:::Rd_expr_doi("10.1016/0378-8733(91)90018-O")}.
Bonacich, Phillip. 1987. “Power and Centrality: A Family of Measures.” The American Journal of Sociology, 92(5): 1170–82. \Sexpr[results=rd]{tools:::Rd_expr_doi("10.1086/228631")}.
Katz, Leo 1953. "A new status index derived from sociometric analysis". Psychometrika. 18(1): 39–43.
Bonacich, P. and Lloyd, P. 2001. “Eigenvector-like measures of centrality for asymmetric relations” Social Networks. 23(3):191-201.
Brin, Sergey and Page, Larry. 1998. "The anatomy of a large-scale hypertextual web search engine". Proceedings of the 7th World-Wide Web Conference. Brisbane, Australia.
Other measures:
between_centrality
,
close_centrality
,
closure
,
cohesion()
,
degree_centrality
,
features
,
heterogeneity
,
hierarchy
,
holes
Other centrality:
between_centrality
,
close_centrality
,
degree_centrality
node_eigenvector(mpn_elite_mex)
node_eigenvector(ison_southern_women)
node_power(ison_southern_women, exponent = 0.5)
network_eigenvector(mpn_elite_mex)
network_eigenvector(ison_southern_women)
tie_eigenvector(ison_adolescents)
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.