Graph cut
= Graph cut
{title2=$\partial S=\{\{i,j\}\in E:i\in S,j\notin S\}$}
A graph cut consists of the <edges> joining a vertex subset to its complement. In a two-group <stochastic block model>, crossing and within-group <edges> have different <Bernoulli distributions>. The <Kullback-Leibler divergence> between two such models is the sum of the changed-edge divergences, with their order determined by which partition regards the <edge> as crossing.