# Graph Conductance **Conductance** is defined as the connectivity of the group/cluster to the rest of the network relative to the density of the group. So for a given set of nodes, $A$, we have: $Conductance(A) = \frac{\text{\# of edges with one node in A, the other not in A}}{\text{Total weight of edges with at least one node in A}}$ $Conductance(A) = \frac{\text{Cut(A)}}{\text{Volume(A)}}$ %20_%20Stanford%20University%205-28%20screenshot.png) When trying to find clusters we will try and *minimize* the conductance. Here is a good visualization of different conductance scores based on where we make our cut: %20_%20Stanford%20University%207-25%20screenshot.png) --- Date: 20220118 Links to: [Graph-Theory](Graph-Theory.md) Tags: References: * [Lecture 29 — What Makes a Good Cluster (Advanced) | Stanford University - YouTube](https://www.youtube.com/watch?v=zLuVrqlYKyg&list=PLLssT5z_DsK9JDLcT8T62VtzwyW9LNepV&index=30&t=386s)