Girvan–Newman algorithm: Difference between revisions

Revision as of 13:40, 22 May 2009

Revision as of 11:45, 29 October 2009

Line 1:

The '''Girvan-Newman algorithm''' is one of the methods used to detect [[communities]] in [[complex system]]s.<ref name=newman>Girvan M. and Newman M. E. J., [http://dx.doi.org/10.1073/pnas.122653799 Community structure in social and biological networks], Proc. Natl. Acad. Sci. USA '''99''', 7821-7826 (2002)</ref> The notion of a "community structure" is related to that of clustering, though it isn't quite the same. A community consists of a subset of nodes within which the node-node connections are dense, and the edges to nodes in other communities are less dense.<ref name=newman/> There are numerous alternative method for detecting communities in networks. These include [[Hierarchical Clustering | hierarchical clustering]], partitioning graphs to maximize quality functions such as [[Modularity (networks)|network modularity]], [[Clique Percolation Method|k-clique percolation]], etc.

== Edge betweenness and community structure ==