Content deleted Content added
Removing media that lack source and/or copyright info and have been tagged as such for more than 7 days per speedy deletion criterea 4 for images. |
m Minor correction to description of algorithm, wikified 'dendrogram', removed reference to nonexistent diagram. |
||
Line 14:
# The edges with the highest betweenness are removed.
# The betweenness of all edges affected by the removal is recalculated.
#
The fact that the only betweennesses being recalculated are only the ones which are affected by the removal, may lessen the running time of the process' simulation in computers. However, the betweenness centrality must be recalculated with each step, or severe errors occur. The reason is that the network adapts itself to the new conditions set after the edge removal. For instance, if two communities are connected by more than one edge, then there is no guarantee that '''all''' of these edges will have high betweenness. According to the method, we know that '''at least one''' of them will have, but nothing more than that is known. By recalculating betweennesses after the removal of each edge, it is ensured that at least one of the remaining edges between two communities will always have a high value.
The end result of the Newman-Girvan algorithm is a [[dendrogram
== See also ==
| |||