Indegree Centrality
From SONIVIS:Wiki
Indegree Centrality
|
The Indegree Centrality is the normalized number of direct neighbors that build incoming edges.
Objective
The Indegree Centrality can be used to evaluate the position of a single node in an directed network. The direct incoming connections of a node are standardized on the network size. The number of these direct incoming connections is characterized as [Indegree |indegree]] of a node.
Calculation
, where 
is the indegree of a node 
and 
the number of all nodes in the network.
Statement
| R-example |
| library(igraph) g <- graph.ring(10, directed=TRUE) degree(g, mode = c("in"))/(length(V(g))-1) |
