# Hairball Graphs (data)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Let be a partition of $V$ for a graph . Then is called a clustering of with class for a vertex . The probability of an edge is if and if .