Tutorial to the workshop “First steps in social network analysis”
There are three network measures: degree centrality, closeness centrality and betweennesscentrality.
Degree
centrality
measures communication activity.
Degree
centrality
of a node/vertex: number of incoming and outgoing edgeswhere
i
is the node, is a sum of incoming edges and is a sum of outcoming edges.If undirected graph is analyzed (edges of a graph has no direction) then d
egree
centrality
of anode/vertex: number of all edges that the node has :
Closeness
centrality
measures how independent and efficient the node is.The
closeness
of a node i is defined as: ,where
∑
∈
N j
jid
),(
is the sum of distances from the node
i
to all the other nodes in agraph. In other words, you need to define all the paths from the node
I
to all the other nodes. Thelength of the paths should be the minimal(shortest path).
Shortest path
is a path that has minimum number of edges taken in order to “move ” from one to theother node.Group 1 and Group 2 are part of a network.These groups are connected with the help of A,Bor C nodes. There exist shortest paths from anynode in the Group 1 to any node in the Group 2if and only if it uses AB edge. The paths fromany node in Group 1 to any node to Group 2that are going through A –C – B path are in nocase shortest paths as there is an option to useAB edge to define the shortest paths.
The shortest-paths
v
(
j
,
k
) for each nodes
j
,
k
and
j
≠
k
the
betweenness centrality
of node
i
is
where
),(
k jv
i
is the number of shortestest paths that go from any node
j
to any node
k
through thenode
i
and
),(
k jv
is the number of shortest paths that go from any node
j
to any node
k.
∑=
∈
N j
jid
ic
),(1
)(
∑
≠
≡
k jii
k jvk jvb
),(),(
∑∑
−+
+=
)()()(
id id id
∑
+
)(
id
∑
−
)(
id
∑
=
)()(
id id
Leave a Comment