Difference between revisions of "Girvan et al PNAS 2002"
From Cohen Courses
Jump to navigationJump to search| Line 6: | Line 6: | ||
[http://www.pnas.org/content/99/12/7821.long Link to pnas] | [http://www.pnas.org/content/99/12/7821.long Link to pnas] | ||
| + | |||
| + | == Summary == | ||
| + | |||
| + | This [[Category::paper]] shows a method for detecting community structure in a network which addresses the topic of [[AddressesProblem::Community Detection]]. The method is designed with the setting that network nodes are joined together in tightly-nit groups between which there are only looser connections. | ||
| + | |||
| + | The key idea is to construct the communities by removing edges from the original graph, contrasting to the traditional way which constructs the communities by add edges to the vertex set. The edges to be removed is chosen based on the edge "betweenness" - the number of shortest paths between pairs of vertices that run along the edge. | ||
Revision as of 01:42, 27 September 2012
Citation
Girvan, M. & Newman, M. E. J. Community structure in social and biological networks. Proc. Natl. Acad. Sci. USA 99, 7821-7826 (2002).
Online Version
Summary
This paper shows a method for detecting community structure in a network which addresses the topic of Community Detection. The method is designed with the setting that network nodes are joined together in tightly-nit groups between which there are only looser connections.
The key idea is to construct the communities by removing edges from the original graph, contrasting to the traditional way which constructs the communities by add edges to the vertex set. The edges to be removed is chosen based on the edge "betweenness" - the number of shortest paths between pairs of vertices that run along the edge.
