Difference between revisions of "Edge betweenness"
From Cohen Courses
Jump to navigationJump to search (Created page with 'It is a [[category::method]] discussed in the paper Girvan et al PNAS 2002. The paper defines the edge betweenness of an edge as the number of shortest paths between pairs of…') |
|||
| (2 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
It is a [[category::method]] discussed in the paper [[Girvan et al PNAS 2002]]. | It is a [[category::method]] discussed in the paper [[Girvan et al PNAS 2002]]. | ||
| + | |||
The paper defines the edge betweenness of an edge as the number of shortest paths between pairs of vertices that run along it. If there is more than one shortest path between a pair of vertices, each path is given equal weight such that the total weight of all the paths is unity. | The paper defines the edge betweenness of an edge as the number of shortest paths between pairs of vertices that run along it. If there is more than one shortest path between a pair of vertices, each path is given equal weight such that the total weight of all the paths is unity. | ||
[http://en.wikipedia.org/wiki/Girvan%E2%80%93Newman_algorithm External reference] | [http://en.wikipedia.org/wiki/Girvan%E2%80%93Newman_algorithm External reference] | ||
| + | |||
| + | {{#ask: [[UsesMethod::Edge betweenness]] | ||
| + | | ?AddressesProblem | ||
| + | | ?UsesDataset | ||
| + | }} | ||
Latest revision as of 05:01, 27 September 2012
It is a method discussed in the paper Girvan et al PNAS 2002.
The paper defines the edge betweenness of an edge as the number of shortest paths between pairs of vertices that run along it. If there is more than one shortest path between a pair of vertices, each path is given equal weight such that the total weight of all the paths is unity.
