E-mail
network at Universitat Rovira i Virgili
Community identification according to the Girvan-Newman
algorithm
|
(a) The betweenness of an edge
is defined as the number of minimum paths connecting pairs of nodes that go
through that edge. The GN algorithm is based on the idea that the edges which
connect highly clustered communities have a higher edge betweenness --in this
case, edge BE-- and therefore cutting these edges should separate
communities. The algorithm proceeds by identifying and removing the link with
the highest betweenness in the network. |
Albert Díaz-Guilera