Difference between revisions of "Conductance"
From Cohen Courses
Jump to navigationJump to search (Created page with 'Conductance is a way to measure the quality of a community. By an empirical definition of communities, a good community should have more internal links and less externals links. …') |
|||
Line 1: | Line 1: | ||
− | Conductance is a way to measure the quality of a community. By an empirical definition of communities, a good community should have more internal links and less externals links | + | Conductance is a way to measure the quality of a community. By an empirical definition of communities, a good community should have more internal links and less externals links. |
− | + | From this intuition, the [[UsesMethod::Conductance]] of a cut <math>(S, \bar S)</math> in a graph is defined as: | |
:<math>\varphi(S) = \frac{\sum_{i \in S, j \in \bar S}a_{ij}}{\min(a(S),a(\bar S))}</math> | :<math>\varphi(S) = \frac{\sum_{i \in S, j \in \bar S}a_{ij}}{\min(a(S),a(\bar S))}</math> |
Latest revision as of 22:09, 5 November 2012
Conductance is a way to measure the quality of a community. By an empirical definition of communities, a good community should have more internal links and less externals links.
From this intuition, the Conductance of a cut in a graph is defined as:
where the are the entries of the adjacency matrix for G, so that
is the total number (or weight) of the edges incident with S.