Outdegree Centrality

From SONIVIS:Wiki

Jump to: navigation, search
Outdegree Centrality

This metric is implemented in every version.



The Outdegree Centrality is the normalized number of direct neighbors where the node links to by its outgoing edges.

Objective

The Outdegree Centrality can be used to evaluate the position of a single node in an directed network. The direct outgoing connections of a node are standardized on the network size. The number of these direct outgoing connections is characterized as outdegree of a node.

Calculation

C_{D}(n_i)=\frac{d_{o}(n_i)}{g-1} , where d_{o}(n_i)\,\! is the outdegree of a node n_i\,\! and g\,\! the number of all nodes in the network.

Statement

R-example
library(igraph)
g <- graph.ring(10, directed=TRUE)
degree(g, mode = c("out"))/(length(V(g))-1)

Reference

Personal tools