Girvan–Newman algorithm: Difference between revisions

Content deleted Content added
m moved Newman-Girvan algorithm to Girvan-Newman algorithm: This is the correct order of the names -- sometimes called "the GN Algorithm."
No edit summary
Line 1:
The '''Girvan-Newman algorithm''' is one of the methods used to detect communities in complex systems.<ref name=newman>Girvan M. and Newman M. E. J., Proc. Natl. Acad. Sci. USA '''99''', 7821-7826 (2002)</ref> The notion of a "community structure" is different than that of clustering. The latter refers to the "small-world" property of a certain group of nodes within a network, where the [[Average Path Length | average path length]] <math>\ell</math> among the nodes is relatively small. A community instead, is a subset of nodes within which the node-node connections are dense, and the edges among communities are less dense.<ref name=newman/> A simplified version of a network containing communities in it is shown in Fig. 1. An alternative method for the detection of communities within networks is the [[Hierarchical Clustering | hierarchical clustering]].
 
== Edge betweenness and community structure ==